I,ve now got a preliminary version of the full parser runn= ing.

Basically the parser is just the re-formatted PEG, = the rest is about 150 lines of quite ordinary Lua code for glue between the= stages, some very small =A0help functions and pretty printing. The source = files (The driver program, the morphology PEG and the grammar PEG) presentl= y total 2560 lines (incl. the comments and the empty separator lines), abou= t 78 kbytes. There is no binary for the parser, which is compiled for each = run. The compilation time is about 100 ms on any decent PC, which has helpe= d a lot during the testing and refinement stage.

The parser outputs a full parse tree in the form of a L= ua table definition instead of something intended for immediate human consu= mption or interpretation by some external program. The inherently available= Lua interpreter is used to compile the definition into a table, which can = then be recursively traversed with (very) simple routines to produce any de= sired kind of output.

I've omitted the erasure handling rules as they see= med to cause too much slowdown and =A0rewritten some rules to speed up the = parsing process. I've also added =A0rules to bracket sumti tcita and ze= i =A0lujvo. I had to add rules to the morphology PEG in order to keep any q= uoted non-Lojban text intact - now the quoted text is sent as a single non-= L word to the grammar PEG.

The parser will handle multiple paragraph text, but I h= aven't yet any ideas about error recovery or meaningful error messages.= Presently the program just produces an output up to the last structure pas= sing the parser, which isn't very helpful - especially as there sometim= es is no output what so ever.

My present, very simple pretty printer is quite flexibl= e. It can produce either the full parse tree, which is probably required on= ly for checking the parser, or omit the numbered sub-rules (sumti-1,...) or= omit any user-defined set of intermediate levels from the tree. It would b= e trivial to add glosses for cmavo and gismu to the output. I've also g= iven some thought to passing the lujvo split from the morphology PEG.

I'll have to do some more testing before releasing = the program for general consumption. I also haven't yet given any thoug= ht to the user interface. Presently all the parameters are set by editing t= he driver program as the compilation time is no problem.

=A0 Veijo

<= /div>

Some examples of the present output:

a) a "full" tree (without the numbered sub-rules)

text

| paragraphs

| | paragraph

| |= | statement

| | | | sentence

| | | | | | | tag

| | |= | | | | | | | time

| | = | | | | selbri

| | | | | | = | terms

| | |= | | | | | | | description

= | | | | | | | | | | | sumti tail

| | | | | | | | | | | |= | | abstraction

<= div>| | | | | | | | | | | | | | | subsentence

| | | | | | | | | |= | | | | | | sentence

| | | | | | | | | | = | | | | | | | | term

| | | | | = | | | | | | | | | | | | | | | | LA la

| | | |= | | | | | | | | | | | | | | | | joik ek

| | | | | | | | | | | | = | | | | | | | | | ek

| | | | | | | | | | | | | | | | | | | | | | = A ji

| | |= | | | | | | | | | | | | | | | | | | | | indicator

| | | | | | | = | | | | | | | | | | | | | | | | | UI kau

| | | | | | | | | | | | = | | | | | | | | name

| | | | | | = | | | | | | | | | | | | | | | CMENE djordz

| | | | | | | | | | | = | | | | | | CU clause

| | | | | | | |= | | | | | | | | | | selbri

| | | | | | |= | | | | | | | | | | | | terms

| | | | | | | | | | | | | | | | | = | | | term

| | = | | | | | | | | | | | | | | | | | | | | | LE le

| | | | | | | | |= | | | | | | | | | | | | | | sumti tail

| | | | | | | | | | | | |= | | | | | | | | | | | selbri

b) the same tree after omitting some intermediate lev= els (an ad-lib pruning made by giving a list of rules to omit)

paragraph

| statement

| | sent= ence

| | | sumti

| | | | KOhA mi

| | | tense = modal

| | | | time

| | | selbri

| | | | BRIVLA gismu zga= na

| | | sumti

| | | | description

|= | | | | | | | sumti

| | | | | |= | | | | LA la

| | | | |= | | | | ek

| | | | | | | | | | A ji

= | | | | | | | | selbri

= c) the tree can also indicate any elided terminators

paragraph

| statement

| | sentence

= | | | sumti

| | | | KOhA mi

| | | tense modal

| | | | time

| | | *ELIDED KU

| | | *ELIDED CU

| | | selbri

| | | | BRIVLA gismu zgana

| | | sumti

| | | | d= escription

| | |= | | | | sentence

| | | | | | | |= | name

| | | | | | | | | ek

| | | | | | | | | | A ji

| | = | | | | | | | | indicator

= | | | | | | | | | name

| | | = | | | | | | | CMENE djordz

= | | | | | | | | selbri

| | | *ELIDED VAU

<= /div>

d) a sumti tcita example (bracketing the sumti tcita will simplif= y enumerating the main sumti at some later stage)

paragraph

| statement

| | sentence

= | | | sumti

| | | | KOhA mi

| | | selbri

| | | | BRIVLA gismu = klama

| | | sumti

| | | | description

| | | |= | LE le

| | | sumti tcita

| | | | tense modal

| | | | sumti

| | |= | | | | | NU nu

| | | | | | |= | | sumti

| | | | | | | | = | selbri

| | | | | | | | | | = | LE le

| | | | | | | | | = | | | BRIVLA gismu zdani

e) two zei lujvo examples from the CLL

paragraph

| statement

| | sentence<= /div>

| | | selbri

| | | | zei lujvo

| | | | BRIVLA lujvo livg= yterbilma

paragraph

| stateme= nt

| | sentence

| | | selbri

| | | | zei lujv= o

--
You received this message because you are subscribed to the Google Groups "= lojban" group.
To post to this group, send email to lojban@googlegroups.com.
To unsubscribe from this group, send email to lojban+unsubscribe@googlegrou= ps.com.
For more options, visit this group at http://groups.google.com/group/lojban= ?hl=3Den.
--f46d0438939de4c3d904c2f704ab--