Search - a-w - CodeBus

Search - a-w - List

[ELanguage] LL(1)yufafenxi DL : 0: *--- --- --声明--- --- -----*/ /* VC6.0下运行通过此程序为本人苦心所做，请您在阅读的时候，尊重本人的劳动。可以修改，但当做的每一处矫正或改进时，请将改进方案，及修改部分发给本人 (修改部分请注名明：修改字样) Email: jink2005@sina.com QQ: 272576320 ——初稿完成：06-5-27 jink2005 补充：程序存在问题： (1) follow集不能处理：U->xVyVz的情况 (2) 因本人偷懒，本程序为加入文法判断，故输入的文法必须为LL(1)文法 (3) 您可以帮忙扩充：消除左递归，提取公因子等函数 (4) …… */ /*-----------------------------------------------*/ /*参考书《计算机编译原理——编译程序构造实践》 LL(1)语法分析,例1: ERTWF# +*()i# 文法G[E]:(按此格式输入) 1 E -> TR 2 R -> +TR 3 R -> 4 T -> FW 5 W -> * FW 6 W -> 7 F -> (E) 8 F -> i 分析例句：i*(i)# , i+i# 例2：编译书5.6例题1 SHMA# adbe# S->aH H->aMd H->d M->Ab M-> A->aM A->e 分析例句：aaabd# */
Date : 2008-10-13 Size : 5.16kb User : 林月忠
[ELanguage] LL(1)yufafenxi DL : 0: *--- --- --声明--- --- -----*/ /* VC6.0下运行通过此程序为本人苦心所做，请您在阅读的时候，尊重本人的劳动。可以修改，但当做的每一处矫正或改进时，请将改进方案，及修改部分发给本人 (修改部分请注名明：修改字样) Email: jink2005@sina.com QQ: 272576320 ——初稿完成：06-5-27 jink2005 补充：程序存在问题： (1) follow集不能处理：U->xVyVz的情况 (2) 因本人偷懒，本程序为加入文法判断，故输入的文法必须为LL(1)文法 (3) 您可以帮忙扩充：消除左递归，提取公因子等函数 (4) …… */ /*-----------------------------------------------*/ /*参考书《计算机编译原理——编译程序构造实践》 LL(1)语法分析,例1: ERTWF# +*()i# 文法G[E]:(按此格式输入) 1 E -> TR 2 R -> +TR 3 R -> 4 T -> FW 5 W -> * FW 6 W -> 7 F -> (E) 8 F -> i 分析例句：i*(i)# , i+i# 例2：编译书5.6例题1 SHMA# adbe# S->aH H->aMd H->d M->Ab M-> A->aM A->e 分析例句：aaabd# */-err
Date : 2025-12-29 Size : 5kb User :
[ELanguage] bianyi DL : 0: 实现编译原理简单的词法语法的分析，以及w对while语句的分析-The realization of the principle of a simple compiler analysis of the lexical grammar, and w for the analysis of while statements
Date : 2025-12-29 Size : 730kb User : 王火华
[ELanguage] cmake-2.8.1-win32-x86 DL : 0: Cmake - the cross-platform, open-source build system. CMake is a family of tools designed to build, test and package software. CMake is used to control the software compilation process using simple platform and compiler independent configuration files. CMake generates native makefiles and workspaces that can be used in the compiler environment of your choice.
Date : 2025-12-29 Size : 7.42mb User : baaaa
[ELanguage] main DL : 0: A bottom-up parse corresponds to the construction of a parse tree for an input string beginning at the leaves (the bottom) and working up towards the root (the top) . It is convenient to describe parsing as the process of building parse trees, although a front end may in fact carry out a translation directly without building an explicit tree. We can think of bottom-up parsing as the process of reducing a string w to the start symbol of the grammar. At each reduction step, a specific substring matching the body of a production is replaced by the non terminal at the head of that production. The key decisions during bottom-up parsing are about when to reduce and about what production to apply, as the parse proceeds. -A bottom-up parse corresponds to the construction of a parse tree for an input string beginning at the leaves (the bottom) and working up towards the root (the top) . It is convenient to describe parsing as the process of building parse trees, although a front end may in fact carry out a translation directly without building an explicit tree. We can think of bottom-up parsing as the process of reducing a string w to the start symbol of the grammar. At each reduction step, a specific substring matching the body of a production is replaced by the non terminal at the head of that production. The key decisions during bottom-up parsing are about when to reduce and about what production to apply, as the parse proceeds.
Date : 2025-12-29 Size : 2kb User : shank18