搜索资源列表
050420106wangmeijun
- 编译课程设计，有穷自动机的确定化与最小化,完成了DFA,NFA,RE之间的相互转化和DFA的最小化
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
scnanner
- 词法分析器 re->nfa->d fa优化-Lexical analyzer re-> nfa-> dfa-> dfa Optimization
retonfa
- performs re to nfa conversion
regToDFA
- 正则表达式到DFA 并能够输出检测结果。输入文件要求： （a|b）* 文件第一行 aaaa 文件第二行 a-Re to DFA
2dfa
- 这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，此程序最终完成的是下面网站要求的功能。http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm-这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm
NFA_To_DFA
- This Program will convert the Non-Deterministic Finite Automata to Deterministic Finite Automata. Here RE is not given but NFA-Table should be given to the Input And output will FA-Table. So best of luck-This Program will convert the Non-De
cifafenxi
- 1、根据要求写出词法分析的正规文法G；2、根据正规文法G，写出正则式RE；3、根据正则式RE，画出NFA；4、将NFA转化为DFA；5、将DFA转化为mininum state DFA；6、mininum state DFA就是词法分析程序的流程图，根据此流程图编写相应的词法分析程序。-1, according to the lexical analysis required to write a formal grammar G 2, according to a regular gramm
javaautomate
- java files for automate re to nfa
ThompsonNFA
- 这是Thompson将正规式转为NFA的详细算法-Thompson Re to NFA