搜索资源列表
DFA
- 输入一个正则表达式，输出相应的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-DFA-MFA
- 正则表达式及NFA-DFA-MFA的转换和判别-Regular expressions and NFA-DFA-MFA conversion and discriminant
DFA
- 输入正则表达式转化为DFA，最小ＤＦＡ部分还不完善-Enter the regular expression into a DFA, minimal DFA part is not perfect
wenjain1
- 正则表达式转化为DFA。首先转化为逆波兰表达式。再建立语法分析树，求firstops,followops,lastops,nullable函数，构建DFA。-Regular expressions into DFA. First into reverse Polish notation. Re-establishing the parse tree, seeking firstops, followops, lastops, nullable function, build DFA.
RextoNFA
- 实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation
B6MHjIFh
- 编译原理实验正则表达式到NFA 由NFA到DFA，同时有状态表的生成-Experimental regular expression to NFA From NFA to DFA, while the state table generation