Regular expressions into C++ implementation of NFA
4.0
Problem Description: A001: Write a program, enter a regular expression that is equivalent to the output of the grammar of finite automata Data Structure: Body utilize vector class, Node n represents an arrow on each node, design display function as a display function.