From: cartercheng@gmail.com   
      
   Hello,   
      
   This is probably pretty elementary but I havent been able to locate a   
   method to compute first-k follow-k sets (i.e. the k terminals derived   
   from a symbol or following that symbol) efficiently for a grammar.   
   Most textbooks only seem to cover the k = 1 case. Are there references   
   out there which contain how to compute the generalization to k > 1?   
      
   Thanks in advance,   
      
   Carter.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)