translation rules let' make the rules for infix-to-postfix translation more explicit you read items from the infix input string and take the actions shown in table these actions are described in pseudocodea blend of java and english in this tablethe symbols refer to the operator precedence relationshipnot numerical values the opthis operator has just been read from the infix inputwhile the optop operator has just been popped off the stack table infix to postfix translation rules item read from input (infixaction operand open parenthesis close parenthesis write it to output (postfixpush it on stack while stack not emptyrepeat the followingpop an itemif item is not (write it to output quit loop if item is if stack emptypush opthis otherwisewhile stack not emptyrepeatpop an itemif item is (push itor if item is an operator (optop)and if optop opthispush optopor if optop >opthisoutput optop quit loop if optop opthis or item is push opthis while stack not emptypop itemoutput it operator (opthisno more items convincing yourself that these rules work may take some effort tables and show how the rules apply to three example infix expressions these tables are similar to tables and except that the relevant rules for each step have been added try creating similar tables by starting with other simple infix expressions and using the rules to translate some of them to postfix