搜索资源列表
NFA到DFA
- 编译原理NFA到DFA的转换源码-compiler theory NFA to the DFA source conversion
用Java语言实现NFA到DFA的等价变换
- 本程序为编译原理里的一个重要的知识点，实现NFA到DFA的转换-procedures for the compiler's a principle important knowledge points, for the NFA to DFA conversion
youxianzidongjihuajian
- 有限自动机的确定化及化简 1、更正了 DFA_simplify2 中的错误 2、增加新旧状态对照表 ds_temp --NFA转DFA -- 输入字符 -- 要求 id 必须从 1 开始连续递增-Finite Automata and the identification of a simplification, correction of the errors DFA_simplify2 2,
nfadfa
- 编译原理小作业NFA转DFA，用C写的，环境是VC下的控制台程序-Compiler Construction Principles small operating NFA to DFA, written using C, the environment is under VC console procedures
AutoMake5.0
- 一个大学时候做的编译原理的实验.实验内容是正则表达式到NFA到DFA到最小化DFA最终生成词法分析代码的整个过程的演示.那时由于时间关系,词法分析代码自动生成部分还没完成.-When a university to do the compiling principle experiment. Experiment is a regular expression to NFA to DFA to minimal DFA of the fi
Cpp1
- 构造nfa及到DFA的转换 构造nfa及到DFA的转换-NFA to DFA structure and structural conversion to NFA and DFA conversion
Transformation_NFA_to_DFA
- Transformation_NFA_to_DFA 不确定有限自动机NFA到有限自动机DFA的转换-Uncertainty Transformation_NFA_to_DFA finite automata finite automata NFA to DFA conversion
reg2NFA(java)
- 正则表达式到NFA，NFA到DFA的JAVA实现，图形表示结果。-Regular Expression to NFA, NFA to DFA s JAVA realized, graphical representation of results.
123
- 编译原理课程设计报告正规表达式到NFA（不确定的有限自动机），NFA到dfa及DFA（有限自动机）的最小-Principles of curriculum design report compiled formal expression to the NFA (finite automaton uncertain), NFA to DFA and the DFA (finite automaton) minimum
[NFA+TO+DFA]
- NFA的确定化是编译过程中一个重要的部分，由于本程序的输入很多，而且有多种格式的输入，所以输入时必须非常小心细致。本程序比较复杂，需要使用多个结构体并使用了指针。必须将程序分解为多个子程序以降低编写难度。想起了软工老师的一句话：＂难事破与易＂，再复杂的事，拆成一个个简单的小部分，逐个击破，在拼凑起来，复杂的事也变的简单了。适当使用全局常量可以控制有效控制内存溢出。由于程序较大，调试时多人协作能更容易易找出程序并成功修改。-NFA det
dfa
- 由输入的正规式自动生成NFA，再转换为DFA。再对指定的文件进行处理。找出该文件中与正规式匹配的子串。-By the importation of automatic generation of formal NFA, and then converted to DFA. Re-designated the documents for processing. To find the document with the informal
[NFA+TO+DFA]
- [NFA+TO+DFA] 很好很强大的,全部都有了,下下来就行了-[NFA+ TO+ DFA] very very powerful, all have been, the next down on the list
DFA
- 扫描样本字符串，转换成NFA，继续转换，成为DFA，验证此字符串。-Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
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 met
NFATODFA
- NFA到DFA的转换 这是用visual C++ 编写的程序 有注释！-NFA to DFA conversion This is to use visual C++ have the Notes prepared by the procedure!
NFA_DFA
- nfa 到 dfa c实现 编译原理课程设计详细文档，包含NFA->DFA,DFA的最小化。 -nfa to dfa c实现 编译原理课程设计详细文档，包含NFA->DFA,DFA的最小化。
NFA-DFA
- 实现从nfa到dfa的转换，并且输出中间的状态集以及转换表-From nfa to dfa conversion and output as well as the middle of the state set conversion table
nfa-dfa
- 可实现，nfa到dfa的转化，利用c语言编写，本人以用过一次，老师评价很好-Can be achieved, nfa to dfa conversion using c language, I used once, very good teacher evaluation
javafr_EDITEUR-GRAPHIQUE-NFA-DFA___Page
- graphic simulation nfa to dfa
NFA to DFA.cpp
- nfa转换为dfa，一个简单的程序cpp(nfa trans to dfa,a simple program. /.cpp)