The DFA object. More...
#include <regex2dfa.h>
The DFA object.
A Deterministic Finite Automaton: into which a regular expression can be converted.
int E_State |
Error State -- it is introduced in order to make the dfa complete, so the state transition is a total mapping.
The value of this variable is Max_States.
Referenced by regex2dfa(), and show_complete_dfa().
set of final states.
Referenced by free_dfa(), init_dfa(), regex2dfa(), and show_complete_dfa().
int Max_Input |
max number of input chars of the current dfa.
Referenced by free_dfa(), init_dfa(), regex2dfa(), and show_complete_dfa().
int Max_States |
max number of states of the current dfa.
state no. 0 is the initial state.
Referenced by check_alignment_constraints(), free_dfa(), init_dfa(), regex2dfa(), and show_complete_dfa().
int** TransTable |
state transition table of the current dfa.
Referenced by free_dfa(), init_dfa(), regex2dfa(), and show_complete_dfa().