Re: "Stack overflow in regexp"
Justin Vallon <vallon(a)mindspring.com> writes:
I think the (regexp internal fail_stack) stack size can be increased
on
all platforms from 2000 to 20000 at the cost of 16000*4 ~= 64k.
I just had a glance at it too, but isn't the maximum (on a 32 bit machine).
2 * re_max_failures * MAX_FAILURE_ITEMS * 4
Where MAX_FAILURE_ITEMS = 5 * 3 + 5 = 19
thus the cost is about 38 times higher. And on a 64-bit machine it is
about 80 times higher. Which more or less explains why DEC OSF's 2MB
stack gives problems.
Does anybody know why regexp lets its stack grow exponentially?
Jan