in reply to Re^4: Perl regexp matching is slow??
in thread Perl regexp matching is slow??
but your analysis will help me understand the science of matching a little better
No, my analysis wont help with that, for the science of matching read the original paper. My analysis is that of the merits of using a backtracking NFA as the basis for a general purpose matching engine for use in something like perl.
My beef with the paper is purely with the criticism of Perl (and other platforms) for using a backtracking engine. I dont think its a bad decision, I think its just a decision that is motivated by considerations beyond just match time performance, and I felt that the article, given its title, should have in the name of balance or fairness or whatever at the very least discussed them. However these arent scientific issues, they are engineering issues. For scienctific stuff read the academic literature. For engineering stuff read the source of as many implementations as you can get your hands on. :-)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^6: Perl regexp matching is slow??
by samizdat (Vicar) on Feb 02, 2007 at 11:56 UTC |