|Ambiguous recursive-descent parsing email@example.com (Paul Stodghill) (2003-03-24)|
|Re: Ambiguous recursive-descent parsing firstname.lastname@example.org (Chris F Clark) (2003-03-30)|
|Re: Ambiguous recursive-descent parsing email@example.com (Thomas David Rivers) (2003-03-30)|
|Re: Ambiguous recursive-descent parsing firstname.lastname@example.org (SLK Parsers) (2003-03-30)|
|Re: Ambiguous recursive-descent parsing email@example.com (Oliver Zeigermann) (2003-04-13)|
|Re: Ambiguous recursive-descent parsing firstname.lastname@example.org (2003-04-27)|
|From:||Thomas David Rivers <email@example.com>|
|Date:||30 Mar 2003 00:38:22 -0500|
|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 -
firstname.lastname@example.org Work: (919) 676-0847
Return to the
Search the comp.compilers archives again.