Description: 简易语法分析程序LL(1)
（1）对输入文法，它能判断是否为LL(1)文法，若是，则转（2）；否则报错并终止；
（2）输入已知文法，由程序自动生成它的LL(1)分析表；
（3）对于给定的输入串，应能判断识别该串是否为给定文法的句型-simple syntax analysis procedures LL (1) (a) on the importation of grammar. it will determine whether to LL (1) grammar, and if so, in turn, (2); Otherwise errors and terminated; (2) the importation of known grammar, automatically generated from the LL (1) Analysis Table; (3) For a given set of input strings should be able to judge whether the identification of the string for a given grammar Sentence Platform: |
Size: 82944 |
Author:赵珊珊 |
Hits:
Description: 了解语法分析器的内部工作原理，通过在本次实验中运用一定的编程技巧，掌握对表达式进行处理的一种方法。① 对输入文法，由程序自动构造FIRST FOLLOW集② 对输入文法，由程序自动生成它的LL(1)分析表；③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。-Understanding of the internal parser working principle, in this experiment through the use of a certain degree of programming skills, master of the expression of a way to deal with. ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether a given grammar sentence. Platform: |
Size: 1031168 |
Author:vivian |
Hits:
Description: 学编译原理时写的一个语法分析程序
一．[目的要求]
① 对输入文法，由程序自动构造FIRST FOLLOW集
② 对输入文法，由程序自动生成它的LL(1)分析表；
③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。
二．[题目分析]
该程序可分为如下几步：
（1）读入文法
（2）判断正误
（3）若无误，判断是否为LL(1)文法
（4）若是，构造分析表；
（5）由总控算法判断输入符号串是否为该文法的句型。
-Studies Compilation Principle of a time to write a parser. [Objective request] ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether given the sentence grammar.二. [Title Analysis] The program can be divided into the following steps: (1) read into the grammar (2) The judge is false (3) If correct, determine whether to LL (1) grammar (4) If so, structural analysis table (5) controlled by the general algorithm to determine whether the string of input symbols for the grammar of the sentence. Platform: |
Size: 5120 |
Author:李爱春 |
Hits:
Description:
① 对输入文法，由程序自动构造FIRST FOLLOW集
② 对输入文法，由程序自动生成它的LL(1)分析表；
③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。-① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether a given grammar sentence. Platform: |
Size: 33792 |
Author:zlhhlz |
Hits:
Description: G代码分析
这个文件主要进行语法分析，主要包括以下几个方面
[1]判断字符地址（同种类型）时候有重复定义
[2]字符串提取数据，并把数据储存在语法分析变量数组里
[3]完整G代码匹配语句具体格式，其中格式合法性定义参照
-G code analysis of the document mainly grammar analysis, mainly include the following aspects [1] to judge the characters address (same type) when have to repeat the definition of [2] string to extract data, and the data are stored in the grammar analysis of variables in the array [ 3] integrity of the G code to match the specific format of statements, in which the legitimacy of the definition of reference format Platform: |
Size: 4096 |
Author:newuseruser |
Hits:
Description: 为L语言设计一个语法分析器。
读入源程序，输出分析过程，包括状态，已规约串，当前输入，语义动作（移进/规约），规约使用的产生式。适当考虑错误处理。-L language for the design of a parser. Read the source code, the output analysis of the process, including the state, has the Statute of string, the current input, semantic action (Removal of import/Statute), the Statute of the use of the production. Give due consideration to the error handling. Platform: |
Size: 12288 |
Author:刘提 |
Hits:
Description: 粗略地说它的实现思想是对输入符号串自左向右进行扫描，并将输入符逐个移入一个后进先出栈中，边移入边分析，一旦栈顶符号串形成某个句型的句柄时，（该句柄对应某产生式的右部），就用该产生式的左部非终结符代替相应右部的文法符号串。-Rough idea is that it s the realization of the input symbol string to be scanned from left to right, and enter the site one by one into a LIFO stack, the edges into the side of analysis, once the Top-symbol string a sentence to form a handle when (the handle of a production corresponds to the right of way), on the use of the production left the Department of non-terminator in place of the right of the corresponding string of grammar symbols. Platform: |
Size: 2048 |
Author:jilangzhe |
Hits:
Description: 算符优先文法
1. 可以使用任何语言来完成，例如：Java、C、C++。
2. 文法采用常用的方式进行描述，例如：S→aA。
3. 以文件方式读取文法。
4. 分别求出每一个非终结符的FIRSTVT和LASTVT集。
5. 画出算符优先关系表。
6. 判定读入的文法是否是算符优先文法。
7.给定的任意符号串判定是否是文法中的句子，将分析过程用计算机打印出来。
-Operator priority Grammar 1. You can use any language to accomplish, such as: Java, C, C++. 2. Grammar used to describe commonly used methods, such as: S → aA. 3. To read the grammar of papers. 4. Were obtained at each end of a non-FIRSTVT and LASTVT set. 5. Draw operator precedence relations table. 6. To determine whether or not read the grammar is the grammar operator priority. 7. The given string to determine whether any symbol is the grammar of the sentence, will analyze the process of using the computer print out. Platform: |
Size: 91136 |
Author:狐狸 |
Hits:
Description: 根据算符优先分析法，给定某文法和符号串。构造算符优先关系表，若算符优先关系表满足算符优先文法，则对给定的输入符号串进行归约分析，可以判定该符号串是否是给文法的句子。
-According to operator priority analysis, given a string of grammar and symbols. Tectonic relationship between the operator priority table, if the operator precedence relations table to meet the priority operator grammar, then the given string of input symbols to reduce analysis to determine whether the symbol string to the grammar of the sentence. Platform: |
Size: 1024 |
Author:李汉 |
Hits:
Description: 一个用C语言写的词法分析程序，输入所给文法的源程序字符串，输出二元组构成的序列。附有实验报告-Using C language to write a lexical analysis program, enter the source string to the grammar, the output sequence of binary units. With the experimental report Platform: |
Size: 30720 |
Author:雨涵 |
Hits:
Description: 学编译原理时写的一个语法分析程序
分类:C/C++技术交流
一．[目的要求]
① 对输入文法，由程序自动构造FIRST FOLLOW集
② 对输入文法，由程序自动生成它的LL(1)分析表；
③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。
二．[题目分析]
该程序可分为如下几步：
（1）读入文法
（2）判断正误
（3）若无误，判断是否为LL(1)文法
（4）若是，构造分析表；
（5）由总控算法判断输入符号串是否为该文法的句型。
-Studies Compilation Principle wrote a syntax analysis program Category: C/C++ A technology exchange. [Objective request] ① the input grammar, automatically constructed by the procedures set FIRST FOLLOW ② the input grammar, it is automatically generated by the process of LL (1) analysis table ③ For a given input strings, should be able to identify the string to determine whether given the sentence grammar.二. [Title Analysis] The program can be divided into the following steps: (1) read into the grammar (2) The judge is false (3) If correct, determine whether to LL (1) grammar (4) If so, structural analysis table (5) controlled by the general algorithm to determine whether the string of input symbols for the grammar of the sentence. Platform: |
Size: 4096 |
Author:liangye |
Hits:
Description: 文法分析,对于给定的文法,通过输入字符串,判断是否为文法的句子-Grammar analysis, for a given grammar, by entering the string, to determine whether the sentence for grammar Platform: |
Size: 1024 |
Author:waz |
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: 设计、编制并调试一个词法分析程序
输入所给文法的源程序字符串
输出二元组（syn，token或sum）构成的序列-Design, preparation and testing procedures for the importation of a lexical analysis of the grammar of the source string to the output of the dual group (syn, token or sum) of the sequence composition Platform: |
Size: 1024 |
Author:yanglingfei |
Hits:
Description: 算符优先算法，输入文法数和文法，自动分析生成firstVT和lastVT，并显示表，输入字符串，判断该字符串是否符合要求-Operator priority algorithm, the number of input grammar and the grammar, generate automatic analysis firstVT and lastVT, and display the table, enter the string to determine whether it meets the requirements of the string Platform: |
Size: 139264 |
Author:陈铮淇 |
Hits:
Description: 本程序是采用的LL（1）方法进行的语法分析，而LL（1）的分析方法是属于自上而下的方法。
自上而下分析的基本思想是：对任意输入串，试图用一切可能的方法，从文法开始符号（根结点）出发，自上而下为输入串建立一棵语法树。从推导的角度看，它是从文法的开始符号出发，反复使用各种产生式，寻找与输入串匹配的推导。
在输入之前必须要进行该文法是不是LL（1）文法的判断，然后再构造相应的LL（1）分析表来用预测分析方法进行语法分析，依据下面的文法及分析表来设计程序实现预测分析的分析过程。
-This procedure is used for LL (1) method of syntax analysis, LL (1) methods of analysis are top-down approach.
Top-down analysis of the basic idea is: For any input string, trying to use all possible means, from the grammar start symbol (root node) proceed from top to bottom as the input string to establish a syntax tree. From the derivation of the point of view, it is starting from the grammar start symbol and repeatedly using a variety of productions to find the derivation of the input string matches.
Before you enter must be to carry out the grammar is not LL (1) grammar, the judge, and then construct the corresponding LL (1) Analysis of the table to use predictive analysis method of syntax analysis, based on the following grammar and analysis of the table to the design process to achieve predictable analysis of the analysis.
Platform: |
Size: 2048 |
Author:WM |
Hits:
Description: 对于给定的输入串，能够判断识别该串是否为给定文法的句型-For a given input string that can identify the string to determine whether a given grammar of the sentence Platform: |
Size: 13312 |
Author:king |
Hits:
Description: 输入所给文法的源程序字符串。
输出二元组构成的序列。
-Enter the string to the source grammar. Tuple consisting of the output sequence. Platform: |
Size: 348160 |
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:
Search - string to grammar