读一组

一个程序，用于判定给定的文法是否为LL（1）文法。 实现了：1．文法的机内表示；2. FIRST集和FOLLOW集的计算； 3. LL（1）预测分析表的构造。-a procedure for the determination of grammar to whether LL (1) grammar. Realized : 1. Grammar said the machines; 2. FIRST FOLLOW sets and set computing; 3. LL (1) Forecast and Analysis table structure.

动态哈夫曼编码-Dynamic Huffman coding

这是一份实验报告，目的是掌握YACC的使用方法，了解YACC处理二义性的方法。 用YACC等工具生成如下文法表示的表达式对应的计算器 exp->exp + exp | exp - exp| exp * exp |exp / exp |exp ^ exp | - exp |(exp) |NUM 对于输入的表达式，能输出结果。比如: 3 +(4 *5)结果应为23 当出现错误时可以进行错误处理。 -This is a test report, the purpose is to master the use YACC to learn YACC handling of the ambiguity approach. Using tools such as YACC grammar that generates the following expression for the corresponding calculator exp-> exp+ exp | exp- exp | exp* exp | exp/exp | exp ^ exp |- exp | (exp) | NUM expression for the input type, can be output. For example: 3+ (4* 5) the result should be 23 when the error can be error-handling.

Compiler Type Check & Scope Check

FFmpeg output_example.cpp的源代码。-The code of output_example.cpp belongs to FFmpeg.

Quick Basic DOS Compilers

在实验三所给文法中加上语义动作，使其在语法分析的同时，产生相应的四元式序列-In the experiment three to add semantic actions to the grammar, so that in parsing the same time, resulting in a corresponding quaternary-type sequence

用 c++写的编译器， 只有语法和词法- Compiler writes which with c, only has the grammar and the morphology

一个flex和bison用法入门的很好的例子。　按照词法分析,语法分析,语义分析的顺序来熟悉flex和bison这两个有力的工具。最后给出了一个用flex做词法分析用bison做语法分析设计的科学计算器（不同于一般程序设计中的入门级计算器），是学习编译原理的很好的例子。-a flex and bison portal usage of a very good example. According lexical analysis, parsing, Semantic analysis of the sequence to flex and bison familiar with these two powerful tool. Finally, a use flex do lexical analysis bison do syntax analysis and design of scientific calculators (unlike General Program Design"s entry-level calculators), compiler theory is the study of good examples.