Shunting yard algorithm
Shunting yard algorithm
Algorithm to parse a syntax with infix notation to postfix notation.
No account needed. By playing, you confirm you're 13 or older and agree to the Terms of use.
No owners yet
Category: Empty
- 0 owners
- 0 copies
- 0 pulls
- Wishlisted
- 0
- In 0 albums
- On 0 showcases
- Market listings
- 0
Not sold on the market yet.
Readers' pathsAug 2026 – Oct 2026
Readers go next to
Share of the 2,424 clicks on its links
Reverse Polish notation
Mathematics notation where operators follow operands.
17%
Classification yard
Rail yard for sorting and assembling rail vehicles into trains.
9.5%
Edsger W. Dijkstra
Dutch computer scientist (1930–2002).
7%
Abstract syntax tree
Tree representation of the abstract syntactic structure of source code.
5.1%
Infix notation
Mathematics notation with operators between operands.
4.2%
Function (mathematics)
Association of one output to each input.
2.9%
Polish notation
Mathematics notation with operators preceding operands.
2%
Parsing
Analysing a string of symbols, according to the rules of a formal grammar.
0.95%
Stack (abstract data type)
Abstract data type.
0.41%
Readers come from
Share of the 1,820 readers arriving from another article
Reverse Polish notation
Mathematics notation where operators follow operands.
53%
Edsger W. Dijkstra
Dutch computer scientist (1930–2002).
9.1%
Abstract syntax tree
Tree representation of the abstract syntactic structure of source code.
5.5%
Infix notation
Mathematics notation with operators between operands.
3.4%
Double-ended queue
Abstract data type.
2.6%
Parsing
Analysing a string of symbols, according to the rules of a formal grammar.
1.9%