On Thu, 2005-08-04 at 23:15 -0700, james woodyatt wrote: > On 04 Aug 2005, at 18:03, skaller wrote: > I know. This is probably not what you're looking for. Not directly: I have to generate C++ code from Ocaml. At present, this is easy -- the Ocaml is a transliteration of the Dragon book algorithm, and the C++ is two lines of matrix lookup. I would like to adapt the algorithm, which is regexp -> DFA without constructing an NFA, to add enough information so the C++ automata can capture groups. Whilst a lazy automaton is nice in Ocaml, it's a bit more challenging when the compile and run time have to be split between Ocaml and C++ ;( -- John Skaller