搜索资源列表
消除左递归1
- 对给定的文法消除左递归。- To the grammar which assigns eliminates the left recursion.
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, after but the grammar tree carrie
LL(1)
- LL(1)分析 写的语法分析程序,但是不能实现消除左递归,提取公因子-LL (1) analysis of written grammar analysis program, but can not eliminate the left recursion, extracting common factor
indirect_recursion
- 编译原理消除间接左递归。将结果存于文件中-Compiler to eliminate the principle of indirect left recursion. The results stored in the document
xiaochuzuodigui
- 用于消除左递归的一个用C++语言实现的小程序。里面包含有详细的报告和源代码。-Used to eliminate the left recursion in a C++ language implementation with a small program. Which contains detailed reports and source code.
diguixiajiang
- 递归下降的基本思想: 为每一个非终结符构造一个子程序,每一个子程序的过程体中按该产生式的候选项分情况展开,遇到终结符直接匹配,而遇到非终结符就调用相应非终结符的子程序。该分析从调用文法开始符号的子程序开始,直到所有非终结符都展开为终结符并得到匹配为止。若分析过程中达到这一步则表明分析成功,否则表明输入中有语法错误。递归下降分析对文法的限制是不能有公共左因子和左递归。由于文法是递归定义的,因此子程序也是递归的,被称为递归下降子程序。 -The basic idea of recursiv
XMLparserforc
- 将树形数据结构用于最小化DOM 模型XML 编解码器的开发。在解析XML 文本时,基于Expat 解释器将XML 字符串构造成树 状结构;编码时构造DOM 树结构,采用非递归深度优先法遍历树,将其串行化成XML 串。本编解码器解决了国际化语言关键问题,是 一个通用、高效的工业级XML 应用支撑模块。-This paper designs a DOM liked tree data structure for developing a minimal DOM based eXtended
Syntax_Analysis-LL(1)-LCC
- 编译原理之语法分析LL(1) (1)消除左递归 (2)求First集 (3)求Follow集 (4)预测分析表 (5)预测分析过程-Compiler theory of parsing LL (1) (1) elimination of left recursion (2) Find First Set (3) Find Follow set (4) prediction of sheet (5) prediction analysis
LL1parserVS2010
- LL1语法分析器,FIRST集合的构造,FOLLOW集合的构造,消除左递归,预测分析表 C++语言开发,工具VS2010-LL1 parser, FIRST set of the structure, FOLLOW set of the structure, elimination of left recursion, predictive analysis table C++ language development tools for VS2010
GrammerParsers
- 利用C++语言编制一个LL(1)语法分析器,利用LL(1)控制程序根据显示栈栈顶内容、向前看符号以及LL(1)分析表,对输入符号串自上而下的分析过程。可通过消除左递归、提取左因子把非LL(1)文法改造成LL(1)文法。-Compiled using a C++ language LL (1) parser using LL (1) control program according to display the contents of the stack the stack, forward-l
fanxvlie
- 用递归求数的反序列及递归求fib,devcpp环境下编写,在其他支持C语言的编译器上均可运行-Recursive sequence and find the number of anti-recursion fib, devcpp environment written in other languages supported C compiler can be run on
recursive-fill.tar
- Some example code for you to learn java and recursion.
Remove-left-recursion
- Compiler tech: Program To Remove Left Recursion From The Given Grammar
Left-Recursion.cpp
- Left recursion removal in CFG
grammaPanalysis_LL(1)
- 使用MFC实现编译原理LL1语法分析器(含消除左递归)-Using MFC compiler theory LL1 parser (including the elimination of left recursion)
yufafenxi
- 理解语法分析的功能和实现机制。掌握递归向下的语法分析方法。-Understand the syntax analysis functions and mechanisms. Master recursion down syntax analysis method.
remlef
- remove left recursion
ll1
- LL(1)文法的实现,主要包括文法的读取、消除左递归、求First集、Follow集、Select集,生成预测分析表,对给定句子分析是否符合文法。-LL (1) grammar implementations, read mainly include grammar to eliminate left recursion, seeking First set, Follow Set Select set generate predictive analysis table, analysis m