From: borucki.andrzej@gmail.com   
      
   I can create DFA direct from regexp.   
   But for language lexer I must have DFA for couple regexp.   
   One solution is crating DFA with multi finished states.   
   For example   
   r0 = ab   
   r1 = ac   
      
     | 0 | 1   
   a | 1 |   
   b |   | 2(F)   
   c |   | 3(F)   
      
   How to check if r0 and r1 are disjoint?   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)