Register

The expression in postfix notation corresponding to the prefix notation ++A*B+CD*+EFG is

• recategorized by
1,141 views

1 Answer

0 0 votes

 

To convert prefix to postfix –

  1. Read input from right to left
  2. If(operand) push onto stack
  3. If (operator) pop operand 2, pop operand 1
  4. Write expression in this order operand 1 operand 2 operator 
  5. Push above expression onto the stack.
  6. Repeat the above steps until end of prefix expression.


 

Voting & Accepting an answer helps improve the community
← Previous · Doubt:Next → · Automatic Repeat Req...
← Previous in category · GO Classes Test Seri...Next in category → · Introduction to Alog...
Position:
Show:

Related questions

0 0 votes
1 answers 1 answer
1.5k
1.5k views
akash28 asked Feb 23, 2023
1,474 views
TOPIC - Infix to postfix and prefix conversion
Convert the following infix expression to postfix and prefixA^B^C^D
2 2 votes
1 answers 1 answer
7.5k
7.5k views
tbhaxor asked Nov 24, 2023
7,476 views
What is the infix to postfix evaluation of (A+B)*(C*D - E)*F / G
According to my knowledge, it should be AB+CD*E-*F*G/And, here is the step-wise explanation of itConverting the bracket of (A+B) – AB+There is operator but the next opera...
3 3 votes
1 answers 1 answer
4.7k
4.7k views
2018 asked Nov 26, 2016
4,684 views
infix, prefix, postfix
Time required to evaluate a. prefix, b. infix, c. postfix_____O(n) ?for expression evaluation (infix, prefix, postfix) operand stack needed____True?for conversion from on...
1 1 vote
0 0 answers
2.1k
2.1k views
PEKKA asked Nov 10, 2016
2,059 views
Postfix and Prefix
Conver the following infix to Postfix and Prefix $log ( 3 ! )^ {log4} *log log ((6/7)*4+x)!$$ sin 2x cos (3x+4) $ Please use stack method to solve . Diagram would be app...