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

Pàgina inicial
Aquest missatge és part del següent fil:
M\l'arbre de fils complet ordenat per data
MMPhilip Hazel en <-
MAlan Lehotsky en ->
Delete this message
Autor: jcd
Data:  
A: pcre-dev
Assumpte: 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?


Aquest missatge es va enviar a les següents llistes de correu:
Pcre-dev
Informació sobre la llista de correu | Missatges propers		<-Re: [pcre-dev] Recursion with possessive quantifiersRe: [pcre-dev] optimizing matches for large strings->
Tahini and Hummus and Cumin Development Archives administrat per cumin AdminsLurker (versió 2.3)