Re: LR(1) Parsing : Error Handling & Recovery

> This sort of comment has appeared frequently in the past and to some
> extent I find it puzzing. A recursive descent translation of an LL(k)
> (with k small) grammar is straightforward, and should readilly match the
> grammar, and give you the parse you desire. Is the problem that error


This is misleading. Take your BNF and pass it to a PEG parser: a PEG
parser can accept pretty much the same input syntax as a BNF parser, and
can be considered as a kind of RD parser, so you'd think the result is
necessarily correct.
Well, not so, because the semantics of the language is not the same:
The PEG/RD parser will "silently resolve ambiguities".




                Stefan

Return to the comp.compilers page.
Search the comp.compilers archives again.