Home | Trees | Indices | Help |
---|
|
Classes used by class-based implementations of various kinds of finite state recognizer.
This module introduces the classes fsa and fsa_recognizer. Instances of fsa compute their alphabet and check their transition tables for consistency at initialization time.
Trace-printing and print methods are provided for both classes, with
print methods supplied via __repr__
.
|
|||
fsa | |||
fsa_recognizer Class for finite-state recognizers. |
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Wed Feb 4 22:00:33 2009 | http://epydoc.sourceforge.net |