home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.compilers      Compiler construction, theory, etc. (Mod      2,753 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 1,145 of 2,753   
   George Neuner to Paul B Mann   
   Re: DFA Lexer Generation From BNF   
   12 Nov 07 00:01:00   
   
   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)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca