Re: generating recursive parsers from grammars.

Peter Gammie <peteg42@gmail.com>
6 Feb 2006 00:05:12 -0500

          From comp.compilers

Related articles
generating recursive parsers from grammars. rpboland@gmail.com (Ralph Boland) (2006-02-03)
Re: generating recursive parsers from grammars. peteg42@gmail.com (Peter Gammie) (2006-02-06)
Re: generating recursive parsers from grammars. grosch@cocolab.de (Josef Grosch) (2006-02-06)
Re: generating recursive parsers from grammars. scavadini@ucse.edu.ar (2006-02-07)
generating recursive parsers from grammars. lowell@coasttocoastresearch.com (Lowell Thomas) (2006-02-20)
| List of all articles for this month |

From: Peter Gammie <peteg42@gmail.com>
Newsgroups: comp.compilers
Date: 6 Feb 2006 00:05:12 -0500
Organization: Compilers Central
References: 06-02-039
Keywords: parse

Ralph,


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:


http://www.cs.uu.nl/wiki/Swierstra/PublicationsByYear


in particular this paper:


http://www.cs.uu.nl/people/doaitse/Papers/1996/DetErrCorrComPars.pdf


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
imperative.)


cheers
Peter.


Post a followup to this message

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