| Related articles |
|---|
| NFA to DFA onesecond@oceanfree.net (Shane O'Neill) (2000-04-11) |
| Re: NFA to DFA johnston.p@worldnet.att.net (Paul Johnston) (2000-04-14) |
| Re: NFA to DFA bburshte@pyrps5.eng.pyramid.com (1991-10-09) |
| From: | "Paul Johnston" <johnston.p@worldnet.att.net> |
| Newsgroups: | comp.compilers |
| Date: | 14 Apr 2000 23:45:10 -0400 |
| Organization: | AT&T Worldnet |
| References: | 00-04-076 |
| Keywords: | lex, DFA |
The Dragon book has a detailed NFA->DFA example, you might test your
implemention on it...
Paul
Shane O'Neill wrote in message 00-04-076...
>I've started to reading about compiler construction pretty recently,
>and have been trying to get my head around lexical analysis.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.