The shunting-yard algorithm has been later generalized into operator-precedence parsing.

The shunting-yard algorithm is commonly used to implement operator-precedence parsers.

A method that solves all the listed problems of the classic solution, while being simpler than the shunting-yard algorithm is what I call "precedence climbing".

In computer science, the shunting-yard algorithm is a method for parsing mathematical expressions specified in infix notation.

Edsger Dijkstra invented the Shunting-yard algorithm to convert infix expressions to postfix (RPN), so named because its operation resembles that of a classification yard.

It implements Dijkstra's Shunting-yard algorithm to translate expressions from infix notation to Reverse Polish notation and calculates the result using a simple Stack algorithm.