[lojban-beginners] Re: RK-like diagramming: Anyone interested?

["Jonathan Gibbons" <jonored@gmail.com>]

Okay. The whole thing with elidable terminators really does seem to go
away with the rather normal extension of priorities; they establish a
total ordering allowing one to answer the question "if either of these
rules could match, use this one"... so give all the rules with
terminators higher priority than all the ones without, and be done
with it?

or am I missing something? I mean, yes, that does mean that the
language is not parsable with a constant lookahead, but that's an
implementation question, and there are other algorithms that can
handle non-constant but finite lookahead...

-Jonathan.