Optimism is an occupational hazard of programming; feedback is the treatment. Kent Beck

Evaluate infix notation using Shunting-yard algorithm

Language Java | Level Intermediate | Category Data structure | August 30, 2015 1:06 pm


Data structure Description

The infix notation put operators in between the operands. The postfix notation put operators after their operands. Shunting-yard algorithm is a method for parsing mathematical expressions specified in infix notation.

Write a program to convert an infix expression to postfix expression using the shunting-yard algorithm.


Output

   					 

Shunting Yard Algorithm to convert from Infix Expression to Postfix Expression

Enter infix expression : 1+2*3

Postfix expression : 123*+

				    

Comments


No comments available!

Please login to add comments.