16进制文件编辑与磁盘编辑软件。类似 ultraedit 的文本编辑工具，支持二进制编辑，支持比较和调整 bitwise 顺序。功能强大，支持文件在二进制级进行...

这是一个很不错的词法语法分析器! 很适合计算机专业的大学生学习参考-This a very good syntax analyzer! Computer is very suitable for professional students studying reference

c语言编写，用于c-minus语言的语法分析.-use for c-minus compile.

一个类似于写字板的程序- Is similar to writes the board the procedure

一个进行整数计算的C语言词法分析器- Carries on the integer computation the C language morphology analyzer

为了实现的编译程序实用，源程序可采用自由书写格式，即一行内可以书写多个语句，一个语句也可以占领多行书写；标识符的前20个字符有效；整数用2个字节表示；长整数用4个字节表示。这样词法分析程序的主要工作为： （1）从源程序文件中读入字符。 （2）统计行数和列数用于错误单词的定位。 （3）删除空格类字符，包括回车、制表符空格。 （4）按拼写单词，并用（种别，单词）二元式表示。 （5）根据需要是否填写标识符表供以后各阶段使用。 这里采用的编译程序的实现方法是一遍扫描，即从左到右只扫描一次源程序，也就是词法分析作为语法分析的一个子程序。故在编写词法分析程序时，用重复调用词法分析子程序取一单词的方法得到整个源程序的二元式流。 -in order to achieve the compiler practical, available free to write source code format, that his writing can be more than words, a statement can occupy multiple lines written; identifier of 20 characters effective; Integer with two byte; long integer with four byte. This lexical analysis for major work : (1) from source document read into the characters. (2) Statistics and a few mistakes out a few words for positioning. (3) delete the blank type characters, including the carriage return, tab spaces. (4) the spelling words and use (other species, words) dual ceremony. (5) whether the need for completing the table identifier subsequent stages. Here the compilers of th

此为一编译原理的课程设计大纲，在里面可以根据大纲的要求编写相应的代码-this as a compiler theory of curriculum design outline, the outline can be inside prepared at the request of the corresponding code

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

take db programme now

编译词法分析程序- Translation lexical analyaer

实现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. .