拿出这个程序来主要是因为原文中只有一个LEX程序,

C51编译器的一些优化设置资料，对初学者有些帮助，分享了给大家愿共同进步！-C51 compiler optimization settings some information, some help for beginners, to share to the U.S. is willing to make progress together!

一个简单的编译器，具有词法，语法，语意全部功能-A simple compiler, with lexical, grammatical, semantic full functionality

编写一个C语言的子集的词法分析程序，对C语言源代码程序进行扫描，识别简单语言的基本字、标识符、无符号整数、运算符和界符等单词符号，产生的单词转换成特别码表示，形成word文件（单词序列）保存。-CCwordSequence) preservation.

C语言编写的简单计算程序的语法分析器，可以识别一定的计算功能-C language prepared by the simple calculation procedure syntax analyzer can identify certain computing capabilities

是关于算术表达式的翻译程序，有词法分析，语法分析，语义分析和三地址码生成-it is a program which is to translate the compute expression.it contains accidence analysis,gramar analysis ,lexeme analysis and three-addr code grenerate.

这是编译原理里面用来判断输入的东西是是否是符合数学运算公式-This is the compiler used to determine the principle of which is whether the importation of things are in line with the mathematical formula

一个编译器的实现，是编译原理这门课的期末一个大作业-The realization of a compiler is the compiler of the principle of the course at the end of a big operation

一个Modula-2语言分析器-A Modula-2 language analyzer

编译原理的源代码，涉及了编译原理的各个过程：词法分析，LL1语法分析，语义分析，中间代码生成，中间代码优化（常表达式优化，公共表达式优化，循环不变式优化），中间代码生成目标代码，目标代码的解释执行，详-compiler source code, the compiler principles involved in various processes : lexical analysis, LL1 syntax analysis, semantic analysis and code generation and code optimization (regular expression optimization, public expression optimization, optimization loop invariant), intermediate code generated object code target code enforcement explained in detail

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