yacc program to convert infix to postfix expression

If a right parenthesis is encountered ,then: Repeatedly pop from Stack and add to Y each operator (on the top of Stack) which has the same precedence as or higher precedence than operator.If a left parenthesis is encountered, push it onto Stack.If an operand is encountered, add it to Y.Scan X from left to right and repeat Step 3 to 6 for each element of X until the Stack is empty.Push “(“onto Stack, and add “)” to the end of X.This algorithm finds the equivalent postfix expression Y. Let, X is an arithmetic expression written in infix notation. E.g., AB+ Algorithm to convert Infix To Postfix

Such an expression is termed infix expression. These complex arithmetic operations can be converted into polish notation using stacks which then can be executed in two operands and an operator form. But in our usual form an arithmetic expression may consist of more than one operator and two operands e.g. As our computer system can only understand and work on a binary language, it assumes that an arithmetic operation can take place in two operands only e.g., A+B, C*D,D/A etc. One of the applications of Stack is in the conversion of arithmetic expressions in high-level programming languages into machine readable form. Submitted by Abhishek Jain, on June 14, 2017 Learn: How to convert infix to postfix using stack in C language program? Infix to Postfix conversion is one of the most important applications of stack.

Yacc program to convert infix to postfix expression