使用Java语言实现Small Basic语言解释器。包括两个主要的子系统：一个是表达式解释器，负责处理数字表达式；另一个是解释器，负责程序的实际执行。...

通信传输系统中的PCM编码解码方式。matlab实现。-Communication System PCM codec mode. matlab achieve.

这是一个用VF6.0编的《编译原理》课程设计报告.rar-This is a series with VF6.0 "compiler theory" course design report. Rar

oye,不知道哈布，不好就算了，谢谢哈-oye, not knowing Shihab, not even a thank Kazakhstan. .

一个非常好的公式解析控件，没见过比这好的，支持自定义变量。为了上此站，才第一次拿出来-a very good formula Analytical Controls and have never seen than this good support from the definition of variables. To this point on, the first time out

K-nearest neighbor classifier (k-NN) is a nonparametric approach for classification. It does not require the priori knowledge such as priori probabilities and the conditional probabilities. It operates directly towards the samples and is categorized as an instance-based classification method.

是有关编译原理的,可以自动对输入的??分析,生成first集和follow集-The principle is the compiler can automatically entered?? Analysis, generated first set and follow set

递归下降语法分析-decline recursive grammar analysis

智能的词法分析 ，能任意输入正则表达式，能求出NFA，DFA，minDFA,和最后的匹配情况-Lexical analysis of intelligence, can enter any regular expression can be obtained NFA, DFA, minDFA, and the final match of the situation

GNU的词法/语法分析器bison源码，最新版本bison-2.1-GNU/parser bison source, the latest version of bison- 2.1

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.