词法分析器，是课设的题目。比较简单，下来就可以用了。-Lexical analyzer is the subject of class-based. Relatively simple, it can be used.

此程序可以把编译原理中的不确定的有限自动机确定化，是编译中课程设计的内容-this program can build on the principle of uncertainty to determine finite automata, which is to compile the contents of the curriculum design

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

学生信息注册系统，数据库是ACCESS！-Student Registration information systems, databases are ACCESS!

ogtalk是一种面向对象的逻辑编程语言，可以使用最Prolog的实现作为一个后端编译器。 -ogtalk is a logic of object-oriented programming language, you can use most Prolog realization as a back-end compiler.

广州公交车线路查询- The Guangzhou public transportation vehicle line inquires

C-MINUS编译器，一个很不错的编译原理实践成果-C-MINUS compiler, a very good practice to compile the results of the principle

用C++实现编译原理的递归下降语法分析 用C++实现编译原理的递归下降语法分析-C compiler to achieve the principle of recursive grammar analysis dropped C compiler to achieve the principle of recursive grammar analysis drop

m68k系列反汇编的C语言源码,供学习编译原理的同学使用。实用！-m68k series compiled by the C-language source code, the compiler theory for studying the students to use. Practical!

编译原理练习题与答案主要是词法分析、语法分析、中间代码等相关习题与答案.-compiler theory and practice that the answer is lexical analysis, parsing, intermediate code, and other related exercises with answers.