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) |
From: | Joachim Durchholz <joachim.durchholz@munich.netsurf.de> |
Newsgroups: | comp.compilers |
Date: | 13 Jul 1998 23:40:35 -0400 |
Organization: | Compilers Central |
References: | 98-07-009 98-07-033 98-07-098 |
Keywords: | parse, LL(1) |
Mohd-Hanafiah Abdullah wrote:
>
> As mentioned it's impossible to transform just any language grammar to
> its LL(1) equivalent. But, you may be interested in a program written
> by Will Clinger in Scheme that tells whether your grammar is LL(1) or not.
Of course this doesn't tell you whether the *language* is LL(1) or not.
(An LL(1) language is a language that has an LL(1) grammar; if you
grammar happens not to be LL(1), this doesn't mean an LL(1) grammar
doesn't exist for it.)
Regards,
Joachim
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.