|
|
|
| Syntactic Confectionery Delight | |
| PerlMonks |
RE: RE (tilly) 2: Regular Expression Optimizerby BlaisePascal (Monk) |
| on Aug 31, 2000 at 02:33 UTC ( [id://30430]=note: print w/replies, xml ) | Need Help?? |
|
You may be right... I know that it's been shown that NP-Complete problems can be reduced (in P time) to a Perl regex match. But I don't think the proofs I've seen looked at .* vs. .*?. The constructions used backreferences.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||