From: haberg-news@telia.com   
      
   On 2011/11/20 17:48, Borneq wrote:   
   > A->B   
   > B->B   
   > This grammar is not correct, B is looped.   
   >   
   > A->B   
   > B->C   
   > C->A   
   > This another grammar, cycle can be arbitrarily long.   
   > Is cycle when First(Nonterminal) not contain any terminal, even not   
   > epsilon?   
      
   If it is only cycles in the graph you are out for, perhaps some   
   algorithm mentioned here might help:   
      https://en.wikipedia.org/wiki/Strongly_connected_component   
      https://en.wikipedia.org/wiki/Cycle_detection   
      
   Hans   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)