Description: postfixComputer, Calculate the postfix expression, such as 45+,which means 4+5,and the result is 9.
The program is very applied. Platform: |
Size: 375014 |
Author:刘波 |
Hits:
Description: postfixComputer, Calculate the postfix expression, such as 45+,which means 4+5,and the result is 9.
The program is very applied. Platform: |
Size: 376832 |
Author:刘波 |
Hits:
Description: 使用者輸入後序的數學算式後，可以計算出其值-After the user input sequence of mathematical formula, you can calculate the value Platform: |
Size: 378880 |
Author:brian |
Hits:
Description: 通过该程序可以计算前缀、中缀和后缀表达式的值。-Through the program can calculate the prefix, infix and postfix expressions value. Platform: |
Size: 375808 |
Author:许娜娜 |
Hits:
Description: 本程序能将运算式从中缀表达式转换为后缀表达式，并计算运算式的值。暂时仅可计算正整数之间的运算。暂时无法处理负数，要计算负数请用 (0-n) 的形式。输入仅含数字0~9及+、-、*、/、(、)的式子，并在结尾处加 # 字作为结束符。-This program can convert an expression from infix expressions to postfix expressions, and calculate the expression value. Calculate the time being, only the operation between the positive integers. Is temporarily unable to process negative, please use to calculate the negative (0-n) form. Input contains only numbers 0 to 9 and+,-,*,/,(,) the subreport, and at the end add# character as a terminator. Platform: |
Size: 52224 |
Author:moon walker |
Hits:
Description: （1）实现中缀表达式转换成后缀表达式
（2）计算表达式的值
-(1) implementation infix expression into postfix expression (2) Calculate the value of the expression Platform: |
Size: 1024 |
Author:Beaug |
Hits:
Description: 编写程序实现将中缀算术表达式转为后缀表达式,并利用栈和后缀表达式计算表达式的值-Programming to achieve infix arithmetic expressions to postfix expressions, postfix expression using stack and calculate the value of the expression Platform: |
Size: 884736 |
Author:安全卫士 |
Hits:
Description: 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate Platform: |
Size: 48128 |
Author:秦朔 |
Hits:
Description: 表达式求值***
将中缀表达式转换为后缀表达式。假设输入的算法表达式的运算符只有“＋、－、×、/、（、）”这几种。
要求：用栈完成；首先要判断输入的表达式括号是否配对，在正确表达式的基础上转换为后缀表达式，然后计算结果。
-*** Expression evaluation will be converted to postfix infix expression expression. Assume that the input of the algorithm expression of only " +,-,×,/,(,)" these types of operators. Requirements: completion of the stack we must first determine whether the pair enter the expression in brackets in the right on the basis of the expression into postfix expression, then calculate the results. Platform: |
Size: 2048 |
Author:Li |
Hits:
Description: this the lab that shows how to convert the infix number to postfix and also calculate them-this is the lab that shows how to convert the infix number to postfix and also calculate them Platform: |
Size: 4096 |
Author:li |
Hits:
Description: 将两个带头结点的有序循环链表合成一个带头结点的有序循环链表。
实验内容：使用键盘输入表达式，计算表达式的值并输出；将表达式转化成后缀表达式输出，利用后缀表达式求表达式的值并输出
-The two take the lead in the ordered circular list node synthesis of a lead in the ordered circular list node. Experiment: use the keyboard to enter an expression to calculate the value of the expression and output the expression into postfix expression output, using postfix expression evaluation and the output value of the expression Platform: |
Size: 2048 |
Author:火腿狼 |
Hits:
Description: 2、 表达式求值
问题描述：使用键盘输入表达式，计算表达式的值并输出；将表达式转化成后缀表达式输出，利用后缀表达式求表达式的值并输出。
-2, the expression evaluation problem description: Use the keypad to enter an expression to calculate the value of the expression and output the expression into postfix expression output, the use of a postfix expression to evaluate the expression and output. Platform: |
Size: 2048 |
Author:ssswwww |
Hits:
Description: 2、 表达式求值
问题描述：使用键盘输入表达式，计算表达式的值并输出；将表达式转化成后缀表达式输出，利用后缀表达式求表达式的值并输出。
-2, the expression evaluation problem description: Use the keypad to enter an expression to calculate the value of the expression and output the expression into postfix expression output, the use of a postfix expression to evaluate the expression and output. Platform: |
Size: 1024 |
Author:吴芳 |
Hits:
Description: 有中缀表达式转换成后缀表达式并计算结果
主要是数据结构上的一些算法以后又需要请联系我数据结构所有算法-With infix expressions into postfix and calculate the data structure is mainly the result of some of the algorithms later I need to contact all of the data structure algorithms Platform: |
Size: 1024 |
Author:wenjinjie |
Hits:
Description: 计算命题演算公式的真值，所谓命题演算公式是指由逻辑变量（其值为TRUE或FALSE）和逻辑运算符∧（AND）、∨（OR）和┐（NOT）按一定规则所组成的公式（蕴含之类的运算可以用∧、∨和┐来表示）。公式运算的先后顺序为┐、∧、∨，而括号（）可以改变优先次序。已知一个命题演算公式及各变量的值，要求设计一个程序来计算公式的真值。
要求：
（1）利用二叉树来计算公式的真值。首先利用堆栈将中缀形式的公式变为后缀形式；然后根据后缀形式，从叶结点开始构造相应的二叉树；最后按后序遍历该树，求各子树之值，即每到达一个结点，其子树之值已经计算出来，当到达根结点时，求得的值就是公式之真值。
（2）逻辑变元的标识符不限于单字母，而可以是任意长的字母数字串。
（3）根据用户的要求显示表达式的真值表。
-Propositional calculus formula for calculating the true value, the so-called propositional calculus formula refers to a logical variable (its value is TRUE or FALSE) and the logical operators ∧ (AND), ∨ (OR) and ┐ (NOT) according to certain rules of composition of the formula (contains the kind of computing can ∧, ∨ and ┐ expressed). Formula computing the order of ┐, ∧, ∨, and parentheses () can change the priorities. Given a propositional calculus formula and the value of a variable, to design a program to calculate the formula for the true value.
Requirements:
(1) the use of binary tree to calculate the true value of the formula. First, the stack will use the formula in infix form into postfix form then the postfix form, starting from the leaf node corresponding binary tree structure press the post-order traversal of the tree, find the value of each sub-tree, that is, each reaching a node, the value of its sub-tree has been calculated and when it reaches the root node, the obtain Platform: |
Size: 165888 |
Author:陈庆 |
Hits:
Search - postfix calculate