|NFA -> DFA on-the-fly determinization firstname.lastname@example.org (Russ Cox) (2006-01-31)|
|Re: NFA -> DFA on-the-fly determinization email@example.com (Karsten Nyblad) (2006-02-02)|
|Re: NFA -> DFA on-the-fly determinization firstname.lastname@example.org (Russ Cox) (2006-02-03)|
|From:||Russ Cox <email@example.com>|
|Date:||3 Feb 2006 18:42:22 -0500|
|Keywords:||lex, DFA, history, question|
|Posted-Date:||03 Feb 2006 18:42:22 EST|
> > I am trying to find a reference for the technique of converting an NFA
> > to a DFA as needed during NFA execution and caching the result to
> > avoid repeating the conversion at each step. ...
> The normal implementation of an DFA is to have a map in each state, ...
I apologize for not being clearer. I have an implementation (and it does
exactly what you describe, with "not yet calculated" states). My question
is not "how can I do this?" but "who was the first and is there a reference
to a canonical paper?".
Return to the
Search the comp.compilers archives again.