是有关解释器的.用JAVA编写.可以解释一般的JAVA程序.

反编译专家，很好用的。支持右键，支持文件夹反编译-Decompile expert, well used. Support the right to support decompile folder

c―语言的句法分析器。读入一个C--语言程序，判断该程序是不是一个合法的C--语言程序-c-language parser. Reading into a C-- Language Program, the judgment that the procedure was not a legitimate C-- Language Program

计算所汉语词法分析系统ICTCLAS.分词正确率高达97.58%(973专家组评测)，未登录词识别召回率均高于90%，其中中国人名的识别召回率接近98%处理速度为31.5Kbytes/s。ICTCLAS的特色还在于：可以根据需要输出多个高概率结果，有多种输出格式，支持北大词性标注集，973专家组给出的词性标注集合。-Calculate the Chinese Lexical Analysis System ICTCLAS. Segmentation correct rate of 97.58 percent (973 Expert Group on Evaluation), the recall rate of identification of unknown words were higher than 90 percent, of which China s name to identify the recall rate of nearly 98 percent processing speed for 31.5Kbytes/s. Also features ICTCLAS is: can output a number of high probability that there are a variety of output formats, to support the North-of-speech tagging sets, 973 expert group is given a collection of-speech tagging.

PL/0分析程序-PL/0 analytical procedures

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写的词法/语法分析器。可生成JAVA语言或者是C++的词法和语法分析器。并可产生语法分析树和对该树进行遍历 -Syntactic and phrase parser in JAVA which can produce JAVA or C

c 的 词发分析程序我现在在学编译原理 想找点东西学 请多关照-c word fat analysis program at school I now depending compiler theory learning the news conference for the

LEX程序 用来生成词法分析器-LEX procedure uses for to produce the morphology analyzer

武汉理工大学编译原理课程实验源代码之词法分析器-Wuhan Polytechnic University Experimental compiler theory"s source code lexical analyzer

实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA 　N一定存在一个DFA　Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .