Description: 实现LL1文法，从输入文法到FIRST、FOLLOW集，分析表。再到输入文法动作-The realization of LL1 grammar, from grammar to enter the FIRST, FOLLOW sets, analysis table. To enter the action grammar Platform: |
Size: 46080 |
Author:Kword |
Hits:
Description: 语法分析关于first集和follow集。可运行可使用。自己看吧。没问题的。 还有不知为什么不能归为源码一栏 那个谁谁有空看下-Grammar analysis of first set and follow sets. Can be used to run. Check it out themselves. No problem. I do not know why there should not fall into one column that source availability谁谁facie Platform: |
Size: 5120 |
Author:shenchen |
Hits:
Description: 语法分析器(C++)源代码＋其详细的课程设计报告
输入的文法可以消除左递归并提取公共左因子求出文法的非终结集合——FIRST和FOLLOW集并对输入的算符优先文法，构造算符优先关系表
-Parser (C++) Source code its detailed report on curriculum design input left recursive grammar can be eliminated and the public left factor extract derived grammar of non-end collection- FIRST and FOLLOW set of the input operator priority grammar, operator precedence relations structure table Platform: |
Size: 104448 |
Author:michelle |
Hits:
Description: 构造实验一所给文法（应考虑改造）的FIRST集合和FOLLOW集合；构造LL(1)分析表；构造预测分析的总控程序；利用分析表、分析栈和总控程序对源程序进行自上而下的语法分输出整个语法分析过程中栈的变化过程及分析结果，如符合语法规则输出“正确”，否则输出“错误”。
-Experiment to construct a grammar (should consider the transformation) of FIRST and FOLLOW set of the collection construct LL (1) analysis table structural prediction analysis of the master control procedures the use of analytical tables, analyze the stack and the total source code control procedures carried out since the last sub output down syntax parsing process of the whole stack and analysis of the results of the change process, such as the grammatical rules out the " right" , otherwise output " error." Platform: |
Size: 3072 |
Author:DP |
Hits:
Description: 建立一个针对LL(1)文法编译器的自动生成器。要完成此编译器的生成器需对源文件进行两遍处理：第一遍词法分析，第二遍语法分析。语法分析程序用LL(1)语法分析方法。首先输入定义好的文法书写文件(所用的文法可以用LL(1)分析)，然后建立词法分析器，包括词法分析主程序、扫描器部分、关键字表等。经词法分析后分别计算所输入的文法的每个非终结符号的FIRST集合，每个非终结符号的FOLLOW集合，以及每个规则的SELECT集合，并判断任意一个非终结符号的任意两个规则的SELECT集的交集是不是都为空，如果是则输入文法符合LL(1)文法则可以进行分析。-For the establishment of a LL (1) grammar compiler automatic generator. To accomplish this compiler generator must deal with the source file twice: first pass lexical analysis, parsing the second time. Parser using LL (1) syntax analysis. First, write the input file defined grammar (grammar can be used in LL (1) analysis), and then create the lexical analyzer, including lexical analysis of the main program, scanner parts, keyword lists. The lexical analysis of the inputs were calculated for each non-terminal grammar symbol of the FIRST set of each non-terminal symbol FOLLOW set, and each set of the rule s SELECT and determine any non-terminal symbol of any two rules SELECT set intersection is not all empty, if it is in line with the input grammar LL (1) the text rule can be analyzed. Platform: |
Size: 37888 |
Author:yin |
Hits:
Description: .NET源码，First集与follow集和LL1文法的实现-. NET source code, First set and follow set and achieve LL1 grammar Platform: |
Size: 3147776 |
Author:王先生 |
Hits:
Search - source first follow grammar