Module nfa 

Nondeterministic finite automaton (NFA) related implementations.

An NFA can be built from a mid-level intermediate represention (Mir).

Structs

NFA

A nondeterministic finite automaton (NFA) with symbol type S and tag type T.

Type Aliases

FATags

A pair of NFA’s internal finite automaton and the tag map.