Build an NFA from a regular expression using Thompson's construction algorithm. Each step shows how the NFA is incrementally constructed.
Supported: a-z, | (union), * (star), + (plus), ? (optional), (), [a-z] (ranges), ε
a-z
|
*
+
?
()
[a-z]
ε