搜索资源列表
wenfafenxi
- 编译原理课上的ll1文法分析,可以生成预测表,进行分析-Compiler theory class of ll1 grammar analysis can generate forecasts, analysis
ll1
- 实现ll(1)文法的演示,vc++编写,可实现演示-ll(1)grammar showbiz
LL1ForWin
- vc实现语法分析。LL1)文法预测分析表构造程序。-vc achieve parsing.LL1) grammar prediction table constructor.
LL1ALG
- 关键字:编译原理;算法;LL1文法 描述:LL1文法主要思想是根据产生式当中终结符或非终结符的先后关系来确定字符串是否符合文法,在写程序之前用First集合Follow集制定出一个程序的走向表,通过该表来判断字符串,当对应的表格为空时字符串不合文法。-Compilation principle algorithm LL1 grammar
LL(1)
- LL1文法分析器,可进行句子分析等功能。运行环境:java。by风为衣裳-LL1 grammar parser, sentence analysis. Operating environment: java. by the wind for the clothes
bianyiyuanli_ll1
- 编译原理LL1文法分析,求follow集,遍历follow集求解,推到产生式-Compiler theory LL1 grammar analysis to seek follow set the traversal follow set solving, pushed to the production
ll1
- LL(1)文法的实现,主要包括文法的读取、消除左递归、求First集、Follow集、Select集,生成预测分析表,对给定句子分析是否符合文法。-LL (1) grammar implementations, read mainly include grammar to eliminate left recursion, seeking First set, Follow Set Select set generate predictive analysis table, analysis m
050420212-
- 编译原理LL1文法的实现,左递归的消除,句子分析,过程显示。-LL1 grammer anlarnazi.
LL1
- L1文法分析器,只能分析 E -> TE E -> + TE | ε T -> FT T -> *FT | ε F -> i | (E)
LL1_number
- 一个整数四则运算的LL1文法解析器,使用递归下降算法,是编译原理的作业。-An integer four computing LL1 grammar parser, recursive descent algorithm is the job of the compiler theory.
First_Follow_FOR.NET
- .NET源码,First集与follow集和LL1文法的实现-. NET source code, First set and follow set and achieve LL1 grammar
20120502_lxw
- 实现编译原理中词法分析,语法分析,语义分析,包括递归下降算法,LL1文法等-Compiler theory lexical analysis, parsing, semantic analysis, including recursive descent algorithm, LL1 grammar
LL1语法分析
- (1)对输入文法,它能判断是否为LL(1)文法,若是,则转(2);否则报错并终止; (2)输入已知文法,由程序自动生成它的LL(1)分析表; (3)对于给定的输入串,应能判断识别该串是否为给定文法的句型。
LL1
- 编译原理实验: 对下列文法,用LR(1)分析法对任意输入的符号串进行分析: (1)E- E+T (2)E- E—T (3)T- T*F (4)T- T/F (5)F- (E) (6)F- i -Compiler Principle Experiment: The following grammar, with LR (1) analysis method for arbitrary strings of symbols for analysis: (1) E-E
LL1
- LL(1)文法的判定,在first集和follow集不确定的情况下-LL (1) grammar to determine, in the first set and follow set under conditions of uncertainty ......
LL1
- 简单的LL1分析,文件输入文法~~你值得下载-Simple LL1 analysis, file input grammar ~ ~ ~ ~ you deserve download
vcapi20040127
- LL1文法分析器,可以实现自动生成分析表,给定文法,判断分析结果。-LL1 grammar analyzer
LL1
- 输入已经消除左递归的以及提取公共左因子的LL(1)文法,再输入相应的表达式,若分析成功,则在递归输出过程中输出"acc",若不成功,则有相应的报错以及位置指名。注意,要把同一个非终结符的产生式分成单个输入。它会自动计算first,follow,预测分析表的构造,但并不输出。-Input has to eliminate left recursion and extract the public left factor of LL (1) grammar, then input the corre
The-LL1-parser
- 输入: 非终结符号串:AB 终结符号串:a 起始符号:A 文法个数:2 第一个产生式:A->aB|a 第二个产生式:B->a 输出 first follow集 输入:测试句型 aa 语法正确 测试句型 ab 语法不正确-Input: Nonterminal symbol string: AB The end of string symbol: a Start symbol: A The number o
11003070108
- 能实现基本编译原理算法演示,如LL1文法、算符优先、词法分析、语法分析等-To achieve a basic compiler theory algorithm demonstration, such as LL1 grammar, operator precedence, lexical analysis, parsing, etc.