Description: 一个程序，用于判定给定的文法是否为LL（1）文法。 实现了：1．文法的机内表示；2. FIRST集和FOLLOW集的计算； 3. LL（1）预测分析表的构造。-a procedure for the determination of grammar to whether LL (1) grammar. Realized : 1. Grammar said the machines; 2. FIRST FOLLOW sets and set computing; 3. LL (1) Forecast and Analysis table structure. Platform: |
Size: 23552 |
Author:luo |
Hits:
Description: 本设计使用C语言实现了对简单方法描述的LL(1)文法的判定。该设计程序实现了：⑴分别求出每一产生式的右部的FIRST 集、每一个非终结符的FOLLOW集和每一产生式的SELECT集；⑵判定是否是LL(1)文法；⑶画出预测分析表；⑷对给定的符号串判定是否是文法中的句子，分析过程在屏幕上打印出来。
欢迎大家给程序提出富贵意见!-the design of the C language to describe a simple method of LL (1) grammar convicted. The design process was realized : 1 were calculated for each production of the right of the FIRST episodes, each end of a non-Fu FOLLOW sets and the production of each SELECT set; 2 determine whether LL (1) grammar; 3 paint Forecast and Analysis table; 4 the right to determine whether or not a bunch of symbols is grammar the sentences analysis on the screen printed. Welcome to the procedure rich views! Platform: |
Size: 147456 |
Author:张玉峰 |
Hits:
Description: 功能较全的LL1文法分析,自定义输入文法,生成first集follow集,再输入句子,判断是否是该文法,并显示栈的状态-function over the entire LL1 grammar analysis, since the definition of input grammar, Generating Sets follow first set, then input sentence, the judge is whether grammar, and that the state Stack Platform: |
Size: 202752 |
Author:chengning |
Hits:
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集 以及SLR分析表-Compilation Principle realize through grammar known to generate First Set and FOLLOW sets, as well as SLR analysis table Platform: |
Size: 11264 |
Author:陈波 |
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: 大学时的编译大作业，是对LL（1）语法的分析过程，会产生first集，follow集和预测分析表！-University at the time of compiling large operations, is a LL (1) syntax analysis process, will have first set, follow sets and predictive analysis table! Platform: |
Size: 6144 |
Author:liangye |
Hits:
Description: 利用字符二维数组对文法、First集、Follow集、终结符集、非终结符集等数据进行存储，还有一个是状态表存储DFA的状态。二维TAB表对其中的DFA表进行存储，横坐标是状态号，纵坐标为文法中的符号（终结符和非终结符）。-Two-dimensional array of characters to use grammar, First Set, Follow sets, at the end of sets, sets and other non-terminator data storage, there is a state table is stored DFA state. Two-dimensional table TAB which DFA table storage, the abscissa is the state number, longitudinal coordinates for the grammar of the symbols (and non-terminator terminator). Platform: |
Size: 513024 |
Author:liyingan |
Hits:
Description: 给出给定LL(1)文法的FIRST和FOLLOW集，求出相应的分析表以及对给定字符串进行分析，判断是否属于该文法 -Give a given LL (1) grammar of the FIRST and FOLLOW sets, calculated the corresponding analysis table, as well as an analysis of the given string to determine whether or not belong to the grammar Platform: |
Size: 5120 |
Author:weilinquan |
Hits:
Description: 问题描述
设计一个由正规文法生成First集和Follow集并进行简化的算法动态模拟。(算法参见教材)
【基本要求】
动态模拟算法的基本功能是：
（1） 输入一个文法G；
（2） 输出由文法G构造FIRST集的算法；
（3） 输出First集；
（4） 输出由文法G构造FOLLOW集的算法；
（5） 输出FOLLOW集。
-Description of the problem to design a grammar generated by the First Set and Follow sets and dynamic simulation of a simplified algorithm. (See materials algorithm) the basic requirements of】 【dynamic simulation algorithm for the basic functions are: (1) enter a grammar G (2) output by the grammar G constructed sets FIRST algorithm (3) First output set (4) output by the FOLLOW structure grammar G set algorithm (5) Set the output FOLLOW. Platform: |
Size: 513024 |
Author:穆鹏 |
Hits:
Description: 封装非终结符集合的类Vn，可以求出
FIRST集和FOLLOW集。-Package of non-terminal symbol set of classes Vn, you can find the FIRST sets and FOLLOW sets. Platform: |
Size: 1024 |
Author:伯伦 |
Hits:
Description: However, grammars that are not left recursive and are left factored may still not be LL(1).
To see if a grammar is LL(1), try to build the parse table for the predictive parser by the
method we are about to describe. If any element in the table contains more than one
grammar rule right-hand side, then the grammar is not LL(1).
To build the table, we must must compute FIRST and FOLLOW sets for the grammar. Platform: |
Size: 40960 |
Author:payal |
Hits:
Description: it is a lecture on the first and follow set-it is a lecture on the first and follow set Platform: |
Size: 5120 |
Author:muhammad azam |
Hits:
Search - first and follow sets