Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| 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) |
| From: | Thomas Skora <usenet0@skora.net> |
| Newsgroups: | comp.compilers |
| Date: | 10 Aug 2003 10:50:27 -0400 |
| Organization: | Compilers Central |
| References: | 03-08-015 |
| Keywords: | lex, DFA |
| Posted-Date: | 10 Aug 2003 10:50:27 EDT |
"Anthony Webster" <tony@transCendenZ.co.uk> writes:
> I'm still a little confused as to which data structure to use for
> what part of the system.
In most cases you can describe the automatas with tabulars, from which
you can look up the next state and/or output with the actual state and
input/lookahead symbol.
> 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.
The lexer works with DFAs and outputs tokens, while the parser gets
the tokens and builds a parse tree or does something else
grammar-specific with PDAs.
Thomas
Return to the
comp.compilers page.
Search the
comp.compilers archives again.