Re: LL1 program ???

Janaki S <janaki@csa.iisc.ernet.in>
10 Jul 1998 20:59:36 -0400

          From comp.compilers
Related articles
LL1 program ??? Andrea.Palmieri@ii.uam.es (Aulas de =?iso-8859-1?Q?Inform=E1tica?=) (1998-07-01)
Re: LL1 program ??? msrao@india.ti.com (Srikanth M) (1998-07-03)
Re: LL1 program ??? joachim.durchholz@munich.netsurf.de (Joachim Durchholz) (1998-07-03)
Re: LL1 program ??? janaki@csa.iisc.ernet.in (Janaki S) (1998-07-10)
Re: LL1 program ??? napi@cel.mimos.my (1998-07-11)
Re: LL1 program ??? joachim.durchholz@munich.netsurf.de (Joachim Durchholz) (1998-07-13)
Re: LL1 program ??? rod.bates@boeing.com (Rodney M. Bates) (1998-07-20)
Re: LL1 program ??? leichter@smarts.com (Jerry Leichter) (1998-07-21)
Re: LL1 program ??? jamz@my-dejanews.com (1998-07-24)
| List of all articles for this month |
From: Janaki S <janaki@csa.iisc.ernet.in>
Newsgroups: comp.compilers
Date: 10 Jul 1998 20:59:36 -0400
Organization: Compilers Central
References: 98-07-009 98-07-033
Keywords: parse, LL(1), theory

=> Aulas de Informatica wrote:
=> > I am looking for a tool for transforming any language (given its
=> > grammar) into an equivalent one in its LL1 form.
=>
=> This is not possible. You can however convert a few left recursive
=> languages into their LL1 forms using Left factoring and into Right
=> recursive forms. The set of LR grammars is far greater than LL1 so
=> don't even attempt it !!
=>
I think there should be some way of doing that. According to
Knuth, any prefix free language can be coded into an LL0 grammar, and
others can be coded into an LL1 by giving an end marker. I haven't heard
about any such tool which does this automatically, but it is possible to
do it.


regards,
Janaki
--

Post a followup to this message

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