module Pegasus::Nfa

Overview

This module is for nondeterministic finite automata. While NFAs aren't very good for directly creating state machines (you need to keep track of an exponential number of potential states), they are easier to construct. This module contains functionality to convert regular expressions to NFAs.

Defined in:

pegasus/nfa.cr
pegasus/nfa_to_dfa.cr
pegasus/regex.cr