编译原理的课程设计，if

我的词法分析程序- My 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. .

音频信号发生器 - Tonic train signalling generator tonic train signalling generator

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

语法分析器 完成从c/c++向C++转变-parser from complete c/c to C change

编译原理程序,请多指教。- The translation principle procedure, please much advises.

这是个简单的语法分析器程序,输入一个表达式,会给出一个分析过程.-This is a simple procedure syntax analyzer, the importation of an expression, is an analytical process.

5509开发板测试程序,通过观测XF引脚是否有方波来初步估计试验板硬件是否有问题-5509 development board testing procedures by observing whether XF pin-square test to preliminary estimates plate hardware is there a problem

#include "define.h" #include #include #include #include FILE *fp /*////////////////////////////////////////////////////////////////////////////// This is a pretreatment. /////////////////////////////////////////////////////////////////////////////*/ void readIntoBuffer(char buffer[256]) { char ch1 char temp int i for(i=0 i

一个小计算器的实现(编译原理),用Lex和bison-Realize a small calculator (Principle compiler), with Lex and bison