Package-level declarations
Types
Link copied to clipboard
An iterator that traverses the right language of a given node (all sequences reachable from a given node).
Link copied to clipboard
CFSA (Compact Finite State Automaton) binary format implementation.
Link copied to clipboard
CFSA (Compact Finite State Automaton) binary format implementation, version 2.
Link copied to clipboard
Top abstract class for handling finite state automata.
Link copied to clipboard
FSA binary format implementation for version 5.
Link copied to clipboard
This class implements some common matching and scanning operations on a generic FSA.
Link copied to clipboard
class MatchResult
A matching result returned from FSATraversal.
Link copied to clipboard
State visitor.