Re: Regexp efficienty

Vadim Gritsenko <[email protected]> Mon, 22 Sep 2003 23:54:16 -0400
Newsgroups gmane.comp.jakarta.regexp.user
Message-ID <[email protected]>
Ondra Nekola wrote:
> I have an following program, that leads to java.lang.StackOverflowError

...

> I'm not sure what to do. Is there an regexp implementation, that works OK 
> in all cases or should I learn some patterns, that cause troubles and not to 
> use them. Or should I create an implementetion, that works fine? :)

There is a bug report in BugZilla which basically says the same, i.g. 
that RegExp uses recursive algorithm, and thus, obviously has limits due 
to stack size limits.

Your options are:
  * Increase stack size
  * Use another regexp implementation (oro?)
  * Improve this regexp package

If you choose the last option, and you succeed, I can help in getting 
your code into the next regexp version.


PS You can also see what patterns behave worse and what behave better - 
and avoid bad ones :)

Vadim