On Sun, Jun 12, 2011 at 03:51:23PM +0100, Philip Hazel wrote:
>
> 5. If you are running into a problem of stack overflow, you have the
> following choices:
>
> (a) Work on your regular expression pattern so that it uses less
> memory. Sometimes using atomic groups can help with this.
> (b) Increase the size of your process stack.
> (c) Compile PCRE to use the heap instead of the stack.
> (d) Set PCRE's recursion limit small enough so that it gives an error
> before the stack overflows.
>
May I have a question? If I compile pcre to use stack and then to use heap,
will be the two libraries binary compatible?
-- Petr
