搜索资源列表
regex
- 实现了正则表达式转NFA，NFA转DFA，DFA最简化的过程。并可输出DFA到图像。-It can translate Regular Expression into NFA, NFA into DFA, and minimize the DFA. The result can be printed as a graph.
tam
- 编译原理词法分析程序，编写简单语言的词法分析程序，掌握从正规式到有穷自动机，再到有穷自动机最小化，最后完成编成的流程及相关技术。-Principles of lexical analysis program to compile, prepare a simple lexical analysis of language to grasp from the formal ceremony to DFA, DFA to minimize the process of finalizing the
shiyan2
- 本程序主要是使用“子集法”实现NFA的确定化，使用“分割法”实现DFA的最小化，在本程序中用到的主要的数据结构是数组，这些数组是用来存放NFA的初始状态集，及确定化和最小化后的状态矩阵。-This procedure is mainly the use of " sub-set method" to achieve the determination of NFA, the use of " segmentation" to achieve a minimum
Minimize
- Huffman Minimization algorithm.Accepts only DFA as input.
TransformExprTODFA
- 正则表达式转NFA NFA转DFA DFA最小化 测试字符串是否匹配-Transfer NFA NFA regular expression to minimize transfer DFA DFA test whether the string matches
lexer
- 词法分析器，输入正规式，转换成NFA，在到DFA，最小化DFA。用java编写了可视化界面，健壮性强-允许输入拉丁字符的拼音 Lexical analyzer, enter the regular expression, convert the NFA to DFA, minimize DFA. Java prepared a visual interface, robustness
Regular-expres
- 实现有穷自动机，NFA到DFA的最小化，实现最长匹配-Realization of finite automata, NFA to DFA, minimize, the longest match
DFA-optimal
- 编译原理实验 DFA的最小化 C语言编写 简单控制台程序 适合初学者学习 - DFA compiler principle experiment to minimize the C language Simple console program for beginners to learn
Minimizer
- this dfa minimizer that minimize dfa machine to lower states-this is dfa minimizer that minimize dfa machine to lower states
DFA
- NFA化为DFA，并将DFA最小化，输出最小化后的DFA的状态转化矩阵。-NFA into a DFA, and minimize DFA, DFA minimize output condition after transformation matrix.