How can i write a c program to covert infix expression to postfix expression using stack concept.
The basic algorithm runs along the following lines: you scan the infix expression
from left to right; when you read an operand (e.g. a number) you pass it to the
output stream directly; when you read an operator you either push it on a stack
when the operators' priority is larger than the priority of the top element of the
stack (an empty stack has a priority too). If it has lower priority you keep popping
operators from the stack and shift them to the output stream until either the
stack is empty or the first condition is true. You have to figure out the priorities
for the operators (parentheses count as operators too).
kind regards,
Jos
2
