http://www.perlmonks.org?node_id=423798


in reply to Re: Comparative satisfiability of regexps.
in thread Comparative satisfiability of regexps.

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.

----
Give me strength for today.. I will not talk it away..
Just for a moment.. It will burn through the clouds.. and shine down on me.

  • Comment on Re^2: Comparative satisfiability of regexps.