From: haberg_20080406@math.su.se   
      
   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   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)