搜索资源列表
LexicalAnalyzer
- 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。 将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually constr
Lex
- **本次实验在Visual Studio.NET 2003环境下开发** 此压缩包内包括以下五个文件： 1.Lex的源代码文件 Lex.cpp 2.Lex的测试输入文件 test.txt 3.测试文件需包含的头文件 yytab.h 4.经过Lex生成的结果文件yylex.cpp 5.说明 关于Lex: 本实验中完成的Lex可以完成以下算法： 1.输入文件解析 2.多个NFA合并 3.NFA转换DFA 4.最小化DFA 5.生成代码
DeterministicFiniteAutomata_CPP
- This program is used in a language examination of the DFA. DFA is one type of FA where there is only one alternative state transitions from one state to another using the same input. In this program users can use existing DFA or create a new DFA. W
JavaScanner
- 1. 使用DFA实现词法分析器的设计； 2. 实现对Java源程序中注释的过滤； 3. 利用两对半缓冲区从文件中逐一读取单词； 4. 词法分析结果属性字流存放在独立文件(文件名：scanner_output)中； 5. 统计源程序每行单词的个数和整个源文件单词个数； 6. 具有报告词法错误和出错位置（源程序行号和该行字符）的功能；-1. Using DFA realize the design of the lexical analyzer 2. To realize th
DFA
- 从正则表达式到有穷自动机实例，最近刚学了编译原理 搞出来得这个东西-From regular expressions to finite automata instance, recently learned more this thing come up with compiler theory
lib1
- 编写一个C语言程序，模拟实现DFA识别字符串的过程。-dfa
NFAtoDFA
- 不确定的有穷自动机NFA转确定化的有穷自动机DFA
NFtoDFA
- NFA到DFA转化C代码 大家可以参考参考-NFA to DFA transformation of C code you can refer to the reference Ha ha ha ha ha
1
- MiniCalc基于自动机理论实现的计算器源代码-The MinCale is a calculater that based DFA,which had better source code
Compilingpnciplecoursedesign
- NFA的确定化是指对给定的NFA都能相应地构造出一个与之等价的DFA，使它们能够识别相同的语言。NFA的确定化使状态转移的复杂度仅为O(1)，为状态的转移提供了帮助。-Make the NFA refers to the NFA accordingly given to construct a and the equivalent DFA, enables them to identify the same language. Make the NFA to divert the complex
re2dfa
- 正则表达式到DFA的C程序，很有用的一个小程序，透彻理解DFA算法-Regular expressions to DFA' s C program, a small program useful, thorough understanding of the DFA algorithm
NFA12
- NON diterministic finite automata to dfa
BianYiYuanLi
- 编译原理所有重要算法的实现 以及词法分析语法分析、中间代吗生成。LL1 LR0 算符优先 算符表达式到NFA再到DFA的算法。-Compile program. LL1 LRO NFA->DFA->MFA
src
- 简单的小程序，用于开发Java编译器！若有错误，请给予指正-the nfa to dfa is simple,but I think is ok now!I hope some one can catch the error for me!
nfa_dfaconversion_dfasimulation
- NFA toDFA conversion and then take string as input and check whether String is acceptable by DFA or not
minDFA
- 最小化DFA，编译原理中的语法问题，用程序实现这些功能-Minimized DFA, compiler theory of grammar problems, with procedures to perform these functions
NFAtoDFA
- 给出一个NFA，用代码实现到DFA的转换，编译原理-Give an NFA, with the code to DFA conversion, compiler theory
nfadfa
- This a c program that converts NFA to DFA-This is a c program that converts NFA to DFA
NFADFA
- 正则式转成最小DFA，这是编译原理上机作业题目，含个人readme-The smallest regular expression turned into DFA, which is compiled on the machine operation principle of topics including personal readme
DFA
- deterministic finite automata