C++ Programming, TOPIC: Stack queue and deque Improve the error code below. See attached photo for the instructions and some of the errors. main.cpp #include #include #include "sllstack.h" using namespace std; int main(int argc, char** argv) { SLLStack* stack = new SLLStack(); int test; string str; cin >> test; switch (test) { case 0: bool ispar(string x); string x=str; stack s; for(int i=0;ipush('a'); stack->push('b'); stack->push('c'); cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 2: stack->push('5'); stack->push('3'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('7'); stack->push('9'); stack->push('4'); cout << stack->pop() << endl; stack->push('6'); stack->push('8'); cout << stack->pop() << endl; cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 3: stack->push('a'); stack->push('b'); stack->push('c'); cout << stack->pop() << endl; stack->push('d'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('e'); stack->push('f'); cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 4: stack->push('C'); cout << stack->pop() << endl; stack->push('L'); stack->push('K'); stack->push('N'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('O'); stack->push('V'); stack->push('W'); cout << stack->pop() << endl; stack->push('E'); cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 5: stack->push('B'); cout << stack->pop() << endl; stack->push('K'); stack->push('H'); stack->push('V'); stack->push('O'); stack->push('C'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('P'); stack->push('E'); cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 6: stack->push('g'); stack->push('h'); stack->push('i'); stack->push('j'); stack->push('k'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('l'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('m'); stack->push('n'); cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; } return 0; }
C++ Programming, TOPIC: Stack queue and deque Improve the error code below. See attached photo for the instructions and some of the errors. main.cpp #include #include #include "sllstack.h" using namespace std; int main(int argc, char** argv) { SLLStack* stack = new SLLStack(); int test; string str; cin >> test; switch (test) { case 0: bool ispar(string x); string x=str; stack s; for(int i=0;ipush('a'); stack->push('b'); stack->push('c'); cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 2: stack->push('5'); stack->push('3'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('7'); stack->push('9'); stack->push('4'); cout << stack->pop() << endl; stack->push('6'); stack->push('8'); cout << stack->pop() << endl; cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 3: stack->push('a'); stack->push('b'); stack->push('c'); cout << stack->pop() << endl; stack->push('d'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('e'); stack->push('f'); cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 4: stack->push('C'); cout << stack->pop() << endl; stack->push('L'); stack->push('K'); stack->push('N'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('O'); stack->push('V'); stack->push('W'); cout << stack->pop() << endl; stack->push('E'); cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 5: stack->push('B'); cout << stack->pop() << endl; stack->push('K'); stack->push('H'); stack->push('V'); stack->push('O'); stack->push('C'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('P'); stack->push('E'); cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; case 6: stack->push('g'); stack->push('h'); stack->push('i'); stack->push('j'); stack->push('k'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('l'); cout << stack->pop() << endl; cout << stack->pop() << endl; stack->push('m'); stack->push('n'); cout << stack->size() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->pop() << endl; cout << stack->isEmpty() << endl; break; } return 0; }
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
C++ Programming,
TOPIC: Stack queue and deque
Improve the error code below. See attached photo for the instructions and some of the errors.
main.cpp
#include <iostream>
#include <cstring>
#include "sllstack.h"
using namespace std;
int main(int argc, char** argv) {
SLLStack* stack = new SLLStack();
int test;
string str;
cin >> test;
switch (test) {
case 0:
bool ispar(string x);
string x=str;
stack<char> s;
for(int i=0;i<x.length();++i)
{
if(x[i]=='(' or x[i]=='{' or x[i]=='[')
s.push(x[i]);
else if (x[i]==')' and !s.empty())
{
if(s.top()!='(')
return false;
s.pop();
}
else if(x[i]=='}' and s.empty()!=1)
{
if(s.top()!='{')
return false;
s.pop();
}
else if(x[i]==']' and s.empty()!=1)
{
if(s.top()!='[')
return false;
s.pop();
cout<<"Not accepted"<<endl;
}
else
return false;
}
return (s.empty());
cout<<"accepted";
break;
case 1:
stack->push('a');
stack->push('b');
stack->push('c');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->isEmpty() << endl;
break;
case 2:
stack->push('5');
stack->push('3');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
stack->push('7');
stack->push('9');
stack->push('4');
cout << stack->pop() << endl;
stack->push('6');
stack->push('8');
cout << stack->pop() << endl;
cout << stack->size() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->isEmpty() << endl;
break;
case 3:
stack->push('a');
stack->push('b');
stack->push('c');
cout << stack->pop() << endl;
stack->push('d');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
stack->push('e');
stack->push('f');
cout << stack->size() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->isEmpty() << endl;
break;
case 4:
stack->push('C');
cout << stack->pop() << endl;
stack->push('L');
stack->push('K');
stack->push('N');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
stack->push('O');
stack->push('V');
stack->push('W');
cout << stack->pop() << endl;
stack->push('E');
cout << stack->size() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->isEmpty() << endl;
break;
case 5:
stack->push('B');
cout << stack->pop() << endl;
stack->push('K');
stack->push('H');
stack->push('V');
stack->push('O');
stack->push('C');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
stack->push('P');
stack->push('E');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->size() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->isEmpty() << endl;
break;
case 6:
stack->push('g');
stack->push('h');
stack->push('i');
stack->push('j');
stack->push('k');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
stack->push('l');
cout << stack->pop() << endl;
cout << stack->pop() << endl;
stack->push('m');
stack->push('n');
cout << stack->size() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->pop() << endl;
cout << stack->isEmpty() << endl;
break;
}
return 0;
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY