搜索资源列表
bianyiyuanli.rar
- 编译原理实验中词法分析器和语法分析器的实验报告（附源代码）,Compile principle experiment lexical analyzer and parser of the lab report (with source code)
YUFA
- 语法分析器,输出分析的结果对或者错。编译原理的课后实验题，pascal语言的语法分析器。-Parser, the output results of the analysis right or wrong. After-school experiment of compiler theory, pascal language parser.
sy1new
- 编译原理的LR分析表源码，描述语法分析器的构造，语法制导翻译和中间代码生成-Compilation Principle source of LR analysis table describes the structure parser, grammar-guided translation and intermediate code generation
yufa
- 用预测分析法实现自上而下的语法分析器（编译原理）-Using predictive analysis method to achieve a top-down parser (compiler principle)
programming
- 编译原理课程设计，内含词法分析器和语法分析器。-Principles of curriculum design, compilation, containing the lexical analyzer and parser.
yufafenxiqi
- 编译原理课程实验 语法分析器 LL（1） C++ 收集的材料代码完整-Compile Principle experimental parser LL（1） C++ Code integrity of the material collected
source
- 编译原理课程设计报告，语法分析器源代码实现-Compiler theory curriculum design report parser source code implementation
CMINUS
- 编译原理及编译原理实践中的课程设计Cminus词法语法分析器-Compiler theory and practice of compiler theory curriculum design Cminus syntax analyzer
project4
- 基于递归向下方法实现的C-语法分析器，编译原理课程设计-Down approach based on recursive implementation of C-parser, compiler theory of curriculum design
project4LL(1)
- 基于LL(1)实现的C-语言语法分析器，编译原理课程设计-Based on LL (1) to achieve a C-language parser, compiler theory of curriculum design
CompilerLab3
- 编译原理的语法分析器，可以直接运行，是实验课项目-Parser compiler theory can be directly run experimental class project
Recursive-descent-parser
- 此源码是编译原理中对“递归下降法的语法分析器“的设计-This principle is to compile the source code for " recursive descent parser" design
ex2
- 编译原理实验，实现递归下降语法分析，比较简单的小程序(Compiler theory experiments, recursive descent syntax analysis, relatively simple procedure)
实验2
- LL1文法分析器，可以识别LL1文法，求出first集与follow集，生成分析表。(LL1 grammar analyzer, you can identify the LL1 grammar, find the first set and follow set, generate an analysis table.)
语法分析器
- 该程序使用的自上而下的LL（1）分析法，，该文法不允许左递归，首先要消除左递归。(The program uses the top-down LL (1) analysis method, which does not allow left recursion, and the left recursion is first eliminated.)