编译原理程序，如有错误请谅解。- Translation principle procedure, if has the mistake please to forgive.

有穷自动机识别源码- Has the poor automaton recognition source code

词法分析的程序。核心函数是一个状态切换的函数 CAjaxParserDlg::Route。状态切换函数解根据一个 DFA 来对输入的文本进行分析。也就是说，如果你做一个新的DFA，就能分析新的词法。 DFA 的初始化在CAjaxParserDlg::OnInitDialog。- Lexical analysis procedure. The core function is condition cut function CAjaxParserDlg::Route. The condition cut function solution acts according to DFA to come to the input text to carry on the analysis. In other words, if you make new DFA, can analyze the new morphology. DFA initialization in CAjaxParserDlg::OnInitDialog.

一个词法分析器，实现一些简单的功能，是自己写的，现在上传上来-A lexical analyzer, the realization of some simple function, to write their own, but now upload up

一个C++函数解释器，很好用。-a C function interpreter, a good use.

本代码演示了将Lua嵌入到自己程序中的方法 -The Lua code will be embedded in a presentation to their own method of procedure

C_minus语言的BNF语法定义 程序由声明的列表(或序列)组成，声明可以是函数或变量声明，顺序是任意的。至少必须有一个声明。接下来是语义限制(这些在C中不会出现)。所有的变量和函数在使用前必须声明(这避免了向后backpatching引用)。程序中最后的声明必须是一个函数声明，名字为main。注意，C－缺乏原型，因此声明和定义之间没有区别(像C一样)。-C_minus BNF language syntax definition of procedures from the list of statement (or sequence), with a statement can be variable or function statement, the order is arbitrary. There must be at least one statement. Next is the semantic constraints (these will not arise C). All the variables and functions to be used in the statement (which avoids the use Backpatching backwards). Procedures must be the last statement is a function declaration, the name of the main. Attention C- lack of a prototype, and the definition of a statement is no difference between (the same as C).

El-Kabong: A speedy, yet forgiving, SAX-stylee HTML parser.-El-Kabong : A speedy, yet forgiving. SAX- stylee HTML parser.

lalr1编译器，网上找的，可以使用！是学习编译原理这门课程的好例子，大家下下来可以自己试一试-lalr1 compiler, for the Internet, you can use! Principle study compiled this course a good example, where you can down their test!