搜索资源列表
zhan-op
- 栈的操作与应用 定界符配对检查 中缀转后缀并求值-stack operation and application delimiter matching inspection superintendent to seek value and Suffix
expression
- 表达式求值:利用栈操作实现由中缀表达式到后缀表达式的转换,再求值.
expression
- 用C语言版 编写一个表达式求值演算的 算法程序 要求：使用栈，需要将算法的过程显示出来 ，输入一连串算术值 如：2*（3+2）# 然后 显示出算术过程 和结果！先将输入的中缀 转换后缀 再求值 程序中使用两个栈！ 可以在VC++ 中运行- A linear epitope recognized by both MAbs,c2410 and WH303,which has strong specificity of CSFV,has been precisely defined and l
FomulaStack
- 利用栈求解算术表达式的值，程序分为两种表达式，中缀式与后缀式，分别得用栈先入后出的特性，以及运算符的优先级比较，进行求解-use arithmetic to solve the value of the expression, procedures are divided into two expressions, and the sergeant-type suffix. Stack were starting after the first-in-the characteristics, a
中缀转后缀的程序
- 将中缀表达式转化为后缀表达式，并计算它的值，采用栈结构，实现运算
calculator
- 用栈实现简单计算器功能。中缀转后缀表达式-Simple calculator using stack functions. Expression infix to suffix
expressions
- 有关表达式的栈的应用 内容有：表达式括号匹配 计算后缀表达式的值 计算算术表达式的值 中缀表达式转后缀表达式-Expression of the application stack are as follows: the expression in brackets to match the calculated value of the suffix arithmetic expression expression is made up of expressions of
Infix_expression_into_postfix_expression_calculati
- 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate
source
- 数据结构，线性表的应用（简单仓库管理）和栈的应用（中缀表达式转后缀表达式）-Data structures, application of linear forms (a simple warehouse management) and applications of stack (switch to postfix infix expression expression)
Stack
- 用栈实现中缀转化为后缀表达式的C、C++程序。-Stack implementation using infix into postfix expression C, C++ program.
main
- 表达式求值*** 将中缀表达式转换为后缀表达式。假设输入的算法表达式的运算符只有“＋、－、×、/、（、）”这几种。 要求：用栈完成；首先要判断输入的表达式括号是否配对，在正确表达式的基础上转换为后缀表达式，然后计算结果。 -*** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expressio
zzbdsqz
- 中缀表达式求值，使用栈将中缀表达式转化为后缀表达式然后再进行计算 新手报到 -Infix expression evaluation, the use of the stack will be an infix expression into postfix expression and then calculated new to report ~~~~~~~
expressionEvaluation
- 1)从键盘输入任意一个语法正确的（中缀）表达式，显示并保存该表达式。 (2)利用栈结构，把上述（中缀）表达式转换成后缀表达式，并显示栈的状态变化过程和所得到的后缀表达式。 (3)利用栈结构，对上述后缀表达式进行求值，并显示栈的状态变化过程和最终结果。-1) input from the keyboard correct any syntax (infix) expressions, display and save the expression. (2) the use of
Expression-and-derivation
- 以字符序列的方式从终端输入语法正确的，不含变量的整数表达式。利用中缀表达式变为后缀表达式的求值算法实现对算术四则混合运算表达式求值，并演示出在求值中运算符栈，操作数栈，输入字符和主要操作的变化过程。-The way to sequence of characters from the terminal input grammar correctly, do not contain variables integer expression. Use midfix expression of the
suffix
- c++数据结构应用 栈实现中缀表达式转后缀表达式-Middle expression converts to suffix expression in c++
stack
- 此程序算法主要实现中缀表达式转换为后缀表达式，后缀表达式的计算，主要利用栈的性质。-The main achievement of this program algorithm infix expressions into postfix expressions, postfix expression is evaluated, the main advantage of the nature of the stack.
zToH
- 中缀表达式转后缀表达式并求值 C++ 数据结构 链栈应用-Infix expression to turn suffix expression and to find the value of C++ data structure of the chain stack application
Ebiaodashijisx
- 表达式计算，用栈实现，可实现中中缀转后缀，表达式值的计算等功能 -Expression evaluates to use the stack, can realize the function in infix to suffix, the expression value is calculated
2
- 实现算术表达式求值程序（栈的运用）输入中缀表达式，将其转换成后缀表达式-Realization arithmetic expression evaluator (application stack) Enter the infix expression, converting it into Postfix expression Enter the infix expression, converting it into Postfix expression
CPP_ExpressionConvert
- 利用栈实现表达式转换（中缀到后缀）并求值-Stack expressions conversion (infix to postfix) and evaluated