Description: LL1通用语法分析器，有消除左递归，FIRST集合、FOLLOW集合、分析表生成等功能-Universal grammar LL1 parser, has the elimination of left recursion, FIRST collection, FOLLOW collection, analysis and other functions to generate Table Platform: |
Size: 647168 |
Author:Wang Xinxi |
Hits:
Description: 编译原理中的实验，消除左递归的实现。c++开发环境-Compilation Principle of the experiment, the realization of the elimination of left recursion. c++ development environment Platform: |
Size: 1024 |
Author:董必锋 |
Hits:
Description: 编译原理之语法分析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 Platform: |
Size: 66560 |
Author: |
Hits:
Description: 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 Platform: |
Size: 273408 |
Author:jianren2hao |
Hits:
Description: 利用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-looking symbols and LL (1) of the table, the input symbol string of top-down analysis . Through the elimination of left recursion, left-factor of the extraction of non-LL (1) grammar transformation into a LL (1) grammar. Platform: |
Size: 227328 |
Author:杨玥 |
Hits:
Description: LL(1)文法的实现。具体设计要求如下：
1. 可以使用任何语言来完成，例如：Java、C、C++。
2. 文法采用常用的方式进行描述，例如：S→aA。
3. 以文件方式读取文法。
4. 分别求出每一个非终结符FIRST 集FOLLOW集和SELECT集。
5. 画出预测分析表。
6. 判定读入的文法是否是LL(1)文法。
7. 给定的任意符号串判定是否是文法中的句子，将分析过程用计算机打印出来。
8. 查出文法中是否含有左递归或左公因子。若有则消除左公因子和左递归，并给出分析过程。
-LL (1) grammar implementation. Specific design requirements are as follows: 1. You can use any language to complete, such as: Java, C, C++. 2. Grammar described by commonly used methods, such as: S → aA. 3. The papers read grammar. 4. Were calculated for each set of nonterminal FIRST SELECT FOLLOW set and set. 5. Draw the projections of the table. 6. To determine whether it is read into the grammar LL (1) grammar. 7. The given string to determine whether any symbol is the grammar of the sentence, will be printed by computer analysis. 8. Find out whether they contain left-recursive grammar or left common factor. If the elimination of left recursion and left common factor, and gives analysis. Platform: |
Size: 6144 |
Author:冯景航 |
Hits:
Description: 编译原理中的LL1语法分析程序 包括消除左递归， First集和Follow集自动生成， 预测表自动生成， 对输入的句型进行分析。-Compiler theory LL1 syntax analysis procedures, including the elimination of left recursion, First Set and Follow automatically generated prediction table is generated automatically analyzes the input sentence. Platform: |
Size: 1462272 |
Author:gan |
Hits:
Search - left recursion elimination