In computer science, the shunting-yard algorithm is a method for parsing mathematical expressions 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 and named the “shunting yard” algorithm because its operation resembles that of a railroad shunting yard. Dijkstra first described the Shunting Yard Algorithm in the Mathematisch Centrum report MR 34/61.
.net ADHD agile AI / ML / BigData algorithms analytics Android apache architecture asp bit C# cancer cold computer graphics / geometry console database debug Delphi devops dll DSL faq firebase firebird fonts game git google gradle graph theory http IIS interface internet / network interview / job IoT ipc java jetty keyboard kotlin MacOS management maven meetup money multithreading MySQL numeral system parsing pattern performance PHP postgresql python redmine RegExp REST / GraphQL rx scala script security / crypto server sport programming ssl / tls Testing / QA theory / math tips & tricks Travel UI/UX UML video / audio visual basic webgl websocket windows wordpress xml / xpath / json