@NonNullByDefault

Package org.stekikun.dolmen.automaton

Class Summary

Class	Description
Automata	An instance of Automata gathers all the deterministic finite automata implementing the various rules in a lexer definition.
Automata.Entry	Represents automaton information for one lexer entry.
Determinize	An instance of this class can be used to determinize a non-deterministic finite automaton and construct an equivalent deterministic finite automaton.
DFA	Describes a tagged Deterministic Finite Automaton recognizing the language of some given tagged regular expression.
DFA.Cell	Describes the actual behavior of one cell of the automaton, i.e. either performing some final action or shifting to another state according to a transition table.
DFA.GotoAction	Describes an automaton action, i.e. either jumping to another state with number DFA.GotoAction.target, or back-tracking
DFA.Key	A key is an abstraction of a DFA state which represents the set of NFA states and memory maps that the DFA state stands for, in such a way that two different states with the same key can be made equal by copying some memory cells in others.
DFA.MemAction	Action on memory cells to take when following a DFA transition Actions are of two kinds: either setting some memory cell to the current position input, or copying one memory cell's contents into another.
DFA.MemAction.Copy	Represents a memory action where some memory cell DFA.MemAction.Copy.src must be copied into another cell DFA.MemAction.Copy.dst
DFA.MemAction.Set	Represents a memory action where some memory cell DFA.MemAction.Set.dst must be set to the current position input
DFA.MemMap	A memory map describes what memory cell corresponds to each tag.
DFA.Perform	Accepts the input by performing some semantic action and the associated finisher list
DFA.Remember	Describes action that should be taken when reaching a final state during traversal of the automaton: either do nothing or remember the associated action number and tag actions for later (useful when backtracking for longest match)
DFA.Shift	Shifts to another state of the automaton, potentially performing some side-effects
DFA.State	A state in the (tagged) deterministic finite automaton corresponds to a set of states in the non-deterministic automaton, each being associated with a memory map.
DFA.TagAction	Describes a tag action, i.e. commands which are performed as part of the finisher set corresponding to some final action.
DFA.TEquiv	Abstraction of the memory maps in a DFA state Describes a DFA.TEquiv.tag and all the possible sets of transitions that use this tag with some common memory cell.
DFA.TransActions	Packs together everything that describes shifting from one automaton cell to another, namely the state to go to (or whether to backtrack), and the associated memory actions to execute
NFA	Describes a tagged Non-deterministic Finite Automaton recognizing the language of some given tagged regular expression.
NFA.Event	Each transition in the NFA is based on an event, which is either of the following: a character is read from the character set whose index in the character set dictionary is NFA.Event.n a final state is reached and the semantic action whose index is NFA.Event.n must be performed
NFA.Transition	A transition in the NFA is an event decorated with a set of tags.

Enum Summary

Enum	Description
DFA.Cell.Kind	Enumerates describing the different kinds of automata cells
NFA.EventKind	The kinds of events that decorate transitions in the automaton