(1)构造文法G的LR(0)项目 (2)构造文法G的LR(0)项目集规范族及识别活前缀的DFA (3)证明文法G不是LR(0)文法而是SLR(1)文法，...

java实现的一个pascal编译器，可以运行。-achieve a pascal compiler can run.

这是LL(1)的一个文法和 分析表 很好的 - This LL (1) a grammar and the analytical table are very good

C编译器源码是我到处找来的,看了之后很有收获-C compiler source is found everywhere, and found the great harvest

算术表达式词法和语法分析程序,递归下降法,四元式-Arithmetic expression lexical and syntax analysis, recursive descent method, type Quaternion

词法分析程序设计 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

没什么的 只是一个普通的编译原理的实验程序-it doesn t matter,it is a ordinary test program of complier pronciple

delphi编的pl0编译器-delphi arranges pl0 compiler

编译原理的词法分析程序-compiler tenets of lexical analysis procedure

实现一个C程序下的词法分析,简单实用,不需要添加任何代码,就可执行,可在DOS或WIN下的各个版本的C程序编辑器下执行-achieve a C program under the lexical analysis, simple and practical, do not need to add any code can be implemented, in DOS or WIN under the various versions of the C program under Executive Editor

LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只需向右看一个符号便可决定如何推导，即选择哪个产生式(规则)进行推导。-LL (1) grammar using a set top-down analysis techniques. LL (1) the meaning is: the first one L shows a top-down analysis is a scan input string from left to right, the first two L shows the analysis process will be the most left-derivation, one that will be just right to see a sign can decide how to derive, choose what Production (rules) for derivation. LL (1) grammar, followed by calculation of the discriminant needs FIRST sets, FOLLOW sets and SELLECT set, and then determine whether to LL (1) grammar, the last sentence further analysis.