CWB
|
The DFA object. More...
#include <regex2dfa.h>
The DFA object.
A Deterministic Finite Automaton: into which a regular expression can be converted.
(Note this is regular expression across tokens, not single-string regexes, which are dealt with by functions in the corpus library.)
TODO: rename the functions and make this more object-oriented. Ideally, this should be a cleanly separated module, with "in" and "out" only via the methods declared here. Currently it's not like that - info is passed in via global variables, most blatantly searchstr.
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(), show_complete_dfa(), simulate(), and simulate_dfa().
set of final states.
Referenced by free_dfa(), init_dfa(), regex2dfa(), show_complete_dfa(), simulate(), and simulate_dfa().
int Max_Input |
max number of input chars of the current dfa.
Referenced by free_dfa(), init_dfa(), regex2dfa(), show_complete_dfa(), simulate(), and simulate_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(), show_complete_dfa(), simulate(), and simulate_dfa().
int** TransTable |
state transition table of the current dfa.
Referenced by free_dfa(), free_environment(), init_dfa(), regex2dfa(), show_complete_dfa(), simulate(), and simulate_dfa().