Attached mini-project for regexp stuff.
There may be a bug in the reported number of states.
A state minimisation routine would be useful.
This formulation provides better factoring and a simpified
interface for clients, in particular the routine
'recognize' can be used to match a labelled set of
regexps and return the set of labels (try doing THAT in Perl :)
Next version I'll try to get groups working (see reggrp.ml)
and perhaps provide a lexer and searcher routine.
NOTE: I usually provide *.mli files for everything
except mainlines. However, I can't figure out how
to type everything properly -- if you run ocamlc -i src/regsug.ml
you'll see what I mean.
John Skaller, mailto:skaller@...
snail: PO BOX 401 Glebe NSW 2037 Australia
Checkout the Felix programming language http://felix.sf.net