monq.jfa is a class library for fast and flexible text filtering with regular expressions. In contrast to java.util.regex, monq.jfa allows a regular expression to be bound to an action that is automatically called whenever a match is spotted in an input stream. In addition, it can combine several ten thousand regex/action pairs into one machinery (called a "deterministic finite automaton" or DFA) for fast parallel text filtering. A general purpose TCP server and associated classes in monq.net allow the bigger DFAs to be run as servers.
