in reply to Re^2: regex step counting (Halting problem)
in thread regex step counting

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
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery FootballPerl is like chess, only without the dice

°) "a few hundred sample lines"

  • Comment on Re^3: regex step counting (Halting problem)