[lojban] Re: CFG prize challenge question

[Jorge Llambías <jjllambias@gmail.com>]

OK, let me try a different approach, because I really don't understand
how this formalism is supposed to work. Suppose we have this small
grammar with three elidable terminators VAU, KU and KEI:

sentence = [terms [CU]] selbri [terms] /VAU/

terms = [terms] sumti

sumti = KOhA | LE selbri /KU/

selbri = [selbri] tanru-unit

tanru-unit = BRIVLA | NU sentence /KEI/

How many start and terminator tokens do we need (if there is a small
number, what are they, if there are too many to list, what are some
examples) and what is it that blows up when moving from the
non-elidable to the elidable case?

(Sorry if I'm being too dense.)

mu'o mi'e xorxes


To unsubscribe from this list, send mail to lojban-list-request@lojban.org
with the subject unsubscribe, or go to http://www.lojban.org/lsg2/, or if
you're really stuck, send mail to secretary@lojban.org for help.