Re: Relaxed pattern recognition

Ralf Laemmel <>
13 Dec 2003 20:56:25 -0500

          From comp.compilers

Related articles
Relaxed pattern recognition (2003-12-08)
Re: Relaxed pattern recognition (Ralf Laemmel) (2003-12-13)
Re: Relaxed pattern recognition (2003-12-13)
Re: Relaxed pattern recognition (Chris Dodd) (2003-12-13)
| List of all articles for this month |

From: Ralf Laemmel <>
Newsgroups: comp.compilers
Date: 13 Dec 2003 20:56:25 -0500
Organization: Compilers Central
References: 03-12-072
Keywords: parse
Posted-Date: 13 Dec 2003 20:56:25 EST

Mars Saxman wrote:

>I would like to write a parser using bison that deals with fragments
>of source code that may or may not be complete. I would like to
>construct an AST from the source code using whatever parts exist,
>resolving them into more specific structures whenever they match some

If I get you right, then you are describing a form of --- as we call
it --- "tolerant parsing". In the following paper, you will find a
kind of overview and lots of references on tolerant parsing:

P.S.: I am interested in you application context, please let me know.

Post a followup to this message

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