Ambiguous recursive-descent parsing

Paul Stodghill <stodghil@cs.cornell.edu>
24 Mar 2003 21:51:07 -0500

          From comp.compilers
Related articles
Ambiguous recursive-descent parsing stodghil@cs.cornell.edu (Paul Stodghill) (2003-03-24)
Re: Ambiguous recursive-descent parsing cfc@world.std.com (Chris F Clark) (2003-03-30)
Re: Ambiguous recursive-descent parsing rivers@dignus.com (Thomas David Rivers) (2003-03-30)
Re: Ambiguous recursive-descent parsing slk14@earthlink.net (SLK Parsers) (2003-03-30)
Re: Ambiguous recursive-descent parsing oliver@zeigermann.de (Oliver Zeigermann) (2003-04-13)
Re: Ambiguous recursive-descent parsing gopi@sankhya.com (2003-04-27)
| List of all articles for this month |
From: Paul Stodghill <stodghil@cs.cornell.edu>
Newsgroups: comp.compilers
Date: 24 Mar 2003 21:51:07 -0500
Organization: Cornell University
Keywords: parse, LL(1), question
Posted-Date: 24 Mar 2003 21:51:07 EST

Could someone point me to a good survey of work that has been done on
recusive-descent parsing that deals with ambiguities in the language?
I have some ideas for how Tomita-style techniques for managing
multiple parse "states" can be combined with LL(1) parsing to easily
parse languages like C++, but I want to make sure that I am not
re-inventing the wheel.


Thanks.


--
Paul Stodghill <stodghil@cs.cornell.edu>
Dept. of Computer Science
Cornell University
Ithaca, NY 14853
USA
[Never seen anyone do that. The RD parsers I've seen use ad-hoc
lookahead or other hacks to disambiguate on the fly. Or far too often
the programmer didn't realize the grammar was ambiguous, so the parser
just does something wrong. -John]


Post a followup to this message

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