Re: Lazy/tolerant parsers

Thank you Quinn and Dmitry for your inputs.


Quinn, I need some more time to go over your suggestion :)


"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote
> Ada 95 expression parser and tree generator). The parser stops at
> something it cannot recognize. At this point one can determine its
> state. I.e. how many unclosed brackets, missing right operands etc you
> have. One can use some kind of pattern matching to jump over an
> indigestible part (not a name or literal, but just rubbish) and


To where ?? That was the second part to my question. From my parser I
can get details of how and where the error happened. But still the
questions of how to
- recover from the error
- resynch
- continue parsing as if unaffected from error


are open. Can't seem to find out a good solution to these problems.


Regards
- Akhilesh

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