Location:
Search - infix
Search list
Description: 利用堆栈进行表达式的 Infix -> postfix 转换
适合大专院校计算机专业数据结构课参考
用法：
输入infix表达式为：(3+2*3)^2 则 转换位postfix表达式 323*+2^
进而可以计算出表达式的值为81
目前bug: 主要作原理演示用，只能处理1位数字变量，且变量值不可太大-use of the stack for expression Infix -
Platform: |
Size: 42527 |
Author: QKY |
Hits:
Description: This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr-This section contains a brief introductio n to the C language. It is intended as a tutorial o n the language, and aims at getting a reader new to C started as qu ickly as possible. It is certainly not intended as a substitute for any of the numerous textbook 's on C. 2. write a recursive function FIB (n) to fi nd out the nth element in sequence theFibanocci number which is 1,1,2,3,5,8,13,21,34,55, ... 3. write the prefix and postfix form of the follo wing infix expressiona b-c/d e f*- g* h/i ^ j4. wr ite a function to count the number of nodes in a bi nary tr
Platform: |
Size: 22528 |
Author: jim |
Hits:
Description: 利用堆栈进行表达式的 Infix -> postfix 转换
适合大专院校计算机专业数据结构课参考
用法：
输入infix表达式为：(3+2*3)^2 则 转换位postfix表达式 323*+2^
进而可以计算出表达式的值为81
目前bug: 主要作原理演示用，只能处理1位数字变量，且变量值不可太大-use of the stack for expression Infix-
Platform: |
Size: 41984 |
Author: QKY |
Hits:
Description: 表达式类型的实现:
1、 一个表达式和一颗二叉树之间，存在着自然的对应关系。
2、 假设算术表达式Expression内可以含有变量（a～z）、常量（0～9）和二元运算符（＋，－，*，/，^）。实现一下操作。
（1） ReadExpr(E)——以字符序列的形式输入语法正确的前缀表示式并构造表达式E。
（2） WritrExpr(E)——用带括弧的中缀表示式输出表达式E。
（3） Assign(V,c)——实现对变量V的赋值(V=c),变量的初值为0。
（4） Value(E)——对算术表达式E求值。
（5） CompoundExpr(P,E1,E2)——构造一个新的复合表达式（E1）P (E2)。
-Realize the type of expression: one, an expression, and between a binary tree, there is a natural correspondence between. 2, assuming that the arithmetic expression Expression can contain variables (a ~ z), constant (0 ~ 9) and binary operators ( ,-,*,/,^)。 You realize the operation. (1) ReadExpr (E)- sequence of characters in the form of input grammar correct prefix expressions and tectonic expression of E. (2) WritrExpr (E)- used within parentheses express output infix expression E. (3) Assign (V, c)- realize the value V of the variables (V = c), variable initial value is 0. (4) Value (E)- on the arithmetic expression E is evaluated. (5) CompoundExpr (P, E1, E2)- Construction of a new composite expression (E1) P (E2).
Platform: |
Size: 58368 |
Author: |
Hits:
Description: 中缀表达式转后缀表达式，建立二叉表达式树，利用二叉表达式树求解
-Infix to suffix expressions expression, the establishment of binary expression tree, the use of binary expression tree to solve
Platform: |
Size: 1024 |
Author: 李 |
Hits:
Description: 中缀表达式到逆波兰式转换的程序代码,学习数据结构的可以-Infix expression to Reverse Polish conversion of program code, learning data structures can be
Platform: |
Size: 2048 |
Author: zhiyou |
Hits:
Description: 将中缀表达式转换为后缀表达式，并计算任意四则运算表达式的结果，采用链表和队列实现，非文法和状态机-Infix expression would be converted to suffix expressions, and calculate the arithmetic expression of arbitrary results, the use of linked lists and queues to achieve, non-grammar and the state machine
Platform: |
Size: 7168 |
Author: wuwenxi |
Hits:
Description: 中缀表达式转化成后缀表达式并求值的算法，将中缀表达式转换为后缀表达式，顺利转换返回true，若转换过程中发现中缀表达式非法则返回false-Infix suffix expressions into expressions and evaluation algorithms, will be converted to infix expressions suffix expression, a smooth transition to return to true, if the conversion process is made up of expression found in illicit returns false
Platform: |
Size: 2048 |
Author: chenyuehong |
Hits:
Description: 前缀表达式转换成二叉树的代码，通过转换成二叉树可以轻松实现转换成后缀，前缀，中缀形式。-Prefix expression into a binary tree code, through the binary tree can be converted easily into a suffix, prefix, infix form.
Platform: |
Size: 3072 |
Author: wxg |
Hits:
Description: This source code is used for make infix expression from prefix expression by using assembly and C language together.
Platform: |
Size: 7168 |
Author: asi |
Hits:
Description: Convert infix to postfix
Platform: |
Size: 3072 |
Author: wanchat |
Hits:
Description: 将前缀表达式转为中缀表达式，并画出所建的树-To prefix infix expression to expression, and draw the tree built
Platform: |
Size: 306176 |
Author: arthur |
Hits:
Description: Infix到Postfix转化的完全实现，Infix到Postfix转化的完全实现-Infix to Postfix conversion fully achieved
Platform: |
Size: 1024 |
Author: 陈少琪 |
Hits:
Description: infix to postfix program,.
Platform: |
Size: 1024 |
Author: ashu |
Hits:
Description: implementation of infix to postfix algorithm
Platform: |
Size: 1024 |
Author: anshu |
Hits:
Description: infix to postfix expression
Platform: |
Size: 1024 |
Author: John |
Hits:
Description: postfix to infix converter
Platform: |
Size: 1024 |
Author: chengers |
Hits:
Description: 实现将一个表达式转成前缀，中缀和后缀的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
Platform: |
Size: 1024 |
Author: hahaha |
Hits:
Description: C语言实现的表达式求值程序，由用户输入一个中缀表达式，系统自动求值，表达式中只含有加减乘除和括号这5种运算符。-C language implementation of the expression evaluation process from the user to enter an infix expression, the system automatically evaluated, the expression contains only addition and subtraction multiplication and division, and parentheses which five kinds of operators.
Platform: |
Size: 14336 |
Author: 刘龙 |
Hits:
Description: date structure infix-applet
Platform: |
Size: 11264 |
Author: korebandi
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
21
»