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

Top Page
This message is part of the following thread:
M\the complete thread tree sorted by date
MMPhilip Hazel at <-
MAlan Lehotsky at ->
Delete this message
Author: jcd
Date:  
To: pcre-dev
Subject: 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?


This message was posted to the following mailing lists:
Pcre-dev
Mailing List Info | Nearby Messages		<-Re: [pcre-dev] Recursion with possessive quantifiersRe: [pcre-dev] optimizing matches for large strings->
Tahini and Hummus and Cumin Development Archives administrated by cumin AdminsLurker (version 2.3)