Finite state machine. More...
Public Types | |
typedef std::map< Char, std::pair< Char, State * > > | Edges |
Public Member Functions | |
State (const Positions &p) | |
Public Attributes | |
State * | next |
points to sibling state allocated depth-first by subset construction More... | |
State * | left |
left pointer for O(log N) node insertion in the state graph More... | |
State * | right |
right pointer for O(log N) node insertion in the state graph More... | |
Edges | edges |
state transitions More... | |
Index | index |
index of this state More... | |
Accept | accept |
nonzero if final state, the index of an accepted/captured subpattern More... | |
Lookaheads | heads |
lookahead head set More... | |
Lookaheads | tails |
lookahead tail set More... | |
bool | redo |
true if this is an ignorable final state More... | |
Finite state machine.
typedef std::map<Char,std::pair<Char,State*> > reflex::Pattern::State::Edges |
|
inline |
Accept reflex::Pattern::State::accept |
nonzero if final state, the index of an accepted/captured subpattern
Edges reflex::Pattern::State::edges |
state transitions
Lookaheads reflex::Pattern::State::heads |
lookahead head set
Index reflex::Pattern::State::index |
index of this state
State* reflex::Pattern::State::left |
left pointer for O(log N) node insertion in the state graph
State* reflex::Pattern::State::next |
points to sibling state allocated depth-first by subset construction
bool reflex::Pattern::State::redo |
true if this is an ignorable final state
State* reflex::Pattern::State::right |
right pointer for O(log N) node insertion in the state graph
Lookaheads reflex::Pattern::State::tails |
lookahead tail set