From: pbm@oct.net   
      
   Does anyone know of a lexer generator whose input is a BNF grammar   
   instead of regular expressions ?   
      
   Paul Mann   
      
   [DFA's aren't adequate to recognize BNF, which is why parser   
   generators use a DFA and a stack or other more powerful machines.  I   
   suppose you could limit it to a BNF subset equivalent to regexps, but   
   what would be the point? -John]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)