教你怎样使用ＶＩ编辑器，没有解压密码，很不错

词法分析的浏览单词程序，很不错的。支持哦！-Lexical Analysis of browsing word process, very good. In support of Oh!

编译原理small语言的编译程序- Translation principle small language compiler

一个用C#编写的解释器，内附完整的实现过程以及源代码。-A used C# Prepared interpreter, enclosing the complete realization of the process, as well as source code.

PL/0语言可以看成PASCAL语言的子集，它的编译程序是一个编译解释执行系统。PL/0的目标程序为假想栈式计算机的汇编语言，与具体计算机无关。-PLO

一个小型C语言编译器，支持多架构，包括i386，ARM，mips等-A small C language compiler, support multi-architecture, including the i386, ARM, mips, etc.

基于从C++开发的一个LL1文法分析器，内付源码，源码中还有一定的注释-from C-based development of a LL1 grammar analyzer, which paid source, there still is a certain source of the Notes

简单的使用mfc开发的程序。- Simple use mfc develops procedure.

很好用的语法分析器。-good with the parser.

1、输入串应是词法分析的输出二元式序列，即某算术表达式“实验项目一”的输出结果。输出为输入串是否为该文法定义的算术表达式的判断结果。 2、LL(1)分析过程应能发现输入串出错。 3、设计两个测试用例（尽可能完备，正确和出错），并给出测试结果。 -1, input strings should be the output of lexical analysis of binary sequence, that is, the arithmetic expression of a

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