C++ Evaluating Postfix Expressions

Implement the algorithm from section 6.3

Use an ArrayStack of ints

read a postfix string from the user - assume it is valid (this should be in a loop)

the string should only have single digits and no spaces

use + - * and /

Upload the driver file and several screenshots proving it works

This is the Algorithm from section 6.3

This is the array stack:

#include  // For assert #include "ArrayStack.h" // Header file template ArrayStack::ArrayStack() : top(-1) { } // end default constructor // Copy constructor and destructor are supplied by the compiler template bool ArrayStack::isEmpty() const { return top  bool ArrayStack::push(const ItemType& newEntry) { bool result = false; if (top  bool ArrayStack::pop() { bool result = false; if (!isEmpty()) { top--; result = true; } // end if return result; } // end pop template ItemType ArrayStack::peek() const { assert(!isEmpty()); // Enforce precondition // Stack is not empty; return top return items[top]; } // end peek // End of implementation file. 

$8E E rest operandi operard in push resu operand2 peek pop operandi - peek pop result = operandi operand2 (14) push result The pseudocode algorithm is then for (each character ch in the string) { if (ch is an operand) Push the value of the operand ch onto the stack else // ch is an operator named op [ 1 Evaluate and push the result operand2 = top of stack Pop the stack operand1 = top of stack Pop the stack result = operand1 op operand2 Push result onto the stack } } Upon termination of the algorithm, the value of the express Programming Problem 5 at the end of this chapter asks you ? Question 5 By using a stack, evaluate the postfi- following values for the identifiers: a = 7, b = 3, and after each step. CHECKPOINT 6.3.2 Converting Infix Expressions to Equivale Now that you know how to evaluate a postfix expressio expression if you first can convert it into an equivalent p