The Gedcom parser library

@@ -13,10 +10,33 @@

The intention of this page is to provide some explanation of the gedcom parser, to aid development on and with it. First, some practical issues of testing with the parser will be explained.
-
+
+

Index

Testing

Basic testing
Preparing for further testing
Testing the parser with debugging
Testing the lexers separately
+

Structure of the parser

Character encoding
+

+
+

Testing
+

+ -

Basic testing
-

Basic testing
+ +

+ You should be able to perform a basic test using the commands:

./configure @@ -24,16 +44,16 @@ some practical issues of testing with the parser will be explained. make check

If everything goes OK, you'll see that some gedcom files are parsed, - and that each parse is successful. Note that the used gedcom files + and that each parse is successful. Note that some of the used gedcom files are made by Heiner Eichmann and are an excellent way to test gedcom parsers thoroughly.

-

Preparing for further testing

- The basic testing described above doesn't show anything else than -"Parse succeeded", which is nice, but not very interesting. Some + +

Preparing for further testing

+Some more detailed tests are possible, via the testgedcom program -that is generated by make test.
+that is generated by make.

However, since the output that testgedcom generates is in UTF-8 format (more on this later), some preparation is necessary @@ -66,7 +86,9 @@ the xterm coming with XFree86 4.0.x). UTF-8 capabilities and see the result.

-

Testing the parser with debugging

+ +

Testing the parser with debugging

+ Given the UTF-8 capable terminal, you can now let the testgedcom program print the values that it parses. An example of a command line is (in the gedcom directory):
@@ -90,37 +112,103 @@ containing a lot of special characters.
show a lot of special characters.

-

Testing the lexers separately

+ +

Testing the lexers separately

+ The lexers themselves can be tested separately. For the 1-byte lexer (i.e. supporting the encodings with 1 byte per characters, such as - ASCII, ANSI and ANSEL), the sequence of commands would be:
+ ASCII, ANSI and ANSEL), the command would be (in the gedcom subdirectory):
-

make clean - make test_1byte + make lexer_1byte - This will show all tokens in the t/allged.ged test file. - Similar tests can be done using make test_hilo and -make test_lohi (for the unicode lexers). + This will generate a lexer program that can process e.g. the t/allged.ged + test file. Simply cat the file through the lexer on standard input +and you should get all the tokens in the file. Similar tests can be +done using make lexer_hilo and +make lexer_lohi (for the unicode lexers). In each of the cases you need to know yourself which of the test files are appropriate to pass through the lexer. This concludes the testing setup. Now for some explanations... - + - Structure of the parser + Structure of the parser I see the structure of a program using the gedcom parser as follows: - TO BE COMPLETED... + The parser is based on lex/yacc, which means that a module generated by lex + takes the inputfile and determines the tokens in that file (i.e. the smallest +units, such as numbers, line terminators, GEDCOM tags, characters in GEDCOM +values...). These tokens are passed to the parser module, which is +generated by yacc, to parse the syntax of the file, i.e. whether the tokens +appear in a sequence that is valid. + +For each recognized statement in the GEDCOM file, the parser calls some callbacks, +which can be registered by the application to get the information out of +the file. + +This basic description ignores the problem of character encoding. The next section describes what this problem exactly is. + + Character encoding + The character encoding problem + +Developers are usually familiar with the ASCII character set. This +is a character set that assigns a unique number to some characters, e.g. +an "A" has ASCII code 65 (or 0x41 in hex), and an "a" has ASCII code 97 (or +0x61 in hex). Some people may also have used ASCII codes for several +drawing characters (such as a horizontal bar, a vertical bar, or a top-right +corner) in the old DOS days, to be able to draw nice windows in text mode. + +However, these last characters are strictly spoken not part of the ASCII +set. The standard ASCII set contains only the character positions from +0 to 127 (i.e. anything that fits into an integer that is 7 bits wide). An +example of this table can be found here. Anything that has an ASCII code between 128 and 255 is in principle undefined. + +Now, several systems (including the old DOS) have defined those character +positions anyway, but usually in totally different ways. Some well +known extensions are: + + the DOS + character set, nowadays usually known as Code Page 437, but sometimes also +named LatinUS, ECS (Extended Character Set) or PC-8; note that the table +displayed in the link also contains the standard ASCII part + the ANSI character set, also known as Code Page 1252, and usually the default on Windows + the ISO-8859-1 character set (also called Latin-1), which is an ISO standard for Western European languages, mostly used on various Unices + the Adobe Standard Encoding, which is by default used in Postscript, unless overridden + +And these are only examples of character sets used in West-European languages. + For Japanese, Chinese, Korean, Vietnamese, ... there are separate character +sets in which one byte's meaning can even be influenced by what the previous +byte was, i.e. these are multi-byte character sets. This is because +even 256 characters is totally inadequate to represent all characters in +such languages. + +So, summarizing, if a text file contains a byte that has a value 65, it is +pretty safe to assume that this byte represents an "A", if we ignore the +multi-byte character sets spoken of before. However, a value 233 cannot +be interpreted without knowing in which character set the text file is written. + In Latin-1, it happens to be the character "é", but in another +character set it can be something totally different (e.g. in the DOS character +set it is the Greek letter theta). + +Vice versa, if you need to write a character "é" to a file, it depends +on the character set you will use what the numerical value will be in the +file: in Latin-1 it will be 233, but if you use the DOS character set it +will be 130. + + Unicode +Enter the Unicode standard... + +TO BE COMPLETED + - $Id$ $Name$ + $Id$ $Name$

The GEDCOM parser library

The Gedcom parser library

Index

Testing
+

Basic testing
-

Basic testing
+ +

Preparing for further testing

Preparing for further testing

Testing the parser with debugging

Testing the parser with debugging

Testing the lexers separately

Testing the lexers separately

Structure of the parser

Structure of the parser

Character encoding

The character encoding problem
+

Unicode

Using the GEDCOM parser library

The GEDCOM parser library

The Gedcom parser library

Index

Testing +

Basic testing -

Basic testing + +

Preparing for further testing

Preparing for further testing

Testing the parser with debugging

Testing the parser with debugging

Testing the lexers separately

Testing the lexers separately

Structure of the parser

Structure of the parser

Character encoding

The character encoding problem +

Unicode

Using the GEDCOM parser library

Testing
+

Basic testing
-

Basic testing
+ +

The character encoding problem
+