From: jamin.hanson@googlemail.com   
      
   I missed your question about non-greedy repeats.   
      
   Yes, it is possible. See build_dfa() in generator.hpp from lexertl.   
      
   Basically non-greedy transitions are snipped when building the dfa. I build a   
   regex syntax tree as suggested in the Dragon Book and I keep track of greedy   
   flags in the tree and that is passed down to partition/equivset.hpp and from   
   there to the generator. The thing you have to careful about is respecting that   
   the left side takes priority (i.e. the regex or sub-regex that came first).   
      
   Regards,   
      
   Ben   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)