NFA to DFA question

"Unmesh joshi" <unmesh_joshi@hotmail.com>
12 Jan 2003 17:42:25 -0500

          From comp.compilers
Related articles
NFA to DFA question unmesh_joshi@hotmail.com (Unmesh joshi) (2003-01-12)
Re: NFA to DFA question clint@0lsen.net (Clint Olsen) (2003-01-17)
Re: NFA to DFA question thp@cs.ucr.edu (2003-01-17)
Re: NFA to DFA question mchristoff@sympatico.ca (Michael N. Christoff) (2003-01-17)
Re: NFA to DFA question lord@emf.emf.net (2003-01-21)
Re: NFA to DFA question joachim_d@gmx.de (Joachim Durchholz) (2003-01-25)
Re: NFA to DFA question rafe@cs.mu.oz.au (Ralph Becket) (2003-01-30)
| List of all articles for this month |
From: "Unmesh joshi" <unmesh_joshi@hotmail.com>
Newsgroups: comp.compilers
Date: 12 Jan 2003 17:42:25 -0500
Organization: Compilers Central
Keywords: lex
Posted-Date: 12 Jan 2003 17:42:25 EST

I am reading the compilers book by Aho ullman, and I have one doubt about
NFA to DFA conversion.
"Every state of DFA corresponds to 'set of states' in NFA". Can anybody
explain to me this? Does anybody has a source code sample for NFA-DFA? May
be if I implement the DFA algorithm I will understand what that means.


Thanks a lot,
Unmesh

Post a followup to this message

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