搜索资源列表
biaodashizhuanhuanhejisuan
- 这说一个转换表达式和计算表达式值的源代码，可以实现前缀中缀和后缀表达式的转换和计算。-err
qianzhuizhuanerchashu
- 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
BDS
- 编写完整程序，将中缀表达式翻译成后缀表达式。 要求： 表达式由操作数(变量)、操作(运算符)以及小括弧“（”和“）”组成，其中： • 操作包括算术运算、关系运算和逻辑运算三类； • 操作数应能够识别但个字符或由字母和数字任意多个字符构成； • 能够识别出简单的错误，如括弧不匹配。 输入：中缀表达式，80个字符以内 输出：转换后的后缀表达式 -The preparation of a complete procedure inf
biaodashijisuan
- 表达式计算，用栈实现，可实现中缀转后缀，表达式值的计算等功能-Expression, the use of the stack to achieve, can be achieved in up to suffix, expression value calculation and other functions
biaodashi
- 将中缀表达式转换成后缀表达式后，并计算结果-Infix expression will be converted into suffix after expression, and calculated results
23020062203776
- 将简单中缀算术表达式变换成： （1）后缀形式 （2）生成书上描述的抽象堆栈机的代码 （3）对常量算术表达式，输出结果 -The simple arithmetic infix expressions transform into: (1) suffix form (2) to generate an abstract descr iption of the book stack machine code (3) arithmetic constant expression, th
infixcaculator
- 根据用户输入的中缀表达式，将其转化为后缀表达式并求值。-Based on user input infix expression into a suffix of its expression and evaluated.
main
- 通过此源代码，能够实现如下功能：输入中缀表达式，实现后缀表达式的输出，然后求值-Through this source code, be able to achieve the following functions: Input infix expression, the expression of the output suffix implementation, then evaluation
Expression
- 把中缀表达式转换为后缀表达后，求表达式的结果。用到栈和队列-Infix expression to convert the expression of suffix, and the results of expressions. Used stack and queue
houzhui
- 中缀表达式转换为后缀表达式并求值 使用switch语句-Infix expression into a suffix for the value of expression and the use of switch statement
zhongzhuizhuanhouzhui
- 使用链表数据结构算法，将中缀表达式转变为后缀表达式。-The use of linked list data structure algorithms, will be made up of expressions into expressions suffix.
convert
- 将由数字和四则运算符组成的后缀表达式变换为中缀表达式。输入的后缀表达式包含的运算符不超过15个。要求转换后的中缀表达式中不应出现不必要的括号。例如，整个表达式两端的括号要省略，不影响原计算顺序的括号要省略。-Will be 4 numbers and the composition of the suffix operator expressions transform infix expression to. Enter the suffix operator expression does
Stack
- 栈的定义，C++定义的栈的基本操作 用于栈的操作练习 表达式求值，中缀转后缀-Stack
expression
- 此代码主要功能是用堆栈来实现数学表达式的解析功能，从中缀表达式来得到后缀表达式-these code use stack for describe mathematical expression
calculator
- 用栈实现简单计算器功能。中缀转后缀表达式-Simple calculator using stack functions. Expression infix to suffix
Functions
- 运算表达式的计算，c编写，首先将中缀表达式转换为后缀表达式，再用栈将结果输出-Calculation of computing the expression, c preparation, the first expression will be converted to infix suffix expressions, and then stack the results output
expressions
- 数据结构线性表的应用，算术表达式求值，中缀转后缀算法，加减乘除基本运算-The application of the linear table data structure, arithmetic expression evaluation, infix suffix transfer algorithm, the basic operations addition and subtraction multiplication and division
main
- 实现将一个表达式转成前缀，中缀和后缀的3种形式，并计算表达式的值，其中数字为浮点型-Achieve an expression is converted into prefix, infix, and suffix of the three kinds of forms, and calculate the value of the expression, in which figures are floating-point type
exchange_perfix
- 中缀表达式 后缀表达式：不包含括号，运算符放在两个运算对象的后面，所有的计算按运算符出现的顺序，严格从左向右进行-Infix expression postfix expression: does not contain parentheses, operator on two operands in the back, all the calculations appear in the order according to operator, strictly from left to ri
stack_and_queue
- 以字符序列的形式从终端输入语法正确的、不含变量的整数表达式，利用给定的算符优先关系把中缀表达式转换成计算机容易处理的后缀表达式。本实验中操作数规定为1位数字字符，运算符只有+、-、*、/。-In the form of a sequence of characters entered from the terminal grammatically correct, non-integer variable expression, using the given operator preceden