DotStar regex package

"John R. Levine" <johnl@iecc.com>
11 May 2010 03:14:40 -0400

          From comp.compilers
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)
| List of all articles for this month |
From: "John R. Levine" <johnl@iecc.com>
Newsgroups: comp.compilers
Date: 11 May 2010 03:14:40 -0400
Organization: Compilers Central
Keywords: lex, question
Posted-Date: 11 May 2010 03:17:28 EDT

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
cause.


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
opinions?


If you don't have access to the March Computer, drop me a private note and
I can send you a PDF clipping of the article.


R's,
John


Post a followup to this message

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