|Regular expressions speedup firstname.lastname@example.org (Cleo Saulnier) (2005-08-05)|
|Re: Regular expressions speedup email@example.com (2005-08-07)|
|Re: Regular expressions speedup firstname.lastname@example.org (Cleo Saulnier) (2005-08-07)|
|Re: Regular expressions speedup email@example.com (2005-08-10)|
|Re: Regular expressions speedup firstname.lastname@example.org (Paolo Bonzini) (2005-08-10)|
|Re: Regular expressions speedup email@example.com (Tony Finch) (2005-08-10)|
|Re: Regular expressions speedup firstname.lastname@example.org (2005-08-10)|
|Re: Regular expressions speedup email@example.com (2005-08-10)|
|[2 later articles]|
|From:||firstname.lastname@example.org (Hans Aberg)|
|Date:||7 Aug 2005 16:12:53 -0400|
|Posted-Date:||07 Aug 2005 16:12:53 EDT|
Cleo Saulnier <email@example.com> wrote:
> I wrote my own Regular expressions parser CSRegEx for C++ (all OS) which
> is now on sourceforge as public domain. ... Are there any tips on how
> to speed up the matching process.
The book by Aho, Sethi & Ullman, "Compilers...", end of sec. 3.7, says
that best for both space and time is a "lazy transition evaluation"
[I wonder if they feel differently about space tradeoffs now than they
did 30 years ago. At that point, programs had to fit into 16 bit address
Return to the
Search the comp.compilers archives again.