此为编译原理的实验,与大学生本科生的教学内容相近,十分有用...

max-log-map算法的C语言的实现，能计算出所需要的LLR，做出软判决和硬判决。-max-log-map algorithm for the realization of the C language, can be required to calculate LLR, make a hard decision and soft decision.

编译原理课程设计布尔表达式输出逆波兰式运用ll(1)法-Course Design Compiler Principle output Boolean expressions using inverse Polish ll (1) Act

相位测量仪的几种方案设计，可供参考，如有需要，就快快下吧-Phase-measuring instrument designed several programs available for reference, if necessary, as soon as possible, are you on

第一次哦，不好不说哦，不好怪自己哈 。-first Oh, oh, not bad, not blaming themselves Kazakhstan.

算符优先语法分析器.-operator priority parser.

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

一个SQL解析器- A SQL analysis

这个是一个嵌入式脚本支持引擎, 体积十分小巧-This is a built-in scripting support engine, very compact size

一个带界面的词法分析器～～界面比较简练友好，适合初学者使用-An interface with a lexical analyzer ~ ~ more concise and friendly interface, suitable for beginners to use ~~~~~

ll(1)语法分析器-ll (1) parser