Homework Answers | Homework Help

Questions

Please complete it in C++ Part 1: Stack Create a New Project and give your project...

Please complete it in C++

Part 1: Stack

Create a New Project and give your project a name, say Lab6a.
Download the given source files StackArr.h and StackArr.cpp from Moodle and save them to your Lab6a folder. Also import them to your project.
Add a source file to your project, called StackMain.cpp and implement your program according to the following:
1. Prompt the user to input a program filename.
2. Open the file and check if every right brace (i.e. }), bracket (i.e. ]), and parenthesis (i.e. )) in the file correspond to its left counterpart or not.
3. If the program file passed the checking, output "The code is correct". Otherwise, output "The code is incorrect".

The algorithm for checking is as follows:

Make an empty stack
Read characters until the end of program file
1. if the character is an opening symbol, push it onto the stack;
2. if it is a closing symbol and if the stack is empty, output "Error: Empty stack";
3. otherwise, pop the stack. If the symbol popped is not the corresponding opening symbol, output "Error: Not equal".

At the end of the file, if the stack IS NOT EMPTY, output "The code is incorrect". Otherwise, output "The code is correct".

Use the provided files, testfile1.txt and testfile2.txt to test your program. The code file testfile1.txt is correct, while the code file testfile2.txt is incorrect.

Useful code:

#include <fstream>

string readFile() {

string tempString = "";

string filename;

cout << "Input file name: ";

cin >> filename;

ifstream inputFile(filename);

// Prompt user again if wrong filename received

while (!inputFile.good()) {

cout << "Wrong file name, input again please: ";

cin >> filename;

inputFile.open(filename);

}

// Append all lines from the file into a long string

while ((!inputFile.eof())) {

string str;

getline(inputFile, str);

tempString += str;

}

return tempString;

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include "StackArr.h"
#include <string>
#include <iostream>

using namespace std;

StackArr::StackArr(int size) {
   maxTop = size;
   values = new char[size];
   stackTop = -1;
}

StackArr::~StackArr() {
delete[] values;
}

bool StackArr::isEmpty() const {
return stackTop == -1;
}

bool StackArr::isFull() const {
return stackTop == maxTop;
}

void StackArr::push(const char& x) {
   if (isFull())
       cout << "Error! The stack is full!" << endl;
   else
       values[++stackTop] = x;
}

char StackArr::pop() {
   if (isEmpty()) {
       cout << "Error! The stack is empty!" << endl;
       return -1;
   }
   else
       return values[stackTop--];
}

char StackArr::top() const {
   if (isEmpty()) {
       cout << "Error! The stack is empty!" << endl;
       return -1;
   }
   else
       return values[stackTop];
}

void StackArr::displayStack() const {
   cout << "Top -->";
   for (int i = stackTop; i >= 0; i--)
       cout << "\t|\t" << values[i] << "\t|" << endl;
   cout << "\t|---------------|" << endl;
}

#include "StackArr.h"
#include <string>
#include <iostream>

using namespace std;

StackArr::StackArr(int size)
   maxTop = size;
   values = new char[size];
   stackTop = -1;
}

StackArr::~StackArr() {
delete[] values;

bool StackArr::isEmpty() const {
return stackTop == -1;
}

bool StackArr::isFull() const {
return stackTop == maxTop;
}

void StackArr::push(const char& x) {
   if (isFull())
       cout << "Error! The stack is full!" << endl;
   else
       values[++stackTop] = x;
}

char StackArr::pop() {
   if (isEmpty()) {
       cout << "Error! The stack is empty!" << endl;
       return -1;
   }
   else
       return values[stackTop--];
}

char StackArr::top() const {
   if (isEmpty()) {
       cout << "Error! The stack is empty!" << endl;
       return -1;
   }
   else
       return values[stackTop];
}

void StackArr::displayStack() const {
   cout << "Top -->";
   for (int i = stackTop; i >= 0; i--)
       cout << "\t|\t" << values[i] << "\t|" << endl;
   cout << "\t|---------------|" << endl;
}

//StackArr.h

#ifndef STACKARR_H
#define STACKARR_H

class StackArr {
private:
   int maxTop;
   int stackTop;
   char *values;

public:
   StackArr(int);
   ~StackArr();
   bool isEmpty() const;
   bool isFull() const;
   char top() const;
   void push(const char& x);
   char pop();
   void displayStack() const;
};

#endif
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////StackArr.cpp

#include "StackArr.h"
#include <string>
#include <iostream>

using namespace std;

StackArr::StackArr(int size) {
   maxTop = size;
   values = new char[size];
   stackTop = -1;
}

StackArr::~StackArr() {
delete[] values;
}

bool StackArr::isEmpty() const {
return stackTop == -1;
}

bool StackArr::isFull() const {
return stackTop == maxTop;
}

void StackArr::push(const char& x) {
   if (isFull())
       cout << "Error! The stack is full!" << endl;
   else
       values[++stackTop] = x;
}

char StackArr::pop() {
   if (isEmpty()) {
       cout << "Error! The stack is empty!" << endl;
       return -1;
   }
   else
       return values[stackTop--];
}

char StackArr::top() const {
   if (isEmpty()) {
       cout << "Error! The stack is empty!" << endl;
       return -1;
   }
   else
       return values[stackTop];
}

void StackArr::displayStack() const {
   cout << "Top -->";
   for (int i = stackTop; i >= 0; i--)
       cout << "\t|\t" << values[i] << "\t|" << endl;
   cout << "\t|---------------|" << endl << endl;

}

In: Computer Science

In what manner are firms investing or using “offshore cash” being brought back into the United...

In what manner are firms investing or using “offshore cash” being brought back into the United States?

In: Operations Management

In the divisional structure, if there were a separate sales organization responsible for providing revenue for...

In the divisional structure, if there were a separate sales organization responsible for providing revenue for each of the divisions, what are advantages and disadvantages of such a structure?

What if the structure was that way from the outset and an acquisition was made of a company with its own sales force. how hard would it be to integrate the acquired company into the new structure?

In: Operations Management

.Define sexuality.

In: Psychology