NFA Struct Reference

Definition for the NFA itself. More...

Collaboration diagram for NFA:

Data Fields
int	stateCount
	the total number of states this NFA have
struct NFAState **	statePool
	the pool of all available states
int	ruleCount
	the total number of transition rules in this NFA
struct transRule **	rulePool
	the pool of all transition rules
int	CSCount
	the number of currently active states
struct NFAState **	currentStates
	the pool of all active states
int	subCount
	the number of sub NFAs
struct NFA **	subs
	the pool of all sub NFAs
int	wrapperFlag
	whether this NFA is a concatenation wrapper

Detailed Description

Definition for the NFA itself.

statePool[0] is defined to be its starting state, and statePool[1] is defined to be its accepting state. for simplicity's sake all NFAs are initialized to have a small fixed capacity, although due to the recursive nature of this algorithm this capacity is believed to be sufficient

---

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

• misc/mcnaughton_yamada_thompson.c