搜索资源列表
bnf
- BNF 递归下降语法分析器 文法: E->E+T|T T->T*F|F F->(E)|i-BNF recursive grammar decline parser : E -
tcc-0.9.23
- Tiny C Compiler - C scr ipting Everywhere - The Smallest ANSI C compiler Installation on a i386 Linux host (for Windows read win32/readme.txt) ./configure make make test make install By default, tcc is installed in /usr/local
LRYF
- 对下列文法 E->E+T|T T->T*F|F F->(E)|i LR(0)分析程序 -the following grammar E -
rs-codec-8-4
- encode.v The encoder syndrome.v Syndrome generator in decoder berlekamp.v Berlekamp algorithm in decoder chien-search.v Chien search and Forney algorithm in decoder decode.v The top module of the decoder inverse.v Computes multiplic
IR_RX
- Infra Red Received coding for received 8 bit address and data code-Infra Red Beijing coding for received eight bi t address code and data
uc-tokens10
- Using the UnderC Tokenizer Class It s often necessary to parse complex text files, where standard i/o is too clumsy. C programmers fall back on strtok(), but this can be tricky to use properly. Besides, you are still responsible for keeping
LL(1)yufafenxi
- *--- --- --声明--- --- -----*/ /* VC6.0下运行通过 此程序为本人苦心所做,请您在阅读的时候,尊重本人的 劳动。可以修改,但当做的每一处矫正或改进时,请将改进 方案,及修改部分发给本人 (修改部分请注名明:修改字样) Email: jink2005@sina.com QQ: 272576320 ——初稿完成:06-5-27 jink2005 补充: 程序存在问题: (1) follow集不能处理
VC-yu-yin
- The ITU-T(Telecommunication Standardization Sector)is a permanent organ of the International Telecommunication Union(ITU).The ITU-T is responsible for studying technical,operating and tariff questions and issuing Recommen- dations on them with a
diguixiajiang
- 可以识别字符串是否符合以下文法: (1)E->TG (2)G->+TG|—TG (3)G->ε (4)T->FS (5)S->*FS|/FS (6)S->ε (7)F->(E) (8)F->i
国立——词法分析
- 自己做的一个普通词法分析程序c语言环境终结符:e c j t u可扩展-have done an ordinary lexical analysis procedure c language environment End Address : c j e t u scalability
5466
- 没什么的 只是一个普通的编译原理的实验程序-it doesn t matter,it is a ordinary test program of complier pronciple
CMM.rar
- 这个语法分析器用到的是自顶向下的递归调用的方法,根据Cminus语言的文法规则 的BNF范式编写递归调用的代码,parse方法是程序的入口,它调用的stmt_sequence完成整个语法分析工作,stmt_sequence背后是12个互相调用的方法,它本身也在语法分析的过程中被调用到。 每个方法在最后会返回一个构造好的节点DefaultMutableTreeNode节点t给调用它的方法,然后调用它的方法用这个返回的节点继续构造,最后语法分析完成后会返回一棵完全构造好了的树节点,然后将这个树节点
yufafenxi.rar
- 程序名称: 递归下降语法分析器 程序用途: 编译原理实验 实验题目: 识别下列表达式 E->E+T|T T->T*F|F F->(E)|i ,Name: recursive descent parser program purposes: to compile the experimental subject of experiment: Identify the following expression of E-> E+ T | T T-> T* F |
alngam
- library which evaluates the lower tail of the noncentral Student s T distribution this is Applied Statistics Algorithm 5
0cwHkQSp
- 这个是EAN-13的VB源代码。请大家笑纳-This is EAN-13 of the VB source code. Please笑纳
suanfuyouxianfenxiqi
- 【目的】 设计一个算符优先分析器,理解优先分析方法的原理。 【要求】 使用算符优先分析算法分析下面的文法: E’ → #E# E → E+T | T T → T*F | F F → P^F | P P → (E) | i 其中i可以看作是一个终结符,无需作词法分析。具体要求如下: 1. 如果输入符号串为正确句子,显示分析步骤,包括分析栈中的内容、优先关系、输入符号串的变化情况; 2. 如果输入符号串不是正确
lpl
- 用于数字下变频器的 FPGA 实现 -Digital Down Converter for the FPGA to achieve
PL0_net
- this a PL0 program, i wrote, but i don t know, is it correct-this is a PL0 program, i wrote, but i don t know, is it correct
LL1
- LL分析器 2、 在VC下打开LL1.dsp,阅读工程LL1,LL1为一个加、乘法(适当扩充可为四则)运算表达式的LL1预测语法分析器,规定其文法如下: E->TE’ (1) E’->+TE’ (2) E’->ε (3) T->FT’ (4) T’->*FT’ (5) T’->ε (6) F->(E) (7) F->i (8) 程序设计思路见课本P76,
yufafenxiqi
- 能够对表达式进行自上而下语法分析,判断表达式中是否有非法字符,这类表达式的文法为: E->TE’ E’->+TE’| ε T->FT’ T’->*FT’| ε F->(E)|i-this program can analysize the express in a top-down analysis.It can tell us whether there are illegal chars in the express.