搜索资源列表
minimumDFA
- 编译原理文法C语言编程实现DFA的最小化-C programming language grammar compiler theory to achieve the minimum DFA
3c4f17957854
- 正则式到dfa的转化 正规式到有穷自动机的转化-Regular expression to dfa conversion of regular expression to the transformation of finite automata
zijigouzao
- 实现DFA的确定化中状态转换的过程，包括最终的最小化-Determined to achieve the DFA state transition process, including the final minimized
A-poor-algorithm-to-implement
- 又穷自动机的实现，对于DFA有助理解，希望对大家有用-And poor implementation of automatic machines for the DFA will help to understand, we hope to be useful
A-poor--regular-expression-matches
- 有穷自动机的实现，关于正则语言的学习。有助DFA的理解-Implementation of finite automata, on the regular language learning. Facilitate the understanding of DFA
MorphlogyAnalysis_MrCompiler
- 基于Mac OS下的VIsual C++编程 实现词法分析器作用-Visal C++ Language to realize the functioon of DFA & NFA based on the os of MAC OS
NFA-to-DFA
- 编译原理 NFA 确定化 使用set 有注释，感觉已经很多了-Compiler theory of NFA to determine
function_dfa_nfa
- dfa to nfa conversion of automatons in pascal: Determinization+minimalization
LR-parser
- LR分析器设计 给定说明语句的拓广文法G[S ]如下： (0) S ->S (1) S->v I:T (2) I->I,i (3) I->i (4) T->r 其中v代表终结符var,r代表real。 其识别规范句型活前缀的DFA及LR(0)分析表如下: 输入 状态 ACTION表 GOTO表 v i , : r # S I T 0 S2 1 1 acc 2 S4
NFA_TO_DFA
- 编译原理，使用C++实现NFA到DFA的转化-Compiler theory, the use of C++, the conversion of NFA to DFA
canonical-_TO_DFA
- 编译原理，使用C++语言实现从正规式到DFA的转化-Compiler theory, from a formal style to DFA conversion
AjaxParser
- 一个VC++有穷自动机分析内核的源代码，为 DocWizard 做词法分析准备，本分析内核可以在不改变代码的情况下分析不同的 DFA……有意思吧，看看代码就会明白。 -VC++ there is a finite automaton of the kernel source code, to prepare for the DocWizard do lexical analysis, this analysis does not change the kernel code can anal
myCompiler
- 用C#语言对编译原理的编程实现包括NFA转DFA、LR（0）、算符优先等算法-Compiled with the C# language programming principles, including NFA transfer DFA, LR (0), operator precedence and other algorithms
main
- 编译原理课程实验，NFA到DFA转换及化简的C++语言实现。-Compiler theory course experiment, NFA to DFA Conversion and Reduction of C++ language.
-kk
- Convert from DFA to NFA
NFA
- DFA NFA 文件生成转换 C++ 制作源码-DFA NFA file to generate source code conversion C++ production
Archivo-comprimido
- multifractal dfa analysis with matlab code within
dfa
- 译原理实验（确定有穷状态自动机） 输入正则文法 输出状态集合 字母表 开始状态终止状态 以及识别句子 -Translation of principle experiment (be sure to have poor state automaton) Input regular grammar output state set alphabet began to state and to identify terminate state sentences
simpledfa
- C++小程序，实现一个简单的有穷自动机，了解基本的状态转移等-realize a simple dfa
Parsing
- 语法分析程序的设计与实现 方法2：编写LL（1）语法分析程序，要求如下： （1）编程实现算法4.2，为给定文法自动构造预测分析表； （2）编程实现算法4.1，构造LL（1）预测分析程序。 2. 方法3：编写语法分析程序实现自底向上的分析，要求如下： 构造识别所有活前缀的DFA。 构造LR分析表。 编程实现算法4.3，构造LR分析程序。 -Parser design and implementation of Method 2: preparat