From: slkpg@cox.net   
      
   S -> a A a   
   S -> b A b a   
   A -> b   
   A ->   
      
   The example grammar I gave is the classic example from the literature   
   of a grammar that is LL(2), but not strong LL(2). Since it is not   
   strong LL(2), it clearly is not LL(1).   
      
   Your grammar is in fact strong LL(3):   
      
   S: aa | aba | bba | bbba;   
      
   If you think it is LL(1), provide the parse table.   
      
   If you think it is a language rather than a grammar, provide an LL(1)   
   grammar that recognizes it.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)