The first step constructs an NFA (Nondeterministic Finite Automaton) equivalent to the regular expression, where the operation for constructing finite automata with e -moves is omitted.

• 万法是首先构造与正则表达式等价的非确定有限自动机(NFA)，这里省略了构造带。