搜索资源列表
biaodashiqiuzhi
- 通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value.
zhongzhui
- 本程序能将运算式从中缀表达式转换为后缀表达式，并计算运算式的值。暂时仅可计算正整数之间的运算。暂时无法处理负数，要计算负数请用 (0-n) 的形式。输入仅含数字0~9及+、-、*、/、(、)的式子，并在结尾处加 # 字作为结束符。-This program can convert an expression from infix expressions to postfix expressions, and calculate the expression value. Calculate th
InfixToPrefixConversion
- program to convert infix to postfix
Infix_expression
- 编写一程序直接计算任意输入的中缀表达式的值，且不能采用先转换到后缀表达式再计算的方式。-Procedures for the preparation of a direct calculation of arbitrary input infix expression values, and can not be converted to a postfix expression using the first re-calculated way.
PPT4
- 编写程序实现将中缀算术表达式转为后缀表达式,并利用栈和后缀表达式计算表达式的值-Programming to achieve infix arithmetic expressions to postfix expressions, postfix expression using stack and calculate the value of the expression
expression
- 实验要求把中缀表达式转换成为后缀表达式，然后再对后缀表达式求值。其中要利用栈，数组等。-Experimental requirements to convert infix expression into postfix expression and then evaluate the expression of the suffix. Which make use of the stack, the array and so on.
homework
- (1)从键盘输入任意一个语法正确的（中缀）表达式，显示并保存该表达式。 (2)利用栈结构，把上述（中缀）表达式转换成后缀表达式，并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构，对上述后缀表达式进行求值，并显示栈的状态变化过程和最终结果。-(1) keyboard input either from the right syntax (infix) expressions, display and save the expression. (2) the use
infixpostfix
- convert infix to postfix sourcecode
caculator
- 用户输入四则运算的中缀表达式（可包含小括号），程序首先将中缀表达式转为后缀表达式并输出，然后计算结果并输出。-User input of infix arithmetic expression (which can include parentheses), the program first infix expression to postfix expression and the output, then the results and outputs.
InfixToPostfix.cpp
- it is a infix to postfix program in c++ code.
zhongzhuizhuanhouzhui
- 将中缀表达式转换为后缀表达式并计算它的结果，采用栈的结构-Convert infix expression to postfix expression and calculate its results, using the stack structure
CS2208_DSLab_Programs
- CS2208 - Data Structures Lab (Anna University) EXERCISES 1a. Implement singly linked lists. 1b. Implement doubly linked lists. 2. Represent a polynomial as a linked list and write functions for polynomial addition. 3. Implement stack and
expression-change
- 中缀表达式转换为后缀表达式。将正确的中缀表达式输入，程序自动转化为后缀表达式并计算出结果。-Convert infix expression to postfix expression. The correct infix expression input, the program automatically converted into postfix expression and calculate the results.
cPP_code
- 简单用c++实现 中缀表达式-后缀表达式 之间的转换-Simple to achieve with c++ infix expression- the conversion between postfix expression
MyPro
- 斗地主发牌 定义和使用堆栈 将中缀表达式转换为后缀表达式-Landlords licensing define and use the stack to convert infix expression postfix expression
Calc
- 通过中缀表达式到后缀表达式的变换，实现简单四则运算的计算器-By converting infix expression to postfix expression, simple arithmetic calculator
CPP-into-postfix-expression
- 这个程序是用C++编写的，编写时用到的环境是VC++6.0,程序作用是将中缀表达式转换为后缀表达式-This program is written in C++, when used in the preparation of the environment is VC++6.0, the role of the program is to convert infix expression postfix expression
2
- 输入中缀表达式，#为结束符将其转换成后缀表达式，然后计算-Enter infix expression,# to end the character to convert it into a postfix expression, and then calculate
calculator
- 控制台应用程序，科学计算器。用来学习中缀表达式转后缀表达式。函数的输入需要一个字母一个字母的输入。-Console application, scientific calculator. Learning to turn postfix notation infix expression. Enter function requires a letter of an alphabet input.
Convert-infix
- 问题描述 中缀表达式就是我们通常所书写的数学表达式，后缀表达式也称为逆波兰表达式，在编译程序对我们书写的程序中的表达式进行语法检查时，往往就可以通过逆波兰表达式进行。我们所要设计并实现的程序就是将中缀表示的算术表达式转换成后缀表示，例如，将中缀表达式 (A 一 (B*C 十 D)*E) ／ (F 十 G ) 转换为后缀表示为： ABC*D十E* FG十／ 注意：为了简化编程实现，假定变量名均为单个字母，运算符只有＋，－，＊，／ 和＾（指数运算