A finite state machine for text filters using regular expressions.

The input is provided in the form of a list of one-line strings (no newlines). States are subclasses of the State class. Transitions consist of regular expression patterns and transition methods, and are defined in each state.

The state machine is started with the run() method, which returns the results of processing in a list.

Base classes

There are no base classes.

Implemented Interfaces

There are no implemented interfaces.


There are no attributes in this class.


Known Subclasses