Live briefing
Everything about Shunting yard algorithm
Algorithm to parse a syntax with infix notation to postfix notation
In computer science, the shunting yard algorithm is a method for parsing arithmetical or logical expressions, or a combination of both, specified in infix notation. It can produce either a postfix notation string, also known as reverse Polish notation (RPN), or an abstract syntax tree (AST). The algorithm was invented by Edsger Dijkstra, first published in November 1961, and named because its operation resembles that of a railroad shunting yard. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Shunting yard algorithmA 5-minute orientation
- Pick up a classic book: ICTE 2015The most-reprinted book on the subject
- Read the landmark paper: Models and Algorithms for Container Allocation Problems on Trains in a Rapid Transshipment Shunting YardCited 86 times
- Go sideways: Operator-precedence parserA closely related topic
- Go sideways: ParsingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
📚 Books worth reading
- 📕ICTE 2015China) International Conference On Transportation Engineering (5th 2015 Dalian Shi · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Operator-precedence parser In computer science, an operator-precedence parser is a bottom-up parser that interprets an operator-precedence grammar. For example, most calculators…
- Parsing Parsing, syntax analysis, or syntactic analysis is a process of analyzing a string of symbols, either in natural language, computer languages or data structures…
- Polish notation Polish notation (PN), also known as normal Polish notation (NPN), Łukasiewicz notation, Warsaw notation, Polish prefix notation, Eastern Notation, or simply…
- Infix notation Infix notation is the notation commonly used in arithmetical and logical formulae and statements. It is characterized by the placement of operators between…
- Operator associativity In programming language theory, the associativity of an operator is a property that determines how operators of the same precedence are grouped in the…
- LL parser In computer science, an LL parser is a top-down parser for a restricted context-free language. It parses the input from Left to right, performing Leftmost…
- Exp4j exp4j is a small Java library for evaluation of mathematical expressions. It implements Dijkstra's Shunting-yard algorithm to translate expressions from…
- Operand In mathematics, an operand is the object of a mathematical operation, i.e., it is the object or quantity that is operated on. Unknown operands in equalities…