|Re: Inquiry about nfa output by flex firstname.lastname@example.org (Vern Paxson) (2005-08-05)|
|Re: Inquiry about nfa output by flex email@example.com (bharath) (2005-08-10)|
|Re: Inquiry about nfa output by flex firstname.lastname@example.org (Vern Paxson) (2005-08-31)|
|Date:||10 Aug 2005 11:51:57 -0400|
|Posted-Date:||10 Aug 2005 11:51:57 EDT|
Vern Paxson wrote:
> [ In response to a question about flex DFA table formats -John ]
Some doubts which are related to the points raised but not following
1. How are the trans1 and trans2 arrays different?
2. Is the meta-equivalence generation an 8-to-1 affair i.e., one
meta-equivalence class for every 8 equivalence classes?
3. Why doesn't flex generate the minimal DFA? Is it because
backtracking becomes more difficult? Also is the DFA generated a
Return to the
Search the comp.compilers archives again.