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

["Cyril Slobin" <cyril@slobin.pp.ru>]

On 10/29/08, Robin Lee Powell <rlpowell@digitalkingdom.org> wrote:

>  > A machine that generated its output from such a grammar would
>  > generate valid Lojban. If you want an unambiguous CFG (which is
>  > obviously a somewhat harder problem) I think you need to specify
>  > it.
>
>  Then please, everyone, consider it so specified.  Apologies for
>  triple posting again, but if xorxes is right this is important.

Correct me if I mislook something, but without this clarification the
task seems to be trivial, isn't it? If we don't care about parsing
tree, we can just make all elidable terminators optional and get the
solution. Look at a very tiny subset of the language:

<bridi> ::= broda | <bridi> <bridi> | nu <bridi> | nu <bridi> kei

The string "nu broda broda" can be generated in two ways:

((nu broda) broda) and (nu (broda broda))

, but the grammar generates all good strings and only good strings.
Therefore unambiguity is the central difficulty there.

-- 
http://slobin.pp.ru/ `When I use a word,' Humpty Dumpty said,
<cyril@slobin.pp.ru> `it means just what I choose it to mean'


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.