a) if the stack is empty then push into stack b) if the top of stack is open parenthesis then push into stack c) if the top is operator ,check and pop all the ...

step2 : if token is Operand then append directly to output. step3 : if token is ‘(’ then push onto the stack step4 : if token is ‘)’ then pop to output until ‘(’ is found; discard both parens step5 : ...