From: gneuner2/@/comcast.net   
      
   On Sat, 10 Nov 2007 23:23:48 -0600, "Paul B Mann"  wrote:   
      
   >Does anyone know of a lexer generator whose input is a BNF grammar   
   >instead of regular expressions ?   
      
   Antlr uses a combination of EBNF and regex to define its lexers.  It   
   does _not_ produce a DFA, though, Antlr's lexers are recursive decent.   
      
   George   
   --   
   for email reply remove "/" from address   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)