搜索资源列表
Postfix
- 中山大学编译原理实验三 后缀表达式Postfix-Postfix
EvaluatePostfixExpression
- Evaluate Postfix expression. Data Structure. C code
fuzhiyuju
- 赋值语句的翻译：利用算符优先法将一个赋值语句翻译成后缀表达式-Assignment statement translation: Using the priority France will be one operator assignment statement translated into postfix expression
Calculator
- c++语言编写的计算器程序，可以实现加减乘除，不过不支持双位数，使用堆栈编写，含有中缀表达式到后缀表达式的转换。-c++ language calculator program, Math can be achieved, but does not support double-digit, use the stack preparation, with infix expression to postfix expression converter.
comptool
- Postfix evaluation demo using basic Compiler Tools: Symbol Table, Lexical Analysis-Postfix evaluation demo using basic Compiler Tools: Symbol Table, Lexical Analysis...
postfix
- This is a function done in c++, an compile with devc++. Where it can compute POSTFIX ecuation, giving the result of it ecuation. ex. 23+4- = 1
huizhuishi
- 中缀式转换成后缀式 基于语法制导翻译的表达式转换编译器-Postfix infix conversion into a translation type expression based Syntax compiler transformation
4
- It is based on infix to postfix evaluation.
zhong_zhuan_hou_calc
- 输入中缀表达式，转换为后缀表达式，并计算出结果-Input infix expression into postfix expression, and calculate the results
ex1
- 《编译原理》表达式翻译器 构造一个中缀表达式到后缀表达式的翻译器，初步了解递归下降语法分析原理及语法制导翻译的过程。-Compiler theory expression translator construct an infix expression to postfix expression translator, a preliminary understanding of recursive descent parsing principle and Syntax translation
1
- 编译原理实验 表达式翻译器:一个中缀表达式到后缀表达式的翻译器 表达式文法及其翻译模式定义如下： expr expr + term {print(‘+’)} | expr - term {print(‘-’)}| term term term * factor {print(‘*’)} | term / factor {print(‘/’)} | factor factor ( expr ) | id {print(id.
code
- 简单的语句解析。将后缀表达式转换成自定义的汇编语言。-Simple statement is parsed. Postfix expression converted to a custom assembly language.
expression_value
- 将中缀表达式转化成后缀表达式并求值（数据结构与算法）-Infix expression into postfix expression evaluator (data structures and algorithms)
pass_compiler
- 龙书《编译原理》中的一遍翻译器，能将表在达翻译成后缀表达式-Again translator Dragon Book " compiler theory, be able to table reached translated into postfix expression
text2
- 实现了用树建立数值表达式，并求其值，随便输出它的广义表、前缀表达式和后缀表达式-To realize the tree is to develop a numerical expression, and for its value, literally output its generalized list, prefix and postfix expression expression
semantic-analysis
- 语义分析语法分析词法分析等等等等还有后缀表达式-Semantic analysis syntax analysis lexical analysis, and so on and so there is a postfix expression
expression-translator
- 构造一个中缀表达式到后缀表达式的翻译器 表达式文法及其翻译模式定义如下： expr + term {print(‘+’)} | expr - term {print(‘-’)} | term term * factor {print(‘*’)} | term / factor {print(‘/’)} | factor f-Construct an infix expression to postfix expression translator
Counter
- 采用后缀式实现计算器功能，能够识别括号和判断优先级-Achieved using postfix calculator function, able to identify and determine the priority of parentheses
infix-to-postfix
- 中缀表达式转后缀表达式，只做了数字，没有考虑字母的情况-infix to postfix
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中的算符优先分析算法，结合上面给出的语义动作实现逆波兰式的构造