Contains two implementations of finite state machines. One is DFSA, which is older and used in some of the old parse code. The second is TransducerGraph, which represents a transducer (a generalization of a FSM) and is used in the newer grammar compaction code currently used in the parser.

For questions contact Dan Klein (klein@cs.berkeley.edu) or Teg Grenager (grenager@stanford.edu).