Re: Submission for manual (was: Non-greedy wildcard possible?)

[Frank Heckenbach]

Paul Hilfinger wrote:

> Thanks for the section.  A few comments:
>
> 1. 
> > However, the GLR algorithm can also be used in a simpler
> > way to parse a grammar that is unambiguous, just fails to be
> > LALR(1).
> 
> The English around the second comma seems a bit too informal, and you
> might also want to mention how the situation can arise:
> 
>       "... to parse grammars that are unambiguous, but fail to be 
>       LALR(1).  Such grammars typically require more than one
>       symbol of lookahead, or (in rare cases) fall into the category 
>       of grammars in which the LALR(1) algorithm throws away too much
>       information (they are in LR(1), but not LALR(1)). 

Actually, IMHO, in the latter case, I'd probably rather use a
"bogus" token as explained in the "Mystery Conflicts" section. This
may be personal preference, so I don't know if I should mention it
here. But I'm adding a reference to that section, so the reader
knows about the alternative.

I've applied your other comments.

Frank

-- 
Frank Heckenbach, address@hidden
http://fjf.gnu.de/
GnuPG and PGP keys: http://fjf.gnu.de/plan (7977168E)

glr-simple.texi
Description: TeXInfo document