b) trying real hard to remove exponential behaviour from regexps when you can.Yes, well, there's the problem of recognizing this before it bites me in the ass in production. I mean, I guess this particular exponential behavior might be something I'll recognize in the future, but is there some automated tool that can recognize when regular expressions have the potential for exponential behavior? (Or is this one of those problems that get as hard as the decideability problem?)
-- @/=map{[/./g]}qw/.h_nJ Xapou cets krht ele_ r_ra/; map{y/X_/\n /;print}map{pop@$_}@/for@/
In reply to Re^2: This regex seems to have splattered non-greedy everywhere
by fizbin
in thread This regex seems to have splattered non-greedy everywhere
by fizbin
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |