From: Danny.Dube@ift.ulaval.ca   
      
   Hi,   
      
   You might find this one interesting:   
      
       DubC) D., Feeley M. (2000), "Efficiently building a parse tree from   
       a regular expression", Acta Informatica, volume 37, number 2,   
       pages 121-144.   
      
   Instead of simply capturing selected sub-expressions, it builds a   
   complete parse tree for a word w that matches a regular expression r.   
   The technique can produce either a single parse tree or a grammar that   
   indirectly represents all the parse trees in time |w|*|r|, no matter   
   how ambiguous r is.   
      
   Danny   
      
   --   
   Danny DubC), professeur   
   DC)partement d'informatique et de gC)nie logiciel   
   UniversitC) Laval   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)