Looking for a LL(1) generator

Francois Gagnon <fgagnon@inouii.com>
21 Jul 2003 21:35:27 -0400

          From comp.compilers

Related articles
Looking for a LL(1) generator fgagnon@inouii.com (Francois Gagnon) (2003-07-21)
Re: Looking for a LL(1) generator rivers@dignus.com (Thomas David Rivers) (2003-07-23)
Re: Looking for a LL(1) generator parag@codegen.com (Parag Patel) (2003-07-25)
Re: Looking for a LL(1) generator news@lintilla.demon.co.uk (2003-07-26)
| List of all articles for this month |

From: Francois Gagnon <fgagnon@inouii.com>
Newsgroups: comp.compilers
Date: 21 Jul 2003 21:35:27 -0400
Organization: Compilers Central
Keywords: LL(1), question
Posted-Date: 21 Jul 2003 21:35:27 EDT


    I am looking for a tool which would take an "almost LL(1)" grammar and
would generate an LL(1) grammar production for it. This can certainly be
impossible (for case of left recursion for instance or if the grammar is
just not in the LL(1) class), but I wondered if there is a tool that can
at least handle some "sub set" of such a grammar (I think that the
Dragon book had an algorithm for this... It'd have to dig this up...)

A simple example:

x : 'a' 'x'
      | 'a' 'y'

Such tool could generate something like:

x : 'a' x1

x1 : 'x'
        | 'y'


Post a followup to this message

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