搜索资源列表
PARSER
- a ll1 parser for windows
LL(1)
- 用c语言来实现，判断一个文法是否为LL(1)文法，并求该文法的First 和Follow集合，比较有用。-C language used to achieve, to determine whether a grammar for LL (1) grammar, and grammar for the collection of First and Follow, more useful.
PL0
- 用递归下降的方法来设计PL/0编译器。以下我们给出该语言的FIRST和FOLLOW集合。-The decline in use of recursive methods to the design of PL/0 compiler. Below we give the language of the FIRST and FOLLOW set.
FirAndFol
- 封装非终结符集合的类Vn，可以求出 FIRST集和FOLLOW集。-Package of non-terminal symbol set of classes Vn, you can find the FIRST sets and FOLLOW sets.
20029440913
- （1） 根据LL(1)分析法编写一个语法分析程序，可根据自己实际情况，选择以下一项作为分析算法的输入： a. 直接输入根据已知文法构造的分析表M b.输入文法的FIRST(α)和FOLLOW(U)集合，由程序自动生成文法的分析表M； c.输入已知文法，由程序自动构造文法的分析表M。 （2） 程序具有通用性 所开发的程序可适用于不同的文法和任意输入串，且能判断该文法是否为LL(1)文法。 （3） 有运行实例 对于输入的文法和符号串，所编制的语法分析程序应能正确判断此
FFFF
- this program is about first and follow
sammi
- 用java语言编写的LL(1)文法分析程序，输出first集、follow集和分析表，并对输入串进行预测分析。 -Written by java LL (1) grammar analysis program, the output first set, follow the table set and analysis, and prediction of the input strings.
first_follow
- first and follow in c
yufa
- VS2010编写的LL（1）语法分析器，first和follow集合，构造预测分析表，以及对输入进行分析!-LL parser, seeking first and follow sets, table structure prediction analysis, and analysis of the input grammar!
FirstFollowLL
- 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 c
first_follow
- firto find the first and follow of gramnmer
LL1
- LL1，实现LL1的基本功能，实现first和follow集，-LL1, LL1 of the basic functions of first and follow sets
FIRST_FOLLOW
- First and follow in C
chengxu
- 编译原理课程实验求文法的first和follow集-Compiler principle course experiments seeking grammar first and follow sets
SLR
- SLR分析器SLR语法分析器，能求出FIRST、FOLLOW 集和构造出SLR分析表，出入一个句子，能动态演示匹配过程。（-The the SLR parser SLR parser can be obtained FIRST and FOLLOW sets and construct the SLR analysis table, and out of a sentence, dynamic presentation of the matching process. (
diguixiajiangwenfa
- 一、实验目的 实现一个递归下降语法分析程序，识别用户输入的算术表达式。 二、实验主要内容 1、文法如下： E® TE` E’® +TE’|-TE’|e T® FT` T’® *FT’|/FT’|e F® (E)|i 2、求取各非终结符的First及Follow集合 3、编程实现下降递归分析法，识别从键盘输入的关于整数或浮点数的算术表达式（在此，上述文法中的i代表整数或浮点数） 4、对于语法错误，要指出错误具体信息。
first_follow
- firto find the first and follow of gramnmer
First_follow
- Caculate first and follow
First_follow
- Caculate first and follow
LL1
- 完成LL（1）语法分析器，包含FIRST集和FOLLOW集，预测分析表-LL (1) grammar analyzer, including FIRST and FOLLOW sets, forecast analysis table