From: borucki.andrzej@gmail.com   
      
   If LL(l) and LR(k) need sets FIRST_k, FOLLOW_k, k>1, for example LR(3) need   
   this sets of degree 3?   
   How make it? How is the best structure for these sets? I think about pyramid:   
   - one bit - is epsilon   
   - bit table size n   
   - bit table size n^2   
   ...   
   - bit table size n^k   
      
   because sets degree of k also have shorter strings.   
      
   This exponentially grows, in real grammars, number of tokens can be   
   quite big, ~80, It need then 0(80^k) bits. This sets will sparse and   
   is better organization of substrings in sets? For example, not bit set   
   but set of trees or DFA's ?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)