搜索资源列表
[NFA+TO+DFA]
- NFA的确定化是编译过程中一个重要的部分,由于本程序的输入很多,而且有多种格式的输入,所以输入时必须非常小心细致。本程序比较复杂,需要使用多个结构体并使用了指针。必须将程序分解为多个子程序以降低编写难度。想起了软工老师的一句话:"难事破与易",再复杂的事,拆成一个个简单的小部分,逐个击破,在拼凑起来,复杂的事也变的简单了。适当使用全局常量可以控制有效控制内存溢出。由于程序较大,调试时多人协作能更容易易找出程序并成功修改。
NFA
- 程序实现窄聚焦(NFA)算法进行SAR回波成像,基于matlab
NFA转换成DFA
- C++实现NFA转换成DFA
NFA轉DFA
- 編譯器中NFA轉DFA程式碼
DFA-optimal NFA转化为DFA及DFA的最小化
- 正规式转化为NFA,NFA转化为DFA及DFA的最小化-NFA change into DFA
NFA-CONVERT-TO-DFA
- 编写程序读取nfa.txt,构造出NFA的数据结构,并编写算法实现NFA到DFA的转化。-Write a program to read nfa.txt, the data structure constructed NFA and NFA to DFA write algorithm transformation
DFA.rar
- 扫描样本字符串,转换成NFA,继续转换,成为DFA,验证此字符串。,Scanning the sample string into a NFA, to continue to convert and become DFA, verify that the string.
NFA-DFA
- 词法分析器 NFA DFA 最小化DFA 实验报告-Lexical analyzer NFA 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
reEX-DFA
- 正则表达式转化为NFA,NFA转化为DFA,DFA最小化-regular expression toDFA
NFA
- nfa to dfa concersion code with regular expression
reg2NFA
- 这个编译实验把一个正则表达式转化为不确定的有穷自动机NFA算法,有兴趣的朋友可以看看哦。 -The experiment to compile a regular expression into an uncertain finite automata NFA algorithm, interested friends can see Oh.
NFA
- 用C#编写的不确定有穷自动机NFA=>确定有穷自动机DFA的转换算法,-Uncertainty with C#, finite automata NFA => OK finite automaton DFA conversion algorithm
RegextoDFA
- 正则表达式转DFA,设计原理:1正则表达式转换为带ε的NFA(Thompson构造法);2ε-NFA转为DFA;3最小化DFA;4DFA状态转换表判断是否接受输入字符串,附有详细文档说明。-Regular expressions turn DFA, design principles: a regular expression is converted to ε of the NFA (Thompson Construction Law) 2ε-NFA to DFA 3 minimal DF
NFA_DFA
- 利用C++语言实现编译词法分析中的NFA到DFA的转换。-Language implementation using C++ compiler lexical analysis of the NFA to DFA conversion.
DFA_2
- NFA转换为DFA,包括确定化和最小化。-NFA into DFA, including the identification of and minimized.
Chapter2
- 编译原理第二章的ppt 内容包含语法描述 NFA到DFA 以及DFA最小化的算法-Compiler Construction Principles Chapter II contains the ppt Syntax Descr iption NFA to DFA and DFA minimization algorithm
NFAToDFA
- NFA TO dfa功能主要是实现从nfa 转换成 dfa,这是编译原理的程序设计,输入时是正则表达式-NFA TO dfa
bianyisrc
- 编译原理实验包括正规式到NFA,NFA到DFA、LL1、LR代码都执行过,都没有错误-Compile regular expression to the principle experiment, including NFA, NFA to DFA, LL1, LR code is executed, no errors