搜索资源列表
ProgrammingLanLab4
- 我上过的Programming Language课程第四次大作业：在前三次的基础上添加类型检查和运算符结合和优先规则功能。 绝对原创，绝对经典!-My Programming Language course the fourth major operations: the basis of the first three add type checking and operator priority rule integration and functionality.
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
WHILE-loop-simple-priority
- WHILE循环语句的翻译程序设计（简单优先法、输出四元式）-The WHILE loop translation program design (simple priority output four yuan)
suanfu
- 算符优先分析法。根据你输入的文法，程序为你生成算符优先分析表，根据输入语句分析句子。基本功能具备-The operator precedence analysis method. Operator priority analysis table is generated for you based on your input grammar, procedures, analysis of sentences based on the input statement. Basic functio
RLS_NEW
- In this study, a design methodology is introduced that blends the classical PID and the fuzzy controllers in an intelligent way and thus a new intelligent hybrid controller has been achieved. Basically, in this design methodology, the classical PID a
final
- FCFS ROUNDROBIN PRIORITY scheduling
BIANYI
- 包含6个编译原理课程设计完整报告，包括集合FOLLOW(A)构造算法,算符优先分析算法,构造正规式r1r2（连接运算）的NFA等，有源码以及结果截图-Contains 6 compiler theory curriculum design complete report, including the collection FOLLOW (A) construction algorithm, operator priority analysis algorithms, construct regu
Operator-precedence-parser
- 算符优先分析是基于文法满足算符优先文法的基础上施加的一种自底向上的一种语法分析方法。通过对给定的文法构造算符优先分析表和实现某个符号串的分析，掌握算符优先分析法的基本思想和实现过程。-Operator priority analysis is based on operator precedence grammar grammar satisfy imposed on the basis of a bottom-up approach a grammatical analysis. Throug
priority-que
- priority que implemetation
GrammarPriority
- 编译原理作业，用python写的算符优先算法，实现了语法分析算符优先-Written python compiler theory with the operator priority algorithm
operator-precedence-parser
- 1、给出文法如下： G[E] E->T|E+T T->F|T*F F->i(E) 可以构造算符优先表如下： + * ( ) i + * ( ) i 2、计算机中表示上述优先关系，优先关系的机内存放方式有两种1）直接存放，2）为优先关系建立优先函数，这里由学生自己选择一种方式； 3、给出算符优先分析算法如下： k:=1 S[k]:=‘#’ REP
postfix-notation
- 1、给出文法如下： G[E] E->T|E+T T->F|T*F F->i(E) 对应的转化为逆波兰式的语义动作如下： E-> E(1)op E(2) {E.CODE:= E(1).CODE||E(2).CODE||op} E->(E(1)) { E.CODE := E(1).CODE} E->id { E.CODE := id} 2、利用实验5中的算符优先分析算法，结合上面给出的语义动作实现逆波兰式的构造
算符优先算法
- 是一个编译原理的算符优先算法。能够通过算符优先分析方法的实现，加深对自下而上语法分析方法的理解。(It is an operator precedence algorithm for a compiler principle. Through the realization of the operator priority analysis method, we can deepen the understanding of the bottom-up grammar analysis meth