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.
agile AI / ML / BigData / AR / VR / Computer vision algorithms Android architecture C# computer graphics / geometry database debug Delphi developing tools/IDE devops dll faq firebase firebird game git google gradle graph theory internet / network interview / job java jetty kotlin meetup microsoft multithreading MySQL news/releases pattern performance PHP REST / GraphQL rx security / crypto sport programming Testing / QA theory / math tips & tricks UI/UX video / audio windows xml / xpath / json