词法分析―分析关键字，运算符，常数并用动态链表保存结果...

2500AD X8051汇编语言编译器连接器使用说明-2500AD X8051 assembly language compiler for use connectors

输入已经消除左递归的以及提取公共左因子的LL(1)文法，再输入相应的表达式，若分析成功，则在递归输出过程中输出"acc",若不成功，则有相应的报错以及位置指名。注意，要把同一个非终结符的产生式分成单个输入。他会自动计算first,follow,预测分析表的构造，但并不输出。-importation has been eliminated and left recursive public from the left-LL (1) grammar, further importation of the corresponding expression, if the analysis is successful, the output of the recursive process output "belongs", if successful, there were errors and the corresponding location named. Attention, we should end with a non-escalation of production into a single input. He will be automatically calculated first, follow, and predicting and analyzing the table structure, but does not export.

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.

对给定的文法消除左递归。- To the grammar which assigns eliminates the left recursion.

从正规式到有限自动机及确定的有限自动机的化简。-from the formal ceremony to Finite Automata and the limited automatic machine simplification.

一个类c++语言解释器，由一位国外c++大师所作，喜欢脚本脚本语言的可以-a Class C language interpreter, by a master of his foreign c, like the script scripting language can s

这是一个用VHDL语言写的分频程序,可用得着-This is a VHDL language used to write the sub-frequency procedures, can be useful

使用LEX/YACC 编写的计算器程序 在VC环境下使用-The use of LEX/YACC calculator program written in VC environment

1、给出各单词符号的类别编码。 2、词法分析程序应能发现输入串中的错误。 3、词法分析作为单独一遍编写，词法分析结果为二元式序列组成的中间文件。 4、设计两个测试用例（尽可能完备），并给出测试结果。 -1, given the various types of code word symbols. 2, lexical analysis procedure should be able to detect errors in the input strings. 3, again as a separate lexical analysis prepared for morphological analysis of binary sequence consisting of between documents. 4, the design of the two test cases (as far as possible, complete), and gives test results.

回来组装最强大的java代码JAR或类，比DJu javau反编译器真的要还原整个包了