Your skill will accomplish what the force of many cannot |
|
PerlMonks |
Re^2: Comparative satisfiability of regexps.by exussum0 (Vicar) |
on Jan 20, 2005 at 21:39 UTC ( [id://423798]=note: print w/replies, xml ) | Need Help?? |
Just to append to your CS theory regexp, you can't use memory beyond storage for the original string and the regular expression itself. Backrefs require memory to store values and do manips on them.
----
In Section
Seekers of Perl Wisdom
|
|