2.2.6.2.2 Formula Evaluation

Evaluation of a formula specified in Reverse-Polish notation is usually based around an evaluation stack. Tokens are added to the evaluation stack as they are encountered in the Reverse-Polish notation and are removed as they are used in the evaluation. When expression evaluation is finished, there will be exactly one parse token left on the evaluation stack. This token is the result of the evaluation.