从文法文件中读入终结符、非终结符、开始符、文法，输出FIRSTVT集，LASTVT集和算符优先矩阵-from grammar document read into the end of website - end website address beginning, grammar, and the output FIRSTVT set, LASTVT set priorities and operator matrix 下载
|
输入文法，可以实现对非终结符，终结符的判断，最后判断文法。-importation of grammar can be realized by the end of the non-Fu, Fu end of the judgment, the final judgment of grammar. 下载
|
输入任意文法，找到终结符和非终结符。并统计个数。- 下载
|
对于已知文法用LL(1)进行语法分析 输入非终结符，终结符，开始符和产生式，可以得到进行语法分析后的结果-known for grammar with LL (1) syntax analysis of the end of the importation of non-Fu, Fu end, Fu and began production can be a syntax analysis results 下载
|
上下文无关文法（Context-Free Grammar, CFG）是一个4元组G=(V, T, S, P)，其中，V和T是不相交的有限集，S∈V，P是一组有限的产生式规则集，形如A→α，其中A∈V，且α∈(V∪T)*。V的元素称为非终结符，T的元素称为终结符，S是一个特殊的非终结符，称为文法开始符。 设G=(V, T, S, P)是一个CFG，则G产生的语言是所有可由G产生的字符串组成的集合，即L(G)={x∈T* | Sx}。一个语言L是上下文无关语言（Context-Free Language, CFL），当且仅当存在一个CFG G，使得L=L(G)。 *? 例如，设文法G：S→AB A→aA|a B→bB|b 则L(G)={a^nb^m | n,m>=1} 其中非终结符都是大写字母，开始符都是S，终结符都是小写字母。 - 下载
|
给出非终结符的FIRSTVT和LASTVT集。画出算符优先关系表。给定符号串判定是否是文法中的句子，分析过程用计算机打印出来。-website is not the end of the FIRSTVT and LASTVT set. Ingenuous operator precedence table. Series set to determine whether the symbol is the grammar of the sentence, the analysis process used computer print out. 下载
|
此为编译原理实验报告 学习消除文法左递规算法，了解消除文法左递规在语法分析中的作用 内含 设计算法 目的 源码 等等.... 算法:消除左递归算法为: （1）把文法G的所有非终结符按任一种顺序排列成P1,P2,…Pn 按此顺序执行 （2）FOR i:=1 TO n DO BEGIN FOR j:=1 DO 把形如Pi→Pjγ的规则改写成 Pi→δ1γ δ2γ … δkγ。其中Pj→δ1 δ2 … δk是关于Pj的所有规则； 消除关于Pi规则的直接左递归性 END （3）化简由（2）所得的文法。即去除那些从开始符号出发永远无法到达的非终结符的 产生规则。 -to compile this report principle experiment to eliminate learning grammar rules Left delivery algorithm, left the Elimination delivery grammar rules in grammar analysis of the role of the design algorithm containing purpose algorithm source code .... etc. : Elimination left recursive algorithm : (1) grammar, of all non-G website by the end of a paramagnetic Arrange sequence P1, P2, ... Pn implementation of this order (2) FOR i : n = 1 DO TO BEGIN FOR j : = 1 DO put the shape of Pi Gamma approximate rewrite the rules 1 into Pi Gamma Gamma 2 k .... These ions 1 2 ... k ions on all the rules; Pi elimination of the direct rule left recursive END (3) Reduction from (2) from the grammar. Removing that those symbols starting from the beginning will never be able to reach the end of the webs 下载
|
LR1语法分析器 自动识别开始符号、终结符、非终结符； 生成各非终结符的 first和follow集 生成LR1分析表-Complete parser automatic identification symbols beginning and ending address, end-FU; The end-generating website and follow the first generation Complete Set Table Analysis 下载
|
本设计使用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! 下载
|
算符优先算法中非终结符的firstvt集和lastvt集的求解，在vc6.0环境下编译通过-operator priority algorithm end of the Central African websites firstvt sets and lastvt Solution Set, in vc6.0 compile environment 下载
|