搜索资源列表
LR1
- 利用字符二维数组对文法、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,
First-Follow
- 编译原理 求First和Follow集的C++源代码-Compiler Principle to Find First and Follow Sets
yufafenxiqi
- 语法分析器(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 der
First_Follow_FOR.NET
- .NET源码，First集与follow集和LL1文法的实现-. NET source code, First set and follow set and achieve LL1 grammar
LL1
- 编译原理中的LL1语法分析程序 包括消除左递归， First集和Follow集自动生成， 预测表自动生成， 对输入的句型进行分析。-Compiler theory LL1 syntax analysis procedures, including the elimination of left recursion, First Set and Follow automatically generated prediction table is generated automatically an
code
- 编译原理，预测分析器,可求出first集，follow集，并构造出LL（1）分析器-Compiler theory, prediction analyzer can be obtained first set, follow set, and construct LL (1) parser
(first-follow-select)
- 构造LL(1)语法分析程序，任意输入一个文法符号串，并判断它是否为文法的一个句子。程序要求为该文法构造预测分析表，并按照预测分析算法对输入串进行语法分析，判别程序是否符合已知的语法规则，如果不符合（编译出错），则输出错误信息-Construct LL (1) parser, enter an arbitrary string of grammar symbols, and determine if it is a sentence grammar. Procedural requirements
FLyuce
- 《编译原理》陈火旺版的预测分析程序的代码实现，主要步骤是从输入文法，先求first集和follow集，然后构造预测分析表，最后对文法进行预测分析。-" Compiler Principle" Code Chen Huo version of predictive analytics program implementation, the main steps the input grammar, seeking first set and follow the first s
LL1
- 完成LL（1）语法分析器，包含FIRST集和FOLLOW集，预测分析表-LL (1) grammar analyzer, including FIRST and FOLLOW sets, forecast analysis table
cse340-first-and-follow-sets-master
- cse340-first-and-follow-sets-master in java