Re: [pcre-dev] optimizing matches for large strings

>If, as your comment suggests, you really know exactly what's in your
>string, what are you using PCRE to try to find? Perhaps there's another
>way of solving the problem.

Wouldn't DFA be using less stack in this case?

Or make by unrolling, wouldn't
(P1(P[249]P[249]P[249]P[249]P[249]P[249]P[249]P[249]P[249]P[249])+(P[249]){0,9})
use roughly 10 time less recursion?