Package com.inxar.syntacs.automaton.finite

Defines classes which implement determinitic finite automata and their construction.

See:
          Description

Class Summary
MesoArrayDFA Concrete DFA implementation which uses truncated array parse tables.
MesoArrayDFABurner Utility class which transforms an instance of MesoArrayDFA to a corresponding source code representation.
Tree2MesoArrayDFATransformer Concrete DFATransformer implementation which converts a TreeDFA into a MesoArrayDFA.
TreeDFA Concrete DFA implementation which uses tree-based parse tables.
TreeDFA.Edge The TreeDFA.Edge class is models a single edge as a node in an binary interval tree.
TreeDFA.State The TreeDFA.State class is models a single state as tuple (output, edge_tree) where output is an integer which records the accepting NFA state and edge_tree holds the outgoing edges of the state tree.
TreeDFAConstructor Concrete implementation of DFAConstructor which builds a TreeDFA.
XML2TreeDFATransformer XML2TreeDFATransformer is a tool for parsing an XML elements representing dfa state machines and generating a TreeDFA.
 

Package com.inxar.syntacs.automaton.finite Description

Defines classes which implement determinitic finite automata and their construction.