自己写的一个simple语言scanner，也许有些错。可作参考。

pascals编译程序源代码及说明-pascals compiler source code and explanations

采用递归下降子程序书写的编译原理关于“PL0文法”的编译器，支持词法分析语法分析目标代码生成-grammar

it is a game having the c graphics and it is a game can be played by single person

flex，词法自动生成工具，他可以在极短时间内帮助产生编译器的词法c源程序-flex, automatically generated lexical tools in a very short time he can help the compiler generate c source of lexical

用c编写的语法解析器，能进行词法和语法分析-c prepared with the parser can make grammatical and lexical analysis

1、构造该算符优先文法的优先关系矩阵或优先函数； 2、输入串应是词法分析的输出二元式序列，即某算术表达式“实验项目一”的输出结果。输出为输入串是否为该文法定义的算术表达式的判断结果。 3、算符优先分析过程应能发现输入串出错。 -1, construction of the operator the priority of the priority relation matrix grammar or priority function 2, input strings should be the output of lexical analysis of binary sequence, that is, the arithmetic expression of a

basic解释器源代码 microsoft visual studio 6.0环境下通过-basic explanation for the source code microsoft visual studio environment through 6.0

一款拥有一定历史的C语言编译器，最初为MOTOROLA 68000 开发，后来为其他一些通用处理器实现了后端，支持C99中的大部分新特性。-has some history of C language compiler, originally developed for Motorola 68000, Later, some of the other processor to achieve a common back-end, the C99 support most of the new properties.

该系统是本人课程设计作业，因为时间关系，只用了两天多的时间编成。所以有很多地方没有得到增强。版本为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

#include