|
|
|
| "be consistent" | |
| PerlMonks |
Re^3: regex step counting (Halting problem)by LanX (Saint) |
| on Dec 03, 2019 at 14:51 UTC ( [id://11109598]=note: print w/replies, xml ) | Need Help?? |
|
I never said that he has to solve the halting problem. His approach is to test against a set of input strings.° I wouldn't be surprised if a finit input set can't cover all cases for arbitrary regexes. This also highly depends on the allowed RegEx grammar, like embedded Perl code (at the extreme).
Cheers Rolf
°) "a few hundred sample lines"
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||