LL(1)文法源代码

一个C的词法分析程序- A C lexical analyaer

学了编译原理之后写的一个小的词法兼语法分析程序，vc6.0开发的，有界面，不过功能比较简单，仅供参考-Compilation Principle have learned to write after a small grammar of lexical and analytical procedures, vc6.0 developed has interface, but relatively simple function, for reference only

El-Kabong: A speedy, yet forgiving, SAX-stylee HTML parser.-El-Kabong : A speedy, yet forgiving. SAX- stylee HTML parser.

simple语言的词法和语法分析，包括token串的填写，符号表的填写，四元式的生成 -simple language morphology and syntax analysis, including token strings fill in, fill in the symbol table, the generation of type Quaternion

一个简单的编译器，有词法分析，语法分析，代码生成-a simple compiler, lexical analysis, grammar analysis, code generation

这是一个编译递归子程序，通过输入语句可以判断是否由指定文法推出-This is a recursive routines compiled by the input to determine whether statements can be specified by the grammar launched

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

编译与调试技巧源代码:qprofile_src-compile and debug source code skills : qprofile_src

USB接口的VHDL源码，支持Verilog HDL程序-USB VHDL source code, supports Verilog HDL procedures

加速度信息采集程序.主要是通过界面显示物体移动的信息采集。-Accelecer information program very useful