Location:
Search - nfa
Search list
Description: topway的LMT035DNAFWU-NNA-Manual-Rev0.1，可以很好的了解lcd控制器-topway the LMT035DNAFWU-NNA-Manual-Rev0.1, can be a very good understanding of lcd controller
Platform: |
Size: 235520 |
Author: 黄飞 |
Hits:
Description: 用VC6.0编译出的求阶乘算法（0---10000）标准C 语言控制台应用程序 -Using VC6.0 compiler seek out factorial algorithm (0-10000) standard C language console application
Platform: |
Size: 1024 |
Author: 郭俊 |
Hits:
Description: DFA状态最少化的算法，即DFA的最小化-DFA state minimization algorithm, namely, DFA Minimization
Platform: |
Size: 3072 |
Author: 侯坤 |
Hits:
Description: NFA确定化的算法，核心主要是找到新的状态集合-NFA-based algorithms to determine the core principal is to find a new state of the collection
Platform: |
Size: 2048 |
Author: 侯坤 |
Hits:
Description: 编译原理：构造LR(0)项目并输出其NFA状态转换矩阵
要求：构造一程序，对任意给定的文法G：
(1)构造并输出G的所有LR(0)项目；(2)用这些LR(0)项目构造并输出识别文法活前缀的NFA(输出其状态转换矩阵)。
-Compilation Principle: Structure LR (0) projects and export its NFA state transition matrix requirements: one procedural structure of any given grammar G: (1) structure and the output G of all LR (0) projects (2) use these LR (0) item recognition grammar structure and output of live prefix NFA (the output of its state transition matrix).
Platform: |
Size: 314368 |
Author: jiabin |
Hits:
Description:
Platform: |
Size: 292864 |
Author: 孟飞 |
Hits:
Description: Java 实现的NFA,输入正则表达式，得到NFA图形表示的结构-Java realize the NFA, enter regular expressions, the graphical representation of the structure of NFA
Platform: |
Size: 36864 |
Author: yunhs |
Hits:
Description: 编译原理，实现NFA到DFA之间的转换，中间的方法都有-Compiler theory, to achieve between the NFA to DFA conversion, Central methods have
Platform: |
Size: 3072 |
Author: zhangbanghua |
Hits:
Description: 对基于状态转换矩阵表示的FA转换成NFA，初始化数据从文件读入。-State transition matrix based on the FA that convert NFA, initialization data from the document read.
Platform: |
Size: 2048 |
Author: liufan |
Hits:
Description: 输入正则表达式，转化为NFA,DFA，从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
Platform: |
Size: 67584 |
Author: |
Hits:
Description: 主要介绍了词法分析器的lex实现以及DFA和NFA构造状态表的方法-Mainly introduce the lexical analyzer lex implementation, as well as DFA and NFA state table structure of the Ways
Platform: |
Size: 231424 |
Author: horieyui |
Hits:
Description: 实现DFA转化为NFA，功能比较简单，但程序结构比较合理-DFA implementation into NFA, feature relatively simple, but the program structure more reasonable
Platform: |
Size: 2048 |
Author: duoduo |
Hits:
Description: nfa的确定化 NFAtoDFA也是编译原理中的算法，供大家参考 -nfa is NFAtoDFA determination of the principle of compiler algorithms, thank you for your consideration
Platform: |
Size: 2048 |
Author: 张志刚 |
Hits:
Description: 智能的词法分析 ，能任意输入正则表达式，能求出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
Platform: |
Size: 441344 |
Author: 季 |
Hits:
Description: 一个自己写的NFA转DFA的程序，编译的作业，很不错哦！-Write their own procedures for NFA to DFA, the compiler of the operation, is pretty good, oh!
Platform: |
Size: 633856 |
Author: 吴男 |
Hits:
Description: Lex输入文件的解析
正规表达式的解析
一个正规表达式到NFA的转换算法的实现-Analysis of the Lex input file of regular expressions to resolve a formal expression to NFA conversion algorithm
Platform: |
Size: 1359872 |
Author: mj |
Hits:
Description: 实现NFA到DFA的转换，是编译原理初学者比较好的参考资料-Achieve NFA to DFA conversion, the principle is to compile a better reference for beginners
Platform: |
Size: 2048 |
Author: ZWL |
Hits:
Description: 正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西。 有限自动机的确定华，NFA到DFA的转变。
-Is the type that the DFA has recently learned a compiler to produce more of the principle of things. Determination of finite automata China, NFA to DFA transformation.
Platform: |
Size: 12288 |
Author: 郭称平 |
Hits:
Description: 1.输入文件解析
2.正则表达式转化为NFA
3.多个NFA合并
4.NFA转换DFA
5代码生成
关于输入文件格式：
没有考虑对lex输入文件的出错处理，所以输入文件务必严格书写正确。
Lex中的正规表达式使用了以下运算符：
[] | * @ ( )
并且正规表达式中不能出现其他的子正规表达式。
如果想要在待识别的正则式中使用上述运算符，请使用转义符号，即\。
例如，如果想用*，可以写成\*
-1. Analysis of the input file 2. Regular expressions into NFA 3. More than the combined NFA conversion 4.NFA Code Generation DFA 5 on input file format: There is no consideration of the lex input file error handling, the input file must be written in strict correct. Lex in the regular expression operators used the following: [] |* @ () and regular expressions can not be a subset of other regular expressions. If you want to be identified in the regular-type operator to use the above, please use the escape symbol, that is, \. For example, if you want to use*, can be written in \*
Platform: |
Size: 17408 |
Author: 顾添锦 |
Hits:
Description: 实现NFA到DFA的转换过程。文件中包含输入格式 见txt 文档-Turn NFA to DFA
Platform: |
Size: 769024 |
Author: 张丹 |
Hits: