(flex.info.gz) Does there exist a "faster" NDFA->DFA algorithm?
Info Catalog
(flex.info.gz) Can I get the flex manual in another format?
(flex.info.gz) FAQ
(flex.info.gz) How does flex compile the DFA so quickly?
Does there exist a "faster" NDFA->DFA algorithm?
================================================
There's no way around the potential exponential running time - it can
take you exponential time just to enumerate all of the DFA states. In
practice, though, the running time is closer to linear, or sometimes
quadratic.
Info Catalog
(flex.info.gz) Can I get the flex manual in another format?
(flex.info.gz) FAQ
(flex.info.gz) How does flex compile the DFA so quickly?
automatically generated byinfo2html