Re: Lazy/tolerant parsers (Akhilesh Mritunjai)
15 Jul 2004 16:35:08 -0400

          From comp.compilers

Related articles
Lazy/tolerant parsers (2004-07-13)
Re: Lazy/tolerant parsers (Dmitry A. Kazakov) (2004-07-14)
Re: Lazy/tolerant parsers (2004-07-15)
Re: Lazy/tolerant parsers (Dmitry A. Kazakov) (2004-07-17)
| List of all articles for this month |

From: (Akhilesh Mritunjai)
Newsgroups: comp.compilers
Date: 15 Jul 2004 16:35:08 -0400
References: 04-07-029 04-07-039
Keywords: parse
Posted-Date: 15 Jul 2004 16:35:08 EDT

Thank you Quinn and Dmitry for your inputs.

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

"Dmitry A. Kazakov" <> 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.

- Akhilesh

Post a followup to this message

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