搜索资源列表
nfa-to-dfa
- 编译实验，实线有穷自动机，nfa到dfa-Compile the experiment, solid line finite automata, nfa to dfa
Regular-expres
- 实现有穷自动机，NFA到DFA的最小化，实现最长匹配-Realization of finite automata, NFA to DFA, minimize, the longest match
shiyan2
- 编译原理实验：程序段的单词识别。：给定某种语言的语法规则，生成识别该语言单词的确定的有穷自动机（DFA），然后通过该DFA对该语言的程序段进行单词识别，给出识别的单词序列，每个单词用二元式表示-Compiler principle experiment: block word recognition. : Given a language grammar rules to generate finite automata (DFA) identify the word of the langua
scaner
- 编译原理扫描器，按照有限自动机和词法分析器的原理制作而成。-The compiler theory scanner, made in accordance with the principle of finite automata and lexical analyzer.
Machine
- 由正则表达式生成有限自动机,显示有限自动机的状态和动作等，方便学习有限自动机课程。-By regular expressions to generate a finite automaton states and actions of finite automata, to facilitate learning finite automata courses.
DFAjava
- 确定有限自动机最小化的java实现代码，-Finite automata minimization java implementation code
1
- 有限自动机的C++代码实现，完整，全面的阐述了有限自动机的工作原理-The finite automata C++ code to achieve the complete, comprehensive exposition of the works of the finite automata
test1
- 从正则表达式到有穷自动机实例，自动机课程设计源码-From regular expressions to finite automata instance, automata curriculum design source
24130150
- 有穷自动机的实现，编译原理实验，编译原理的三个实验-The realization of finite automata, compiler theory experiments, compiler theory of three experiments
100410508
- 有穷自动机的实现，编译原理实验，编译原理的三个实验-The realization of finite automata, compiler theory experiments, compiler theory of three experiments
100410517
- 有穷自动机的实现，编译原理实验，编译原理的三个实验-The realization of finite automata, compiler theory experiments, compiler theory of three experiments Han Han Han
DFA
- 有限自动机的实现，可用于固定序列匹配，自然语言处理中的词干提取，词缀切分等-The realization of finite automata can be used for fixed sequence matching, natural language processing stemming, affixes cut grading
Calculator
- 在Fedora Linux下编写的C语言程序。可以将文本文件中的表达式构造成语法树并计算求值。表达式如存在语法错误，表达式语法错误可由相关自动机发现。代码适合：学习自动机和语法树的初学者。-C codes under Fedora Linux. The codes can transform expressions in text file to a parse tree. Grammar mistakes could be detected by a finite automata. This
REGU
- 想研究透彻正则表达式，必须知道有穷自动机的原理，这个VC++源码可以给你一个很好的示例参考。编译后程序会生成一个可执行文件，运行这个文件出来一个DOS窗口，然后按提示输入正则表达式。-Want to study thoroughly the regular expression, you must know the finite automata theory, the VC++ source code can give you a good reference sample. After co
VCPPregularEx
- VC++从正则表达式到有穷自动机实例，这个初级代码，值得学习一下。-VC++ from regular expressions to finite automata examples, the initial code, it is worth learning about.
miki
- 自动机（用于识别输入字符串是否合乎规则）-finite automata
NFA
- 形式语言与自动机中NFA(不确定的有限自动机)的java实现-Formal Languages and automata NFA (uncertain Finite Automata) to achieve the java
3-bianyichengxu-ppt
- 编译原理资料：第三章，词法分析。词法分析器的设计与实现，正规表达式与有穷自动机，正规文法与正规式，正规文法与有限自动机的等价性-Compiler theory Information: Chapter III, lexical analysis. Design and implementation of lexical analyzer, regular expressions and finite automata, formal grammars and formal style, form
DFAminimization
- A program that minimizes a deterministic finite automata
TFPgoodNFA
- The determination of finite automata China, NFA to DFA transformation, a good source