PASCAL 源程序转 C 语言源程序

词法分析器 对输入的程序进行分析，将关键字，保留字与系统标识符分开，并对其属性进行说明。 建立数组，将单词读入，对单词的ASCII码进行判断，将在ASCII码值在一定区间进行区分（使用if语句来判断），分开来后，对其所在ASCII值区间的不同，给予以不同的属性(比如：系统保留字…），词法分析器完成后要能识别+,-,=等字符。-lexical analyzer on the importation procedures for analysis, keyword, the word reservation system with separate identifier, and a description of their attributes. The establishment of an array, you read the word, the right word ASCII judgment, in ASCII value in a certain area and distinguish between (use to determine if statements), separately, its value lies ASCII range of different, to give a different properties (such as : system retain the word ...), after the completion of a lexical analyzer to identify,-, =, etc. characters.

补充一个tc20英文版的编译器- Supplements a tc20 English version the compiler

手工完成C语言编写的C-词法分析器，列出源代码以及提取出的token串-Manually written in C language C-lexical analyzer, listing the source code, and extract the token string

词法分析,pascal语言-lexical analysis, language pascal

it is used to solve the matrix problem easily.having the good interface -it is used to solve the matrix problem easily.having the good interface ...

小型的Basic解释程序,能够将Basic源文件解释执行-small Basic explain procedures can be explained Basic source implementation

编译原理中的First集与 Follow集生成程序，这是我用C＋＋语言写的，希望对大家有点用处。-Compiler Principle of First Set and Follow procedures set generation, which is my C++ languages, we hope to somewhat useful.

这是一个编译原理中的扫描字符串的程序！希望能与大家分享-This is a Compilation Principle of the scanning procedure string! Like to share with Members

词法分析器 可以识别c++的源码,自动生成词法分析表, 在分析结束后会指出源代码中可能的错误 待分析的源代码要以 *源代码.txt的格式保存-Lexical analyzer can identify c++ The source, automatically generate lexical analysis table, after the end of the analysis will be pointed out that the source code may be an error to be analyzed the source code to source code*. Txt format save

解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carries on the root to spread the calendar regarding this, after then obtains decorates the type