一个词法分析器，实现一些简单的功能，是自己写的，现在上传上来...

正规(则)表达式转化为NFA，DFA，DFA最小化，显示结果和过程-Formal (then) regular expressions into NFA, DFA, DFA minimization, and process the result will be displayed

一个自动字符处理类- An automatic character processing class

是用flex分析pl0源代码的程序，统计处其中所有的关键字和变量名称，这个rar文件中有readme，具体见其中的说明。另外还有2个测试文件ceshi1.pl0和ceshi2.pl0-is flex pl0 source code analysis procedures, the Census and Statistics Department in which all the keywords and variable names, the rar a readme file, as shown in the note. Another two tests and documents ceshi1.pl0 ceshi2.pl0

解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carries on the root to spread the calendar regarding this, after then obtains decorates the type

fish小程序 -fish applet applet fish

基于libboost_regex的正则表达式测试程序，可用于入门者的参考代码。-Libboost_regex regular expression-based test procedure can be used for a reference code for beginners.

本程序集是Allen I. Holub所写的《Compiler Design in C》一书的附随软件，其中有作者自己编写的词法分析和语法分析工具LeX，occs和LLama，该软件包还包括一个显示C语言分析过程的程序-This set of program is the attached software in 《Compiler Design in C》 writed by Allen I. Holub, it contains the Lex, occs and Llama which are phraseing analysis tools writed by Allen, it also contains a program which can display the analysis procedure of C

实现登录，可以自由相应的登录方式接受编码-To achieve log free to log on to receive treatment the corresponding coding

flex 词法分析器 识别token单元-syntax analysis

本课程设计采用C语言进行编译原理实现课题有限自动机的应用，其目的如下：(1) 理解有限自动机的作用；(2) 利用状态图和状态表表示有限自动机；(3) 以程序实现有限自动机的运行过程-courses designed using the C language compiler principles to achieve automatic machine issues limited the application of its purpose as follows : (a) limited understanding of the automatic machine; (2) using state map and the table, said state finite automata; (3) limited to procedures to achieve automatic machine Win OK process