dfa

type DFA struct {
	Name string
	// States holds the state name as well as the state structure
	States map[string]*State
	// StateLookup holds key: symbol->symbol and all the states that
	// are in between of this symbol->state->symbol constellation.
	StateLookup map[string][]string
	// EdgeLookup holds key: symbol and as value all state pairs that
	// are connected by this symbol.
	EdgeLookup map[string][]*Edge
	Indexed    bool
	Start      string
}

type Edge struct {
	From string
	To   string
}

type State struct {
	// Name represents the name of the state
	Name string
	// Transitions represents the transitions of the state.
	// The map is structured map[Symbol]State
	Transitions map[string]string
	Final       bool
}