From: Silas8642@hotmail.co.uk   
      
   An even later response, but thought quote from course notes (§5.6.5   
   available here ) I'm currently   
   pursuing might be useful.   
      
   *LL(1) grammars*   
   Grammars which admit non-back-tracking top down LL(1) parsers are   
    precisely the ones which are left factored, follow determined and have   
    no left recursion.   
      
   Thus we have the following definition: A context-free grammar is LL(1) if   
   for all non-terminals A and productions A ::= α|β we have   
   1. first(α) ∩ first(β) = ∅   
   2. If A ∗⇒ ε then first(A) ∩ follow(A) =∅.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)