This is an exponential case for the code generator. It is similar to the one
which is sent by Ralf recently.
In PCRE, if P is not a character literal or a backreference, (P){n,m} is
expanded to
(P)(P)(P)...(P)(?:(P)(?:(P))?)?
The code generator optimize these patterns one-by-one, and
On 2013-03-25 08:57, Zoltán Herczeg wrote:
This is an exponential case for the code generator.The code generator
optimize these patterns one-by-one, and this process requires a lot of
time and an enormous stack space. Where do you use such pattern? Can't
you use a better pattern?
It's
