This is a VHDL language used to write the sub

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

编译原理的作业 编译器- Translation principle work compiler

词法分析,pascal语言-lexical analysis, language pascal

AtScript 1.1 一个很好用的脚本引擎,可以很方便的在你的软件中实现脚本功能,支持用户扩展对象-AtScript 1.1 script with a good engine, can be very convenient in your software realize the script function, support the expansion of the target users

反编译最新工具 反编译最新工具 反编译最新工具-TOOS

简单basic语言编译器-simple basic language compiler

这几天做编译的课程设计,只做了词法分析部分,感觉很不错!-these days do a translation of the curriculum design, doing some of the lexical analysis, I feel very good!

PASCAL 源程序转 C 语言源程序-PASCAL C language source to source

search function through linked list using binary search method

一个很号用的词法分析程序，望能对想熟悉编译原理的同仁有一定的帮助，谢谢支持-one of the very lexical analysis procedures can look familiar to colleagues compiler theory can help, thank you support