|Regular expression search algorithm firstname.lastname@example.org (Harry) (2002-07-15)|
|Re: Regular expression search algorithm email@example.com (Joachim Durchholz) (2002-07-21)|
|Re: Regular expression search algorithm firstname.lastname@example.org (Ralph Corderoy) (2002-07-21)|
|Re: Regular expression search algorithm email@example.com (Peter S Tillier) (2002-07-24)|
|Re: Regular expression search algorithm firstname.lastname@example.org (Aharon Robbins) (2002-09-03)|
|regular expression search algorithm email@example.com (1993-03-18)|
|Re: regular expression search algorithm firstname.lastname@example.org (1993-03-19)|
|From:||"Peter S Tillier" <email@example.com>|
|Date:||24 Jul 2002 02:24:20 -0400|
|Posted-Date:||24 Jul 2002 02:24:20 EDT|
"Joachim Durchholz" <firstname.lastname@example.org> wrote in message
> Harry wrote:
> > 1. I have read the boyer moore algo in the intro to algo by
> > corman, rivest, leiserson.... however they taked about only
> > the simple patterns ...
> > How to acomodate the regular expression in the pattern ?
> Regex searches work very differently than Boyer-Moore. The effect that
> makes the Boyer-Moore algorithm fast is implicitly part of the regex
> algorithms though.
> Regex searching is usually done by compiling the regex into a
> deterministic finite automaton, then feeding the input to the regex.
This is not correct. Many regex search algorithms are implemented
using NFAs rather than DFAs. For example perl, sed, grep and others
use NFAs so that back references are readily available. awk, egrep
and others usually use DFAs, which tend to be slower to compile and
faster to execute than NFAs, but don't support back references. gawk
uses both - DFA most of the time, but NFA when back references are
Peter S Tillier
"Who needs perl when you can write dc and sokoban in sed?"
Return to the
Search the comp.compilers archives again.