reflex::Pattern::DFA::State Struct Reference

updated Sun Aug 21 2022 by Robert van Engelen
 
Public Types | Public Member Functions | Public Attributes | List of all members
reflex::Pattern::DFA::State Struct Reference

#include <pattern.h>

Inheritance diagram for reflex::Pattern::DFA::State:
Inheritance graph
[legend]
Collaboration diagram for reflex::Pattern::DFA::State:
Collaboration graph
[legend]

Public Types

typedef std::map< Char, std::pair< Char, State * > > Edges
 

Public Member Functions

 State ()
 

Public Attributes

Statenext
 points to next state in the list of states allocated depth-first by subset construction More...
 
Stateleft
 left pointer for O(log N) node insertion in the hash table overflow tree More...
 
Stateright
 right pointer for O(log N) node insertion in the hash table overflow tree More...
 
Statetnode
 the corresponding tree DFA node, when applicable More...
 
Edges edges
 state transitions More...
 
Index first
 index of this state in the opcode table, determined by the first assembly pass More...
 
Index index
 index of this state in the opcode table 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 a final state of a negative pattern More...
 

Member Typedef Documentation

typedef std::map<Char,std::pair<Char,State*> > reflex::Pattern::DFA::State::Edges

Constructor & Destructor Documentation

reflex::Pattern::DFA::State::State ( )
inline

Member Data Documentation

Accept reflex::Pattern::DFA::State::accept

nonzero if final state, the index of an accepted/captured subpattern

Edges reflex::Pattern::DFA::State::edges

state transitions

Index reflex::Pattern::DFA::State::first

index of this state in the opcode table, determined by the first assembly pass

Lookaheads reflex::Pattern::DFA::State::heads

lookahead head set

Index reflex::Pattern::DFA::State::index

index of this state in the opcode table

State* reflex::Pattern::DFA::State::left

left pointer for O(log N) node insertion in the hash table overflow tree

State* reflex::Pattern::DFA::State::next

points to next state in the list of states allocated depth-first by subset construction

bool reflex::Pattern::DFA::State::redo

true if this is a final state of a negative pattern

State* reflex::Pattern::DFA::State::right

right pointer for O(log N) node insertion in the hash table overflow tree

Lookaheads reflex::Pattern::DFA::State::tails

lookahead tail set

State* reflex::Pattern::DFA::State::tnode

the corresponding tree DFA node, when applicable


The documentation for this struct was generated from the following file: