DFA Lexer Generation From BNF

"Paul B Mann" <pbm@oct.net>
Sat, 10 Nov 2007 23:23:48 -0600

          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: "Paul B Mann" <pbm@oct.net>
Newsgroups: comp.compilers
Date: Sat, 10 Nov 2007 23:23:48 -0600
Organization: Compilers Central
References: 07-11-033
Keywords: parse, lex, question
Posted-Date: 11 Nov 2007 12:44:06 EST

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]


Post a followup to this message

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