PL/0教学语言的编译程序原代码。-PL/0 teaching language compiler original code.

实现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. .

this is about a script

一个简单的解析器，可以对四则运算和if语句进行解析，利用简单扫描的方式词法解析，和压栈方式解释运算，可以帮助学习编译原理-a simple parser can be four operators and if statements for the analysis, simple scanning the lexical analysis, and interpretation Yazhan Operators can help compiler theory

regex-spencer-3.8-src.zip

一个简单的编译源程序-a simple compiler source

C语言编写的cminus语言语法分析器，采用递归下降方法-Cminus written in C language parser, using recursive descent method

自定义简单语法类C语言编译器，具备识别C语言基本语句功能，并生成四元式-Since the definition of simple types of C language syntax compiler, a statement to identify the basic functions of C language and generate quaternion type

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

按照清华大学的教材，自己用C++做的一个小的哈夫曼编码器-materials they used to do a C minor Huffman encoder