✳flâneur — a map of the web's best reading

Shunting yard algorithm - Wikipedia

en.wikipedia.org · 1,913 words · saved by 1 readers

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).[1] The algorithm was invented by Edsger Dijkstra, first published in November 1961,[2] and named because its operation resembles that of a railroad shunting yard.

Shunting yard algorithm - Wikipedia Jump to content From Wikipedia, the free encyclopedia Algorithm to parse a syntax with infix notation to postfix notation This article includes a list of general references , but it lacks sufficient corresponding inline citations . Please help to improve this article by introducing more precise citations. ( August 2013 ) ( Learn how and when to remove this message ) Shunting yard algorithm Class Parsing Data structure Stack Worst-case performance O ( n ) {\displaystyle O(n)} Worst-case space complexity O ( n ) {\displaystyle O(n)} In computer science , the s

Explore this link on the map →

saved by

related reading