Re: generating recursive parsers from grammars.

scavadini@ucse.edu.ar
7 Feb 2006 12:14:59 -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: scavadini@ucse.edu.ar
Newsgroups: comp.compilers
Date: 7 Feb 2006 12:14:59 -0500
Organization: Compilers Central
References: 06-02-039
Keywords: parse, 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.


It is posible to generate recursive descendent parsers for no left
recursive grammars (in fact some tools already do it). For example, there
are some Pascal compilers (Pascal grammars are -almost all of them- not LL
because the ambiguos if-then-else).


The books on parser construction explain how to deal with -LR or LL-
conflicts.


Maybe you can be interested in generate a recursive LR parser. You can
read about this kind of parsers in


Parsing Techniques. A Practical Guide.
Dick Grune, Ceriel Jacobs.
http://www.cs.vu.nl/~dick/PTAPG.html


Regards,


Salvador Valerio Cavadini
Facultad de Matemática Aplicada
Universidad Católica de Santiago del Estero (Argentina)
web: http://www.ucse.edu.ar/fma/staff/svcavadini


Post a followup to this message

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