in reply to Re^2: Complex regular subexpression recursion limit
in thread Complex regular subexpression recursion limit
First of all, there is no limit on recursion depth. There's a suppressible warning when you attain a certain depth, that's all.
Secondly, there is no efficiently gained by limiting the number of iterations. We're talking about using a 32-bit variable instead of a 16-bit variable on a 32-bit system.
And it's not just a theoretical bug. There exists desire for the ability to match longer strings.
|
|---|