From: jaluber@gmail.com   
      
   On Aug 20, 7:33 pm, Gilbert Mirenque  wrote:   
   > Hello NG,   
   >   
   > I'm not so familiar with compiler construction just interested in it.   
   > What appears curious is that I have heard that it is only possible to   
   > implement recursive descent parsers for LL(1)-grammars. But I imagine   
   > that it isn't a problem to look ahead more than just one symbol. So my   
   > question is why it is only possible for LL(1)-grammars?   
      
   LL(1) is far too limiting the possibilities. Maybe the people confused   
   it with a fixed look-ahead, which LL(k) is traditionally known for.   
   But with ANTLR (http://www.antlr.org) now LL(*) is supported, which   
   allows infinite look-ahead. Basically LR and LL are pretty much equal   
   in recognition power (although people are going to correct me on   
   that ;).   
      
   Johannes   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)