Skip to main content

Engineering Computer Science C++ How To Program Plus Mylab Programming With Pearson Etext -- Access Card Package (10th Edition)

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

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(StackNodenPtr) { nextPtr=nPtr; }//end function StackNodegetNextPtr()const { returnnextPtr; } private: T data; StackNodenextPtr; }; // 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(charconst); 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(charconst 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

Solution Summary: The author describes how the program evaluates the postfix expression that has a single-digit operand using stacks.

C++ How To Program Plus Mylab Programming With Pearson Etext -- Access Card Package (10th Edition)

C++ How To Program Plus Mylab Programming With Pearson Etext -- Access Card Package (10th Edition)

10th Edition

ISBN: 9780134583006

Author: Deitel

Publisher: PEARSON

See similar textbooks

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

Blurred answer

Chapter 19, Problem 19.12E

Chapter 19, Problem 19.14E

Students have asked these similar questions

Please answer the question correctly please. Thank you!!

Please answer the question correctly please. Thank you!!

Please solve and answer the questions correctly please. Thank you!!

Chapter 19 Solutions

C++ How To Program Plus Mylab Programming With Pearson Etext -- Access Card Package (10th Edition)

Ch. 19 - Prob. 19.6E Ch. 19 - Prob. 19.7E Ch. 19 - Prob. 19.8E Ch. 19 - Prob. 19.9E Ch. 19 - Prob. 19.10E Ch. 19 - Prob. 19.11E Ch. 19 - (Infix-to-Post fix conversion) Stacks are used by...Ch. 19 - Prob. 19.13E Ch. 19 - Prob. 19.14E Ch. 19 - Prob. 19.15E

Ch. 19 - Prob. 19.16E Ch. 19 - Prob. 19.17E Ch. 19 - (Duplicate Elimination) In this chapter, we saw...Ch. 19 - Prob. 19.19E Ch. 19 - Prob. 19.20E Ch. 19 - Prob. 19.21E Ch. 19 - Prob. 19.22E Ch. 19 - Prob. 19.23E Ch. 19 - Prob. 19.24E Ch. 19 - Prob. 19.25E Ch. 19 - Prob. 19.26E Ch. 19 - Prob. 19.27E Ch. 19 - Prob. 19.28E

Knowledge Booster

Background pattern image

Similar questions

SEE MORE QUESTIONS

Recommended textbooks for you

C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage

Text book image

C++ for Engineers and Scientists

Computer Science

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Course Technology Ptr

Text book image

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

Text book image

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

Text book image

Microsoft Visual C#

Computer Science

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Cengage Learning,

Text book image

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

Text book image

Np Ms Office 365/Excel 2016 I Ntermed

Computer Science

ISBN:9781337508841

Author:Carey

Publisher:Cengage

SEE MORE TEXTBOOKS