2016-12-05 22:15:40 +01:00
;Task:
Create a stack-based evaluator for an expression in [[wp:Reverse Polish notation|<u>r</u>everse <u>P</u>olish <u>n</u>otation (RPN)]] that also shows the changes in the stack as each individual token is processed ''as a table''.
2013-04-10 23:57:08 -07:00
* Assume an input of a correct, space separated, string of tokens of an RPN expression
2016-12-05 22:15:40 +01:00
* Test with the RPN expression generated from the [[Parsing/Shunting-yard algorithm]] task: <br>
<big><big><code> 3 4 2 * 1 5 - 2 3 ^ ^ / + </code></big></big>
* Print or display the output here
;Notes:
* <big><b> '''^''' </b></big> means exponentiation in the expression above.
* <big><b> '''/''' </b></big> means division.
2013-04-10 23:57:08 -07:00
;See also:
2016-12-05 22:15:40 +01:00
* [[Parsing/Shunting-yard algorithm]] for a method of generating an RPN from an infix expression.
* Several solutions to [[24 game/Solve]] make use of RPN evaluators (although tracing how they work is not a part of that task).
* [[Parsing/RPN to infix conversion]].
* [[Arithmetic evaluation]].
<br><br>
