Recursive descent parser recursive recursive descent parser drop grammar parser...

求正规表达式到NFA（不确定的有限自动机），NFA到DFA及DFA（有限自动机）的最小化 有注释。-seek formal expressions of the NFA (uncertain Finite Automata), the NFA to the DFA and DFA (finite state machine) is the smallest of the Notes.

oye,不知道哈布，不好就算了，谢谢哈-oye, not knowing Shihab, not even a thank Kazakhstan. .

无解压密码,这是一个编译原理的实验源码,已经编译成功能实现读无符号数了.-without extracting passwords, it is a principle of experimental compiler source code, compiler can achieve success without reading a few symbols.

没什么的 只是一个普通的编译原理的实验程序-it doesn t matter,it is a ordinary test program of complier pronciple

强大的内存调试工具，主要用来跟踪调试内存的情况。-powerful memory debugging tools are mainly used for tracking the memory debugging.

ll(1)语法分析器-ll (1) parser

实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA 　N一定存在一个DFA　Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .

语法分析 语法分析- The grammar analysis grammar analysis grammar analyzes

一个简单的词法分析程序 ，输入一个txt文本，可以将里面的关键字等信息输出显示-A simple lexical analysis program, enter a txt text can be keywords and other information inside the output display

语法分析器 能够对输入的数据进行判断 进行分析 判别输入字符串的各种信息