Re: DFA Lexer Generation From BNF

George Neuner <gneuner2/@/comcast.net>
Mon, 12 Nov 2007 00:01:00 -0500

          From comp.compilers
Related articles
Code generation from AST lssilva@gmail.com (Lucas S. Silva) (2007-11-10)
DFA Lexer Generation From BNF pbm@oct.net (Paul B Mann) (2007-11-10)
Re: DFA Lexer Generation From BNF cfc@shell01.TheWorld.com (Chris F Clark) (2007-11-11)
Re: DFA Lexer Generation From BNF gneuner2/@/comcast.net (George Neuner) (2007-11-12)
Re: DFA Lexer Generation From BNF pbm@oct.net (Paul B Mann) (2007-11-16)
Re: DFA Lexer Generation From BNF bobduff@shell01.TheWorld.com (Robert A Duff) (2007-11-16)
Re: DFA Lexer Generation From BNF idbaxter@semdesigns.com (2007-11-17)
| List of all articles for this month |
From: George Neuner <gneuner2/@/comcast.net>
Newsgroups: comp.compilers
Date: Mon, 12 Nov 2007 00:01:00 -0500
Organization: Compilers Central
References: 07-11-033 07-11-038
Keywords: lex
Posted-Date: 15 Nov 2007 18:50:00 EST

On Sat, 10 Nov 2007 23:23:48 -0600, "Paul B Mann" <pbm@oct.net> 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


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.