|generating recursive parsers from grammars. firstname.lastname@example.org (Ralph Boland) (2006-02-03)|
|Re: generating recursive parsers from grammars. email@example.com (Peter Gammie) (2006-02-06)|
|Re: generating recursive parsers from grammars. firstname.lastname@example.org (Josef Grosch) (2006-02-06)|
|Re: generating recursive parsers from grammars. email@example.com (2006-02-07)|
|generating recursive parsers from grammars. firstname.lastname@example.org (Lowell Thomas) (2006-02-20)|
|From:||Peter Gammie <email@example.com>|
|Date:||6 Feb 2006 00:05:12 -0500|
|Posted-Date:||06 Feb 2006 00:05:11 EST|
On 04/02/2006, at 1:01 PM, Ralph Boland wrote:
> I am interested in classes of grammars that are not LL(1) but
> for which it is possible to generate recursive parsers automatically.
I don't know quite what you mean by "recursive parsers" but I'd
suggest you look at parsing techniques developed in functional
languages. Here's a starting point:
in particular this paper:
IIRC Swierstra has extended these techniques to deal with left
recursion but I do not have a reference for that.
(there is a "... in Java" paper there if you prefer something more
Return to the
Search the comp.compilers archives again.