算符优先语法分析器.

一个简单的词法分析器，1代表字符，2代表关键字（命令字），4带表算符界符， 注：要把wangs.txt这个文件放在桌面上，然后在这个TXT里写上你要识别的语句。然后保存后关毕，在运行WANG词法分析.EXE进行词法分析。 完成识别后，会在相应的词面前出现以上代号。暂不能对数字进行识别。因为在某种请况下数字也可表是为字符……稍有困难，但完成老师的针对程序段：area=b+c*d。那简直是小菜一碟。-a simple lexical analyzer, a representative character, the two representatives keyword (command word), with four tables operator sector website Note : The wangs.txt the document on the desktop, then the TXT Lane write you to identify words. Then preserved customs Albert, running WANG lexical analysis. EXE for lexical analysis. After completing the identification, in the appropriate words appear in front of the above code. Provisional figures for the right not to identify. Because of the status of requests under certain figures might be for the characters ... the slightest difficulty, but the completion of procedural teachers : area = b, c* d. It is simply to touch.

国防工业出版社的编译原理的词法分析器的编制的c语言原程序-defense industry publishers compile the lexical analyzer principle the establishment of procedures for the original language c

语法分析器，对已给pascal语言文法，构造LL(1)分析表，编制语法分析程序，要求将错误信息输出到语法错误文件中，并输出分析句子的过程-Parser that have been to the pascal language grammar, structure LL (1) analysis table, the preparation of parsing procedure that requires the output to the error message syntax error file, and output analysis of the process of sentence

自己写的一个C子集的编译程序，包括源码和说明文件，以及文法的扩充BNF表达式-himself wrote a subset of the C compiler, including source code and documentation, and the expansion of BNF grammar expression

编译原理课程实验，包括词法分析器和语法分析器-Compilation Principle experimental courses, including the lexical analyzer and parser

这是我同学做得编译原理――词法分析器，有读源文件，和写目标文件-This is the principle of my classmates to do the compiler- lexical analyzer source file has read, and write the destination file

编译原理的词法分析器，语法分析器(包括递归子程序，算符优先，LR类分析法)，语义分析等原理图-compiler tenets of lexical analyzer and parser (including recursive subroutines, operator precedence, LR type analysis), semantic analysis diagram

这个语法分析器用到的是自顶向下的递归调用的方法，根据Cminus语言的文法规则 的BNF范式编写递归调用的代码，parse方法是程序的入口，它调用的stmt_sequence完成整个语法分析工作，stmt_sequence背后是12个互相调用的方法，它本身也在语法分析的过程中被调用到。 每个方法在最后会返回一个构造好的节点DefaultMutableTreeNode节点t给调用它的方法，然后调用它的方法用这个返回的节点继续构造，最后语法分析完成后会返回一棵完全构造好了的树节点，然后将这个树节点作为根节点生成一个树控件JTree显示到窗体程序上 -CMM 　parser

编译原理---正则表达式到DFA的演示程序- Translation principle--- regular expression to DFA demonstration program

陈火旺《编译原理》课后习题答案，是第三版的答案-Chen Huo-wang, " Compiler Principle" Exercise after-school answer, the answer is the third edition of