|DFA, NFA space/time tradeoffs email@example.com (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 firstname.lastname@example.org (Henry Spencer) (1997-10-10)|
|Date:||8 Oct 1997 00:40:53 -0400|
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]
Return to the
Search the comp.compilers archives again.