Re: DotStar regex package

Tony Finch <>
11 May 2010 17:48:13 +0100 (BST)

          From comp.compilers

Related articles
DotStar regex package (John R. Levine) (2010-05-11)
Re: DotStar regex package (Tony Finch) (2010-05-11)
Re: DotStar regex package (Chris F Clark) (2010-05-11)
Re: DotStar regex package (Chris F Clark) (2010-05-11)
Re: DotStar regex package (russell kym horsell) (2010-05-12)
Re: DotStar regex package (Chris F Clark) (2010-05-12)
| List of all articles for this month |

From: Tony Finch <>
Newsgroups: comp.compilers
Date: 11 May 2010 17:48:13 +0100 (BST)
Organization: dotat labs
References: 10-05-054
Keywords: lex
Posted-Date: 12 May 2010 00:56:34 EDT

"John R. Levine" <> wrote:
>The March issue of IEEE Computer has an article called "Tools for Very
>Fast Regular Expression Matching" which describes a regex package
>called DotStar, written by three guys at IBM. It turns regular
>expressions into NFAs and then DFAs, but does so in a way that they
>say runs much faster than other packages on modern CPUs. They also
>say they deal with the state explosions that NFA->DFA translations can
>I don't know enough about the nitty-gritty of current DFA pattern matchers
>to know if this really is a signficant improvement. Anyone else have

I haven't read the article yet, but from your description it sounds
like their work is similar to Russ Cox's:

His re2 library is available as open source via that link.

f.anthony.n.finch <>

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.