Related articles |
---|
DotStar regex package johnl@iecc.com (John R. Levine) (2010-05-11) |
Re: DotStar regex package dot@dotat.at (Tony Finch) (2010-05-11) |
Re: DotStar regex package cfc@shell01.TheWorld.com (Chris F Clark) (2010-05-11) |
Re: DotStar regex package cfc@shell01.TheWorld.com (Chris F Clark) (2010-05-11) |
Re: DotStar regex package kym@sdf.lonestar.org (russell kym horsell) (2010-05-12) |
Re: DotStar regex package cfc@shell01.TheWorld.com (Chris F Clark) (2010-05-12) |
From: | Chris F Clark <cfc@shell01.TheWorld.com> |
Newsgroups: | comp.compilers |
Date: | Tue, 11 May 2010 17:43:51 -0400 |
Organization: | The World Public Access UNIX, Brookline, MA |
References: | 10-05-054 |
Keywords: | lex |
Posted-Date: | 12 May 2010 00:59:08 EDT |
One last comment on the DotStar package. The speed up they are
talking about applies to looking at unanchored regular expressions in
large buffers. (This is something one does a lot in network
security.) You can do related speed ups on some anchored regular
expressions (i.e. what one uses in lexing), but the significance of
doing so is significantly less. For simple anchored regular
expressions, what one generally uses in lexing, the standard
regex->NFA->DFA construction is generally optimal.
Hope this helps,
-Chris
******************************************************************************
Chris Clark email: christopher.f.clark@compiler-resources.com
Compiler Resources, Inc. Web Site: http://world.std.com/~compres
23 Bailey Rd voice: (508) 435-5016
Berlin, MA 01503 USA twitter: @intel_chris
------------------------------------------------------------------------------
Return to the
comp.compilers page.
Search the
comp.compilers archives again.