Perl maintains a cache of visited states in order to short circuit redundant paths through the NFA, permitting it to evaluate some searches in linear time that take polynomial or exponential time in other Spencer engines.from "Can Regular Expressions Be Safely Reused Across Languages?": i-programmer.info/programming/perl/13051-can-regular-expressions-be-safely-reused-across-language-boundaries.html
In reply to Re^2: super search by regex (updated)
by Anonymous Monk
in thread super search by regex
by Danny
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |