Parser for ambiguous grammars: GLR(k).

mark@freenet.uwm.edu (Mark Hopkins)
Thu, 17 Feb 1994 09:36:38 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)
| List of all articles for this month |
Newsgroups: comp.compilers
From: mark@freenet.uwm.edu (Mark Hopkins)
Keywords: parse
Organization: Compilers Central
References: 94-02-099
Date: Thu, 17 Feb 1994 09:36:38 GMT

>I am looking for parsing techniques that can handle a highly ambiguous
>grammar and are able to generate partial parses.


I wrote an implementation of the Tomita Parsing algorithm (GLR(k) parsing).
If anyone wants a copy, contact me and I'll send it. Better yet, if it
could only be FTP archived somewhere...
--

Post a followup to this message

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