输入一个正则表达式，输出相应的NFA图，NFA转换为DFA（得到的DFA图要求用画图方法完成并要求先产生子集构造表出来再画DFA图），DFA最小化（也要求用画图方法完成） -Enter a regular expression, the output corresponding NFA map, NFA is converted to DFA (the DFA plans to be asked to use drawing methods and called for the first

编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过，都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors

实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation

编译原理实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation