Description: Problem description
Is the infix expression we usually write mathematical expressions, postfix expression also known as anti Poland formula, the compiler checks the syntax of expressions we write in the program, often can be carried out by the anti Poland formula. We need to design and implement a program that will convert infix arithmetic expressions representing suffixes for example, infix expression
(A 1 (B*C ten D) *E () / (F ten G)
Convert to suffix:
ABC*D ten E* FG ten
Note: in order to simplify the programming, assume that the variables are single letters, only the operator +, -, *, / and ^ (exponentiation), can handle the parentheses (), and assume that the input arithmetic expression right.
Requirements: to achieve the use of stack data structure, to the end of the input infix expression directly.
input
Integer N. Express the following N infix expression
N expressions that consist of a single letter and operator
output
N suffix expression.
To Search:
File list (Check if you may need any files):
Convert infix.rar.cpp
Download