All Classes and Interfaces
Class
Description
Abstract base class for all automata models.
Abstract builder based on the Curiously Recurring Template Pattern (CRTP).
Base interface for all types of Automata (DFA, NFA, ENFA).
Utility class for Finite State Automata conversion.
Deterministic Finite Automaton (DFA).
Builder pattern to construct the DFA fluently.
Non-Deterministic Finite Automaton with Epsilon Transitions (ε-NFA).
Builder pattern to construct the ENFA fluently.
Represents a single evaluation step within an automaton's execution trace.
Contains the complete chronological sequence of states evaluated by an automaton
when processing a specific input string.
Utility class for exporting automata to the Graphviz DOT language format.
Utility class for exporting automata to the Mermaid.js stateDiagram-v2 format.
Utility class for DFA minimization.
Non-Deterministic Finite Automaton (NFA).
Builder pattern to construct the NFA fluently.
Facade class representing a compiled Regular Expression.
Base interface for all nodes in the Regular Expression Abstract Syntax Tree (AST).
Represents the concatenation of two regular expressions (e.g., "ab").
Represents a single literal character in the regex (e.g., 'a', 'b').
Represents the Kleene Star operator, allowing zero or more repetitions (e.g., "a*").
Represents the union (OR) of two regular expressions (e.g., "a|b").
The Visitor interface for the AST nodes.
A Recursive Descent Parser that converts a Regular Expression string into an Abstract Syntax Tree (AST).
* Grammar implemented:
Regex -> Term ( '|' Term )*
Term -> Factor ( Factor )* (Implicit concatenation)
Factor -> Base ( '*' )*
Base -> char | '(' Regex ')'
Represents a state (q) within an automaton.
Implements Thompson's Construction algorithm to convert an Abstract Syntax Tree (AST)
of a regular expression into an Epsilon-NFA (ENFA).
Represents a single transition from one state to another by reading a symbol.