This document provides examples of converting infix notation mathematical expressions to postfix notation. It shows the step-by-step process of parsing an infix expression token-by-token, pushing and popping operators from a stack to build the postfix string. For the expressions a+b*c-d/e*f and (a+b*c-d)/(e*f), it displays the token, operator stack, and resulting postfix strings after each step of the infix to postfix conversion algorithm.

1. Examples of Infix-to-Postfix Conversion
Infix expression: a+b*c-d/e*f
Token operator stack  top postfix string
A a
+ +
B ab
* +*
C ABC
- + ABC*
ABC*+
-
D ABC*+d
/ -/
E ABC*+de
* - ABC*+de/
-*
F ABC*+de/f
- ABC*+de/f*
ABC*+de/f*-
Infix expression: (a+b*c-d)/ (e*f)
Token operator stack  top postfix string
( (
a a
+ (+
b ab
* (+*
c abc
- (+ ABC*
( ABC*+
(-
d abc*+d
) ABC*+d-
/ /
( /(
e abc*+d-e
* /(*
f abc*+d-ef
) /( abc*+d-ef*

2. /
ABC*+d-ef*/