搜索资源列表
Transformation_NFA_to_DFA
- Transformation_NFA_to_DFA 不确定有限自动机NFA到有限自动机DFA的转换-Uncertainty Transformation_NFA_to_DFA finite automata finite automata NFA to DFA conversion
RegToFA
- 从正则表达式到NFA再到DFA的C#实现,图形界面。-From regular expressions to NFA to DFA in C
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
zhengguishizhuanNFAheDFAjizuixiaohua
- 用图实现的正规式转NFA转DFA,及对DFA的最小化实现。-With plans to achieve a formal ceremony to NFA to DFA, and the smallest of the realization of DFA.
compile_work
- 从正则表达式到有穷自动机实例 想研究透彻正则表达式,必须知道有穷自动机的原理,这个源码可以给你一个很好的示例参考。编译后程序会生成一个可执行文件,运行这个文件出来一个DOS窗口,然后按提示输入正则表达式。 -From regular expressions to DFA thorough study of examples like regular expressions, we must know the principles
Lexical
- dfa he NFA 之间的转化 非常好用啊 要是需要和我练习-dfa he NFA conversion between ah If there were to be very easy to use and I practice
TEMPLATE
- 输入正则表达式,转化为NFA,DFA,从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
DFA
- 形式语言中的有穷状态自动机(DFA)的实现,用c#作为开发工具-The form of language has poor state automaton [DFA] of the implementation, using c# as a development tool
NFATODFA
- NFA到DFA的转换 这是用visual C++ 编写的程序 有注释!-NFA to DFA conversion This is to use visual C++ have the Notes prepared by the procedure!
DFAReader
- 一个java编写的DFA(difinite automata reader) 拥有完备的图形界面和rebustness 另付.dat的测试文件 -Java prepared a DFA (difinite automata reader) has a comprehensive graphical interface and rebustness extra. Dat test document
NFA_DFA
- nfa 到 dfa c实现 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。 -nfa to dfa c实现 编译原理课程设计详细文档,包含NFA->DFA,DFA的最小化。
DFA
- 本程序是用来解决消除趋势波动分析的MATLAB程序-This procedure is used to address the elimination of detrended fluctuation analysis of the MATLAB program
Lexical_analysis
- 智能的词法分析 ,能任意输入正则表达式,能求出NFA,DFA,minDFA,和最后的匹配情况-Lexical analysis of intelligence, can enter any regular expression can be obtained NFA, DFA, minDFA, and the final match of the situation
NFA_DFA
- 正规(则)表达式转化为NFA,DFA,DFA最小化,显示结果和过程-Formal (then) regular expressions into NFA, DFA, DFA minimization, and process the result will be displayed
DFA
- 编译原理课程设计之正则表达式与自动机之间的变换-Principles of curriculum design to compile regular expressions with the automatic transformation between
DFAshixian
- DFA的输入; DFA的存储与读写; DFA的语言集列表显示; DFA的规则字符串判定; -DFA input DFA storage with reading and writing DFA table shows the language of sets DFA to determine the rules of string
Lex
- 1.输入文件解析 2.正则表达式转化为NFA 3.多个NFA合并 4.NFA转换DFA 5代码生成 关于输入文件格式: 没有考虑对lex输入文件的出错处理,所以输入文件务必严格书写正确。 Lex中的正规表达式使用了以下运算符: [] | * @ ( ) 并且正规表达式中不能出现其他的子正规表达式。 如果想要在待识别的正则式中使用上述运算符,请使用转义符号,即\。 例如,如果想用*,可以