Procs
func eNfa(exp: RpnExp; reverse = false): Enfa {....raises: [RegexError], tags: [].}
- Thompson's construction. If reverse is true, the NFA matches the expression backwards
func eRemoval(eNfa: Enfa): Nfa {....raises: [], tags: [].}
- Remove e-transitions and return remaining state transtions and submatches, and zero matches. Transitions are added in matching order (BFS), which may help matching performance
func nfa2(exp: RpnExp): Nfa {....raises: [RegexError], tags: [].}