编译原理实验中的实验指导书，详细介绍了实验环境设置等，和详细源码...

用vc编写的一个词法分析源程序，可以对输入的C语言语句进行种别分类-vc prepared with a lexical analysis of the source, can be imported to the C language statements for other species classification

编译原理课程设计,包括词法分析，语法分析，目标代码优化的编译器,希望大家提出意见-compiler theory of curriculum design, including lexical analysis, grammar analysis, the objectives of optimizing code compiler, we hope that the views

用C++实现编译原理的递归下降语法分析 用C++实现编译原理的递归下降语法分析-C compiler to achieve the principle of recursive grammar analysis dropped C compiler to achieve the principle of recursive grammar analysis drop

该系统是本人课程设计作业，因为时间关系，只用了两天多的时间编成。所以有很多地方没有得到增强。版本为1.0。现作以下升级。 增加NEW，OPEN版本。 提高输入容错。判断输入的对错。 时间关系，搜索功能为线性搜索，现增强如下：f_search:费氏查找法；btree:二叉树查找法；l_search：线性查找法； r_search：递归折半查找法；zcsear:杂凑碰撞查找法；o_sear:插补查找加强法； 排序是冒泡法，现增强为：heaps:累堆排序；binary：二叉树排序；xieer：谢耳排序；sinsert：插入排序；quicks:快速排序；select:选择排序法； 有时间不仿试试。-f_search: Find Act Fernandez btree: binary tree search method l_search: linear search method r_search: Recursive half Find Law zcsear: Find a hash collision law o_sear: interpolation search Enhancement Act sort is bubbling method are enhanced for: heaps: HEAPSORT tired binary: binary tree sort xieer: Xie ears sort sinsert: Insertion Sort quicks: quick sort select: Select Sort Method

小写字母转换为大写字母,flex源码，c程序-Lowercase letters converted to uppercase letters, flex source code, c program

该编译器对表达式可实现词法分析,语法分析,语义分析-The compiler can be realized on the expression of lexical analysis, syntax analysis, semantic analysis

一个子集的词法分析器。输入程序，输出TOKEN串各符号表，并存入文件。-A accidence analyzer of subset. which can inpute TOKEN cluster and save if you inpute program

词法分析程序，很初级的，我们刚刚开编译原理- Lexical analyaer, very primary, we just opened the translation principle

pascal的编译器 交作业没问题 -perpendicular operation of the compiler no problem Haha

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.