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.