当前位置:
首页
资源下载
![](/images/right.gif)
搜索资源 - regular expression to DFA
搜索资源列表
-
1下载:
手工构造一个能够识别C语言的所有典型单词,如:标识符、数字、运算符,和if、while等保留字的确定有限自动机,并写出对应该自动机的程序;然后以一个简化的C语言程序为输入文件,通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表,并以文件形式保存结果(也就是TOKEN序列)。
将自己定义的各个正则表达式转化为NFA,然后将其综合为NFA ,再将NFA 转化为DFA,再将DFA转化为最少状态的DFA ,最后由DFA 转化为词法分析程序。-Manually constr
-
-
0下载:
词法分析器,输入正规式,转换成NFA,在到DFA,最小化DFA。用java编写了可视化界面,健壮性强-允许输入拉丁字符的拼音
Lexical analyzer, enter the regular expression, convert the NFA to DFA, minimize DFA. Java prepared a visual interface, robustness
-
-
2下载:
用C语言采用模拟DFA算法编写一个扫描器(词法分析器)用来识别:
由任意个a或b开始后接aa再自加或自减1的字符串,即正规式r=(a|b)*aa(+|-)1描述的语言L(r)。
-Simulated DFA algorithm in C language to write a scanner (lexical analyzer) is used to identify: followed by any one of a or b aa longer self plus or decrem
-
-
0下载:
Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags.
-Executes a regular expression NFA DFA over a range using a variant of the paralle
-
-
0下载:
实验正则表达式到NFA
由NFA到DFA,同时有状态表的生成-Experimental regular expression to NFA
From NFA to DFA, while the state table generation
-
-
0下载:
编译原理实验正则表达式到NFA
由NFA到DFA,同时有状态表的生成-Experimental regular expression to NFA
From NFA to DFA, while the state table generation
-