"Anthony Webster" <tony@transCendenZ.co.uk>
4 Aug 2003 00:11:27 -0400

          From comp.compilers

Related articles
DFAs,NFAs,REs,CFGs,PDAs ARGH! tony@transCendenZ.co.uk (Anthony Webster) (2003-08-04)
Re: DFAs,NFAs,REs,CFGs,PDAs ARGH! p2sam@uwaterloo.ca (2003-08-10)
Re: DFAs,NFAs,REs,CFGs,PDAs ARGH! usenet0@skora.net (Thomas Skora) (2003-08-10)
Re: DFAs,NFAs,REs,CFGs,PDAs ARGH! derkgwen@HotPOP.com (Derk Gwen) (2003-08-10)
Re: DFAs,NFAs,REs,CFGs,PDAs ARGH! joachim.durchholz@web.de (Joachim Durchholz) (2003-08-23)
| List of all articles for this month |

From: "Anthony Webster" <tony@transCendenZ.co.uk>
Newsgroups: comp.compilers
Date: 4 Aug 2003 00:11:27 -0400
Organization: University of East Anglia, Norwich, Norfolk, NR47TJ, UK
Keywords: lex, parse, question
Posted-Date: 04 Aug 2003 00:11:27 EDT


I'm writing the lexer and parser parts of a compiler. I've got a basic
lexer working but it relies on a massive while statement and I was
thinking of using something more intesting like a DFA built from a
RE. I'm still a little confused as to which data structure to use for
what part of the system. I understand the mechanics of things like
CFGs and PDAs but fail to see exactly where they fit in the
implementation of a lexer/parser. Some clarification would be most



Post a followup to this message

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