[lojban] Re: [llg-members] Re: Re: A challenge for computer science/programming geeks: The LLG wants to give you $500!

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

On Wed, Oct 29, 2008 at 7:27 AM, Kevin Reid <kpreid@mac.com> wrote:
>
> An unambiguous grammar for the same set of parse trees would be
>
>  SELBRI -> SBATOM | SELBRI SBATOM
>  SBATOM -> BRIVLA | "ke" SELBRI "ke'e"

And to make "ke'e" elidable:

SELBRI -> SELBRI-closed | SELBRI-open
SELBRI-closed -> SBATOM-closed | SELBRI-closed SBATOM-closed
SELBRI-open -> SBATOM-open | SELBRI-closed SBATOM-open
SBATOM-closed -> BRIVLA | "ke" SELBRI "ke'e"
SBATOM-open -> "ke" SELBRI

My first impresssion is that the mission truly is impossible: i.e. it
is possible to handle the elidable terminators, but not with less than
2000 production rules, because handling each terminator will multiply
the number of productions by some factor, and there are a lot of
terminators. But that's just my first impression.

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.