Explain how a stack could be used in the process of evaluating an expression in Reverse Polish notation.

Starting at the left hand side of the expression push values onto stack. Each time operator reached in the expression pop the top two values off the stack and apply the operator to them, then push the new value back onto the stack. When the end of the expression is reached the final value on the stack is the final result.

EF

Related Computing A Level answers

All answers ▸

Discuss the differences between operating systems designed for desktop computers and embedded systems.


State the main features of a tree


What do I need to know about operating systems?


What are higher order functions in functional programming? How does the 'map' function work and why is it a higher order function?