Re: Ambiguous recursive-descent parsing

Thomas David Rivers <rivers@dignus.com>
30 Mar 2003 00:38:22 -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: Thomas David Rivers <rivers@dignus.com>
Newsgroups: comp.compilers
Date: 30 Mar 2003 00:38:22 -0500
Organization: Dignus, LLC
References: 03-03-148
Keywords: parse, LL(1)
Posted-Date: 30 Mar 2003 00:38:22 EST

Paul Stodghill wrote:
> 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?


My master thesis, some years ago now, was how to extend LL(1)
languages with a regular-expression pre-scan. I'm afraid I would have
to dig up the paper to see exactly where that fit in...


The result was shown to be "bigger" than LL(1) (that is, it was shown
to accept languages that were not LL(1)), but "smaller" than LR(k), if
I recall correctly...


- Dave Rivers -
--
rivers@dignus.com Work: (919) 676-0847

Post a followup to this message

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