If you look at the big graph near the end of the article, you'll see that the nfa.c in the article has cheaper construction cost than all of the fancier implementations, by about a factor of 4. And I wasn't really trying.
Er, am i looking at the right thing? I dont see a graph covering construction time. I see a graph covering total run time but not one covering construction alone.
Id be willing to look into hacking your code into the regex engine as an experiment. You'd have to release the code under the PAL though.
In reply to Re^4: Perl regexp matching is slow??
by demerphq
in thread Perl regexp matching is slow??
by smahesh
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |