Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] String.unescaped and some other little pitiful laments
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2001-07-11 (06:44)
From: Jean-Christophe Filliatre <Jean-Christophe.Filliatre@l...>
Subject: Re: [Caml-list] String.unescaped and some other little pitiful laments

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:

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

Jean-Christophe Filliatre
Bug reports:  FAQ:
To unsubscribe, mail  Archives: