Re: An example LL(K) language that is not LL(K-1) ?

Hans Aberg <haberg_20080406@math.su.se>
Thu, 28 Jan 2010 11:03:54 +0100

          From comp.compilers
Related articles
An example LL(K) language that is not LL(K-1) ? klyjikoo@gmail.com (klyjikoo) (2010-01-26)
Re: An example LL(K) language that is not LL(K-1) ? haberg_20080406@math.su.se (Hans Aberg) (2010-01-28)
An example LL(K) language that is not LL(K-1) ? chakaram@auth.gr (Chariton Karamitas) (2010-02-01)
Re: An example LL(K) language that is not LL(K-1) ? klyjikoo@gmail.com (klyjikoo) (2010-02-02)
Re: An example LL(K) language that is not LL(K-1) ? cfc@shell01.TheWorld.com (Chris F Clark) (2010-02-03)
Re: An example LL(K) language that is not LL(K-1) ? kkylheku@gmail.com (Kaz Kylheku) (2010-02-03)
Re: An example LL(K) language that is not LL(K-1) ? daniel.eliason@excite.com (fortunatus) (2010-02-04)
Re: An example LL(K) language that is not LL(K-1) ? slkpg@cox.net (SLK Mail) (2010-02-05)
[8 later articles]
| List of all articles for this month |
From: Hans Aberg <haberg_20080406@math.su.se>
Newsgroups: comp.compilers
Date: Thu, 28 Jan 2010 11:03:54 +0100
Organization: A noiseless patient Spider
References: 10-01-091
Keywords: LL(1)
Posted-Date: 31 Jan 2010 01:07:07 EST

klyjikoo wrote:
> I think any LL(K) grammar without semantic actions can be transformed into an
> LL(1) grammar...
> But i found in resourses that LL(K) is stronger than LL(K-1) ....
> I search a lot for an example that can show this...but not found any
> and i am currently confusing about this issue.


The book by Waite and Goos, "Compiler Construction", sec 5.3, p. 124,
gives an example of an LL(3) grammar that isn't LL(2). They say LL(k)
grammars were introduced by P. M. Lewis and R. E. Stearns, "Property
Grammars and Table Machines", Information and Control 14(6), 524-549
(1969). So if they do not give example, perhaps someone citing them.


      Hans


Post a followup to this message

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