|parsers for ambiguous grammars? firstname.lastname@example.org (1994-02-16)|
|Re: parsers for ambiguous grammars? email@example.com (1994-02-18)|
|Re: parsers for ambiguous grammars? firstname.lastname@example.org (1994-02-28)|
|From:||email@example.com (Mark-Jan Nederhof)|
|Organization:||University of Nijmegen, The Netherlands|
|Date:||Mon, 28 Feb 1994 16:13:50 GMT|
firstname.lastname@example.org (Rene Dekker) writes:
>I am looking for parsing techniques that can handle a highly ambiguous
>grammar and are able to generate partial parses. I am aware that
>chart-parsers can do such a thing, but I am looking for other techniques
>I am particularly interested in parsers that aply these techniques to
>graphs. Any pointer to literature or ideas on this matter are welcome.
Tabular parsing and graphs? One paper comes to mind:
Hemerik and Katoen: Bottom-up tree acceptors
Science of Computer Programming 13, 51-72
PS. Chart parsing is a particular view of tabular parsing, with specific
terminology and notation (which I very much dislike). Other examples of
tabular parsing are graph-structured stacks (e.g. Tomita's algorithm) and
dynamic programming for parsing (see the papers by Bernard Lang) and even
memo functions (applied to e.g. functional recursive-descent parsers).
University of Nijmegen
Return to the
Search the comp.compilers archives again.