Program Plan - Define a char array exp[1000] for storing expression. Use an array buffer to read integer values larger than one digit. Add values to a stack defined as a vector of integers stack<int> s; To check if an entered character is an operator define a function bool isOperator ( char ch), which returns true or false. To perform postfix operation define one more function performOperation() which does post fix operation. Program Description - The objective of this program is to allow postfix operation to be performed if the operand is greater than 9. 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 #include<stdio.h> #include<iostream> #include<stdlib.h> #include"Stack.h" #include<string.h> usingnamespace std; boolisOperator(charch) { if(ch=='+'||ch=='-'||ch=='*'||ch=='/') returntrue; else returnfalse; } intperformOperation(int op1,int op2,char op) { intans; switch(op){ case'+': ans= op2 + op1; break; case'-': ans= op2 - op1; break; case'*': ans= op2 * op1; break; case'/': ans= op2 / op1; break; } returnans; } intmain() { charexp[1000], buffer[15]; inti,op1, op2,len, j, x; Stack<int> s; printf("Enter a Postfix Expression: ( e.g. 17 4 * 4 + )\n"); gets(exp); len=strlen(exp); j =0; for(i=0;i<len;i++){ if(exp[i]>='0'&& exp[i]<='9'){ buffer[j++]= exp[i]; } elseif(exp[i]==' '){ if(j>0){ buffer[j]='\0'; x =atoi(buffer); s.push(x); j =0; } } elseif(isOperator(exp[i])){ op1 =s.pop(); //s.pop(); op2 =s.pop(); //s.pop(); intpushValue=performOperation(op1, op2, exp[i]); s.push(pushValue); } } printf("Answer is %d\n"); s.print(); return0; } Sample Output: Enter a Postfix Expression: ( e.g. 17 4 * 4 + ) 17 4 * 4 + The stack is: 72

C++ How to Program (10th Edition)

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

See similar textbooks

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 19, Problem 19.13E

Chapter 19, Problem 19.15E

Students have asked these similar questions

Lab 07: Java Graphics (Bonus lab) In this lab, we'll be practicing what we learned about GUIs, and Mouse events. You will need to implement the following: ➤ A GUI with a drawing panel. We can click in this panel, and you will capture those clicks as a Point (see java.awt.Point) in a PointCollection class (you need to build this). о The points need to be represented by circles. Below the drawing panel, you will need 5 buttons: о An input button to register your mouse to the drawing panel. ○ о о A show button to paint the points in your collection on the drawing panel. A button to shift all the points to the left by 50 pixels. The x position of the points is not allowed to go below zero. Another button to shift all the points to the right 50 pixels. The x position of the points cannot go further than the You can implement this GUI in any way you choose. I suggest using the BorderLayout for a panel containing the buttons, and a GridLayout to hold the drawing panel and button panels.…

If a UDP datagram is sent from host A, port P to host B, port Q, but at host B there is no process listening to port Q, then B is to send back an ICMP Port Unreachable message to A. Like all ICMP messages, this is addressed to A as a whole, not to port P on A. (a) Give an example of when an application might want to receive such ICMP messages. (b) Find out what an application has to do, on the operating system of your choice, to receive such messages. (c) Why might it not be a good idea to send such messages directly back to the originating port P on A?

Discuss how business intelligence and data visualization work together to help decision-makers and data users. Provide 2 specific use cases.

Knowledge Booster

Solution Summary: The author explains the purpose of the program, which is to allow postfix operation to be performed if the operand is greater than 9.

Want to see the full answer?

Chapter 19 Solutions