parsers for ambiguous grammars?

dekker@dutiws.twi.tudelft.nl (Rene Dekker)
Wed, 16 Feb 1994 12:39:56 GMT

          From comp.compilers
Related articles
parsers for ambiguous grammars? dekker@dutiws.twi.tudelft.nl (1994-02-16)
Parser for ambiguous grammars: GLR(k). mark@freenet.uwm.edu (1994-02-17)
GLR(k) parsing using Quantum Grammars mark@freenet.uwm.edu (1994-02-18)
Re: parsers for ambiguous grammars? stachour@sctc.com (1994-02-18)
Re: parsers for ambiguous grammars? markjan@cs.kun.nl (1994-02-28)
| List of all articles for this month |
Newsgroups: comp.compilers
From: dekker@dutiws.twi.tudelft.nl (Rene Dekker)
Keywords: parse, question
Organization: Delft University of Technology
Date: Wed, 16 Feb 1994 12:39:56 GMT

Hello,


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
also. (Chart-parsers maintain a database of complete and incomplete
parses. They produce new parses by combining these parses with each other
and with the rules of the grammar.)


I am particularly interested in parsers that aply these techniques to
graphs. Any pointer to literature or ideas on this matter are welcome.


Many thanks,
Rene'
--
Rene Dekker Delft University of Technology r.dekker@twi.tudelft.nl
--

Post a followup to this message

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