From: jamin.hanson@googlemail.com   
      
   > >As it turns out, submatch extraction is inherently more complex than   
   > >recognition: it can be solved on NFA, but not on (ordinary) DFA.   
   >   
   > I don't know what this means ... every NFA has an equivalent DFA, so   
   > if a problem can be solved with NFA, it can be solved with DFA.   
      
   This is true for regular expressions, but not for capturing regular   
   expressions (irregular expressions?) This is why NFA is traditionally used for   
   regex with captures.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)