Markus Mottl writes:

 > If somebody wants to give it a try, the SML-entry in the language shootout
 > implements a regexp-library with NFAs and DFAs. I haven't given it a
 > closer look yet, but performance looks excellent:
 > 
 >   http://www.bagley.org/~doug/shootout/bench/regexmatch/regexmatch.mlton

I  tried  Claude Marché's  Regexp  library  instead  of Pcre  on  that
particular example and there is a speedup of 5 % approximatively.

Note  that  the  Regexp  library  compiles  regular  expressions  into
deterministic finite  automata using  a very different  algorithm than
the SML entry, from this article:

    G. Berry and R. Sethi
    From Regular Expressions to Deterministic Automata
    Theoretical Computer Science 48 (1986) 117-126

This  is a very  nice and  concise algorithm  and I  encourage anybody
interested in regexp and automata to have a look at it (again, the url
for the code is http://www.lri.fr/~marche/tmp/regexp-0.1.tar.gz)

-- 
Jean-Christophe Filliatre
  mailto:Jean-Christophe.Filliatre@lri.fr
  http://www.lri.fr/~filliatr
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr