3 Feb 2006 21:01:12 -0500

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

From: | "Ralph Boland" <rpboland@gmail.com> |

Newsgroups: | comp.compilers |

Date: | 3 Feb 2006 21:01:12 -0500 |

Organization: | http://groups.google.com |

Keywords: | parse, LL(1), question |

Posted-Date: | 03 Feb 2006 21:01:12 EST |

Recursive Descent parsers can automatically generated from LL(1)

grammars.

However it not difficult to write recursive parsers by hand

for many grammars which are not LL(1).

I am interested in classes of grammars that are not LL(1) but

for which it is possible to generate recursive parsers automatically.

A quick search using google led me to one paper by Terrance Parr

(called LL(*) Parsing) but that is all that I have found.

Can anyone point me to papers or parser generator tools that

that deal with generating recursive parsers from non-LL(1)

grammars?

Thanks

Ralph Boland

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.