1.

Which of the following statement is incorrect with respect to evaluation of infix expression algorithm?

A. Operand is pushed on to the stack
B. If the precedence of operator is higher, pop two operands and evaluate
C. If the precedence of operator is lower, pop two operands and evaluate
D. The result is pushed on to the operand stack
Answer» C. If the precedence of operator is lower, pop two operands and evaluate


Discussion

No Comment Found