Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Reverse Polish notation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Converting from infix notation == {{main|Shunting-yard algorithm}} [[Edsger W. Dijkstra]] invented the [[shunting-yard algorithm]] to convert infix expressions to postfix expressions (reverse Polish notation), so named because its operation resembles that of a [[classification yard|railroad shunting yard]]. There are other ways of producing postfix expressions from infix expressions. Most [[operator-precedence parser]]s can be modified to produce postfix expressions; in particular, once an [[abstract syntax tree]] has been constructed, the corresponding postfix expression is given by a simple [[post-order traversal]] of that tree.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)