一个写得很不错的C编译器，供需要写编译器的人参考一下。

词法分析程序，这是一个词法分析程序，是在编译原理课编写下来的，经过多次修改。还能够分析对10+9e这样的单词。比较全面-lexical analysis, this is a lexical analysis procedure is compiled in principle prepared from the lesson, after several revisions. Also to analyze 10 9e of the word. More comprehensive

词法分析程序设计 1、给出各单词符号的类别编码。 2、词法分析程序应能发现输入串中的错误。 3、词法分析作为单独一遍编写，词法分析结果为二元式序列组成的-Lexical analysis program design one, given the various types of code word symbols. 2, lexical analysis procedure should be able to detect errors in the input strings. 3, again as a separate lexical analysis prepared for morphological analysis of binary sequence composed of

小型编译系统的源代码-small build system source code

类pascal的词法分析设计，内容详细。 这是我老师的教案，我看内容较全，希望对您也有帮助！- The kind of pascal lexical analysis design, the content is detailed. This is my teacher teaches the document, I looked content comparatively entire, hoped also has the help to you!

输入已经消除左递归的以及提取公共左因子的LL(1)文法，再输入相应的表达式，若分析成功，则在递归输出过程中输出"acc",若不成功，则有相应的报错以及位置指名。注意，要把同一个非终结符的产生式分成单个输入。他会自动计算first,follow,预测分析表的构造，但并不输出。-importation has been eliminated and left recursive public from the left-LL (1) grammar, further importation of the corresponding expression, if the analysis is successful, the output of the recursive process output "belongs", if successful, there were errors and the corresponding location named. Attention, we should end with a non-escalation of production into a single input. He will be automatically calculated first, follow, and predicting and analyzing the table structure, but does not export.

LL（1）分析 写的语法分析程序，但是不能实现消除左递归，提取公因子-LL (1) analysis of written grammar analysis program, but can not eliminate the left recursion, extracting common factor

斯坦福大学操作编译器课程讲义(cs143) stanford university compiler course-stanford university compiler course

一款编译器，针对vb，英文版。本程序包括详细的词法分析，语法分析，语义分析和中间代码生成，写得很不错，可读性很强。是关于循环语句的翻译-new compiler, against vb and English. The procedures include detailed lexical analysis, grammar analysis, semantic analysis and intermediate code generation, very good, very readable. On the loop is the translation

一个程序，用于判定给定的文法是否为算符优先文法。 实现了：1．文法的机内表示；2. FIRSTVT集和LASTVT集的计算； 3. 算符优先关系矩阵的构造。-a procedure for the determination of grammar to whether the operator priority to grammar. Realized : 1. Grammar said the machines; 2. LASTVT FIRSTVT sets and set computing; 3. Operator precedence relations of the matrix structure.

PKU_1205 水处理厂输送水的问题，考虑沿岸城市(水处理厂)的数量，程序能确定输送方式的种数-PKU_1205