|parsers for ambiguous grammars? email@example.com (1994-02-16)|
|Re: parsers for ambiguous grammars? firstname.lastname@example.org (1994-02-18)|
|Re: parsers for ambiguous grammars? email@example.com (1994-02-28)|
|From:||firstname.lastname@example.org (Paul Stachour)|
|Date:||Fri, 18 Feb 1994 20:59:40 GMT|
email@example.com (Rene Dekker) writes:
>I am looking for parsing techniques that can handle a highly ambiguous
>grammar and are able to generate partial parses.
Wilf LaLonde's LALR parser generator, which I used in the late 1970's, for
IBM's OS/MFT, was able to handle ambiguous grammars, such as those
naturally ocurring for languages such as PL/I. In these types of grammars,
one does not care which of the multiple paths the shift/reduce takes, or
even if the generated parser-code takes any of them arbitrarily; since the
set-of-actions is reasonable in any case.
I used this at the University of Walterloo (Ontario) Computer-Center. I
do not know if this package is still in use or not. Apologies if I
mis-spelled a name or name of the product. it's been 10+ years.
Paul Stachour SCC, 2675 Long Lake Road
firstname.lastname@example.org Roseville, MN 55113
Return to the
Search the comp.compilers archives again.