WikiDiscuss

On Saturday 18 December 2004 00:53, Robin Lee Powell wrote:
> If you want something that is definably unambiguous, but not PEG,
> that's negotiable, but the day that the Lojban community votes to
> define Lojban with a giant English algorithm description instead of
> something provably unambiguous is the day I find something else to
> do with my spare time.

Is a C program sufficiently unambiguous?

xorxes's grammar tells which kind of word a word is, but it requires the word
to be already delimited with spaces or periods. valfendi does not require
this (except in some places such as the end of cmevla), as long as the stress
is indicated in brivla. Like BRKWORDS.TXT, it is designed to take a speech
stream and break it into words.

The problem I see with implementing this in PEG is that valfendi bites off a
piece by counting syllables after the stress, then checks whether, among
other things, the hyphens are in the right place. Is there a way to check one
PE against the part of a string that matched another PE?

phma
--
Now I need a magnifier to find my eyeglasses!
-Les Perles de la médecine