This is a class library for fast and flexible text filtering with
regular expressions. In contrast to java.util.regex, monq.jfa allows
to bind a regular expression to an action that is automatically called
whenever a match is spotted in an input stream.

In addition it is possible to combine several tenthousand
regex/action pairs into one machinery (called "deterministic finite
automaton" or DFA) for fast parallel text filtering.  The DFA filters
input to output by calling the actions to reformat matching text.
Of course the actions can also built up an internal data structure
instead of creating output, whereby effectively parsing the input.

The filtering speed is fast (1.5MB/s on a P4 2.66 GHz)
and mostly unrelated to the number of
regex/action pairs employed in parallel.

http://www.ebi.ac.uk/Rebholz-srv/whatizit/software

 Harald.