DFA, NFA space/time tradeoffs

"SoftMan" <softman@colba.net>
8 Oct 1997 00:40:53 -0400

          From comp.compilers

Related articles
DFA, NFA space/time tradeoffs softman@colba.net (SoftMan) (1997-10-08)
Re: DFA, NFA space/time tradeoffs Peter_Eyes_Eiserloh@WSSAGW.chinalake.navy.mil (Peter P. Eiserloh) (1997-10-10)
Re: DFA, NFA space/time tradeoffs henry@zoo.toronto.edu (Henry Spencer) (1997-10-10)
| List of all articles for this month |

From: "SoftMan" <softman@colba.net>
Newsgroups: comp.compilers
Date: 8 Oct 1997 00:40:53 -0400
Organization: Compilers Central
Keywords: lex, question


I'm a little bit new to CC. I'd like to know what kind of finite state
automata is used by modern compilers. And about space/time tradeoffs. IMHO
dfa is fatser, but still I'm concerned about that DFA is fixed once
created. On the controrary NFA can be constructed before parsing.

Any comments and advises are appreciated.

With best regards,

[Depends what you want to do. For languages that don't permit runtime
syntax extensions, you might as well use a DFA and run faster. That's
what lex and yacc generate. -John]


Post a followup to this message

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