Jode Decompiler.安装方法：点击Eclipse的Help菜单

输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end;* Closure; , And set; To complement the set; E, empty string; O, empty set procedures will then generate the corresponding NFA, and the simplification of the DFA after finally lose into a string, procedures judgment whether it is to meet the regular expression

逆波兰试的翻译程序， 是我的程序作业 - Goes against the Poland trial interpretive program, is my procedure work

逆波兰式表示法的生成程序，挺好的！实现了从中缀向后缀的转变-Reverse Polish Notation notation generation process, quite good! Realized the transformation from infix to suffix

XML解析源代码expat2.01版,lib目录能用于C++代码中-XML source code analysis expat2.01 version, lib directory can be used to C++ Code

赋值语言翻译(C++)源代码＋详细的课程设计报告 定义赋值语句；分析出翻译中要解决的问题；明确翻译错误的表达以及处理-Assignment language translation (C++) Source code report detailed the definition of curriculum design assignment analysis of translation problems to be solved clear expression of a translation error, as well as treatment

这是一个vc++环境下运行的编译原理的词法分析源程序，可以在vc++环境下直接运行，其中有运行的截图，学校要求做实验报告，给和我一样要交报告的人。-This is a vc environment compiler running under the principle source of lexical analysis, the vc direct operating environment, which is running the screenshots, the school asked to do experiments, and I like to have to pay the people.

编译原理课程设计，输入布尔表达式，然后有系统自动转换为逆波兰四元式-compiler theory of curriculum design, the importation of Boolean expressions, and then the system automatically converted to reverse Poland four yuan-

本程序包括详细的词法分析，语法分析，语义分析和中间代码生成，写得很不错，可读性很强。是关于循环语句的翻译-this procedure include a detailed analysis of the morphology, syntax, semantic analysis and intermediate code generation, very good, very readable. On the loop is the translation

介绍了一种串行LDPC码的编码器和译码器的实现形式 C++环境下编写。有些地方还需完善，请各位帮忙指正。-introduces a serial LDPC encoder and decoder of C forms prepared environment. Need to improve in some areas, please correct me help you.

LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只需向右看一个符号便可决定如何推导，即选择哪个产生式(规则)进行推导。 LL(1)文法的判别需要依次计算FIRST集、FOLLOW集和SELLECT集,然后判断是否为LL(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.