搜索资源列表
khss
- 数据结构:带括号的算术表达式求值。能完成一位数的带括号的算术表达式的运算,结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-data structure : the bracketed arithmetic expression is evaluated. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack I
myCompile
- 一个小程序,用c++语言实现简单的一遍编译器,完成中缀表达式与后缀表达式之间的转换。-a small program, c simple language what the compiler, completed sergeant with the suffix expression between the expression change.
45646748945
- 本程序的功能是:将中缀表达式(只能含有的运算符为( ) / * + - =)转化为后缀表达式,-this procedure is the function : China will decorate the expression (containing only the operator () / * - =) into suffix expression,
houzhui
- 把中缀表达式转换为后缀表达式并计算结果~~第一个编译试验作业~-sergeant Chinese expression for the conversion and extension expression results ~ ~ a compiler test operations ~
translater
- 将简单中缀算术表达式变换成: (1)后缀形式 (2)对常量算术表达式,输出结果 简单中缀算术表达式是指由单个字母变量,自然数通过 +,-,*, DIV , MOD运算以及括号()构成的表达式,如 a + ( 5 MOD 2) * 2。 -will Infixation simple arithmetic expressions transform into : (a) the form of the suffix (2) constant arithmetic expressio
1
- 利用堆栈进行中缀表达式转后缀表达式的转换。
biaodashiqiuzhi
- 实现了表达式的求值。当你输入一般的表达式,程序会实现了转化为前缀表达式,中缀表达式以及后缀表达式,并分别计算出结果。
03
- 编译原理实验中有关中缀表达式转后缀表达式输出的程序代码.
zzh
- 实现中缀表达式转后缀表达式最终版.c
khss_Debug
- 带括号的算术表达式计算器.能完成一位数的带括号的算术表达式的运算,结果可以为多位数。用栈实现中缀表达式和后缀表达式的转换。-bracketed arithmetic expression calculator. Complete with a number of brackets arithmetic expression Operational results for the multi-digit number. With Stack Implementation grade express
InToPost
- 中缀表达式转换成后缀表达式算法,并求算术表达式的方法。-Infix expression into the expression suffix algorithm, and methods for arithmetic expressions.
1
- C++语言编的表达式求值-中缀表达式转为后缀表达式-C++ language for evaluation of the expression- expression to infix expressions suffix
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.
01
- 一个简单的程序,中缀表达式变后缀表达式并计算-zhongzhui into houzhui
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.
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
infix-to-postfix
- 中缀表达式转后缀表达式,只做了数字,没有考虑字母的情况-infix to postfix
compile1
- 一个将中缀表达式转为后缀表达式的词法分析器-Infix expression a will turn into a postfix expression lexical analyzer
中缀转后缀
- 实现将表达式的中缀转后缀。包括yacc程序和编译后C++代码,可以直接使用(this code makes the middle expression turn into postfix expression)