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

Góra strony
Wiadomość jest częścią wątku:
M\pełne drzewo wątku posortowane wg daty
MMPhilip Hazel at <-
MAlan Lehotsky at ->
Delete this message
Autor: jcd
Data:  
Dla: pcre-dev
Temat: 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?


Wiadomość została wysłana do następujących list mailowych:
Pcre-dev
Informacja o liście mailowej | Najbliższe wiadomości		<-Re: [pcre-dev] Recursion with possessive quantifiersRe: [pcre-dev] optimizing matches for large strings->
Tahini and Hummus and Cumin Development Archives administrowana przez cumin AdminsLurker (wersja 2.3)