From: gneuner2@comcast.net   
      
   On Fri, 18 Jul 2014 13:41:53 -0600, wclodius@earthlink.net (William   
   Clodius) wrote:   
      
   >I have memories that an LR(k) grammar can in principle be refactored   
   >to LR(1), but that in general an LL(k) grammar cannot be refactored to   
   >LL(1).   
      
   LL(k) always can be refactored to single token lookahead, but it   
   causes an explosion of grammar states.  E.g., given a single LL(3)   
   rule, an equivalent set of LL(1) rules must match every valid   
   combination of tokens at +1, +2 and +3.   
      
   George   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)