Program Plan : 1. Define the StackNode class. 2. Define the Stack class. 3. Create a function evaluatePostFixExpression to evaluate the given postfix expression. 4. Read the input parameters and arrange them in postfix operation. 5. Display output. Program Description : This program evaluates the postfix expression that has a single-digit operand using stacks. Program: //File: Stack.h //Template Stack Class Definition #ifndef STACK_H #define STACK_H #include<iostream> usingstd::cout; #include<new> #include "StackNode.h" template<typename T> class Stack { public: Stack(); ~Stack(); voidpush(T &); T pop(); boolisEmpty()const; T stackTop()const; voidprint()const; StackNode<T>*getTopPtr()const { returntopPtr; } private:StackNode<T>*topPtr; };//end class template stack //member function definitions template<typename T> Stack <T>:: Stack() { topPtr=0; } template<typename T> Stack <T>::~Stack() { StackNode<T>*tempPtr,*currentPtr=topPtr; while(currentPtr!=0) { tempPtr=currentPtr; currentPtr=currentPtr->getNextPtr(); deletetempPtr; }//end while }//end destructor //push node template<typename T> void Stack<T>::push (T &d) { StackNode<T>*newPtr=newStackNode<T>(d,topPtr); topPtr=newPtr; }//end function push //pop node template<typename T> T Stack<T>::pop() { StackNode<T>*tempPtr=topPtr; topPtr=topPtr->nextPtr; T poppedValue=tempPtr->data; deletetempPtr; returnpoppedValue; }//end function pop //is stack empty template<typename T> bool Stack<T>::isEmpty()const { returntopPtr==0; }//end function template<typename T> T Stack<T>::stackTop()const { return isEmpty()?getTopPtr()->getData():static_cast<T>(0); }//end function stackTop //display stack template<typename T> void Stack<T>::print()const { StackNode<T>*currentPtr=topPtr; if(isEmpty()) cout<<"Stack is empty"; else { cout<<"The stack is: \n"; while(currentPtr!=0) { cout<<currentPtr->data <<" "; currentPtr=currentPtr->nextPtr; }//end while cout<<"\n"; } } #endif //File:StackNode.h //Template StackNode Class definition #ifndef STACKNODE_H #define STACKNODE_H template<typename T>class Stack;//forward declaration template<typename T> classStackNode { friendclass Stack<T>; public: StackNode(const T &,StackNode*); T getData()const; //set point to next stack node voidsetNextPtr(StackNode*nPtr) { nextPtr=nPtr; }//end function StackNode*getNextPtr()const { returnnextPtr; } private: T data; StackNode*nextPtr; }; // Member function definitions template<typename T> StackNode<T>::StackNode(const T &d,StackNode<T>*ptr) { data=d; nextPtr=ptr; }//end constructor //get data template<typename T> T StackNode<T>::getData()const { return data; }//end function getData #endif //Main Program #include <iostream> usingstd::cin; usingstd::cout; usingstd::endl; #include<cctype> usingstd::isdigit; #include<cmath> usingstd::pow; #include "Stack.h" //prototype intevaluatePostFixExpression(char*const); intcalculate(int,int,char); intmain() { charexpression[100]; char c; int answer =100; inti=0; cout<<"Enter a postfix expression:\n"; //get input while((c=static_cast<char>(cin.get()))!='\n') { if(c!=' ') expression[i++]=c; } expression[i]='\0'; answer=evaluatePostFixExpression(expression); cout<<"The value of the expression is:"<<answer<<endl; return0; } //end main //function definitions intevaluatePostFixExpression(char*const expr) { int j; int popValue1, popValue2,pushValue; intfinalVal=0; Stack<int>intStack; char c; //until it reaches ')' for(j=0;(c=expr[j])!='\0';j++) { if(isdigit(expr[j])) { pushValue= c-'0'; intStack.push(pushValue); intStack.print(); } else { popValue2=intStack.pop(); popValue1=intStack.pop(); if(c=='+'){ pushValue= popValue1 + popValue2; } elseif(c=='-'){ pushValue= popValue1 - popValue2; } elseif(c=='*'){ pushValue= popValue1 * popValue2; } elseif(c=='/'){ pushValue= popValue1 / popValue2; } elseif(c=='%'){ pushValue= popValue1 % popValue2; } elseif(c=='^'){ pushValue=pow(popValue1, popValue2); } else{ cout<<"System error"<<endl; } intStack.push(pushValue); intStack.print(); } } returnpushValue; } Sample Output: Enter a postfix expression: 6 2 + 5 * 8 4 / - The stack is: 6 The stack is: 2 6 The stack is: 8 The stack is: 5 8 The stack is: 40 The stack is: 8 40 The stack is: 4 8 40 The stack is: 2 40 The stack is: 38 The value of the expression is:38

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

Expert Solution & Answer

Students have asked these similar questions

Show all the work

Construct a frequency polygon density estimate for the sample in Question 1, using bin width determined by Sturges’ Rule.

Show all the work

Knowledge Booster

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you