*( +cabc+nothing left to copy as in the numerical evaluation processyou go both forward and backward through the infix expression to complete the translation to postfix you can' write an operator to the output (postfixstring if it' followed by higher-precedence operator or left parenthesis if it isthe higher precedence operatoror the operator in parenthesesmust be written to the postfix before the lower priority operator saving operators on stack you'll notice in both table and table that the order of the operators is reversed going from infix to postfix because the first operator can' be copied to the output until the second one has been copiedthe operators were output to the postfix string in the opposite order they were read from the infix string longer example may make this clearer table shows the translation to postfix of the infix expression + *( -dwe include column for stack contentswhich we'll explain in moment table translating + *( -dto postfix character read from infix expression infix expression parsed so far postfix expression written so far aa + ab +bab + + *ab +* + *( abc +* + *(cabc +*( + *( - abcd +*( + *( -dabcd+* + *( -dabcd+* + *( -dabcd+ + *( -dabcd- + *( -dabcd-* stack contents