Question

c++

1) String format checker A string is referred to as A"B"A" if it contains n > 0 consecutive As followed by n consecutive Bs followed by n consecutive As. Your task is to accept an arbitrary string of any length 1 <k, and determine if it is of the form A"B"A" If it is, then the output of the program is be "Format is OK". Otherwise the output is "Format not acceptable." For example, The given the Linux prompt> If the file exp.dat contains: ./checkstring.dat AAABBBAAA The program output is: aaaa AAABBBAAA' == Format is OK ABAABBBBAAAA 'aaaa == Format not acceptable BBBB 'ABAABBBBAAAA' == Format not BBAABB acceptable BBAAABB 'BBBB' == Format not acceptable 'BBAABB Format not acceptable 'BBAAABB == Format not acceptable Notes: 1) The size of the input string is not bounded 2) You cannot use ADTs you have to provide a complete set of classes and functions "written from scratch" for your implementation. 3) You have to use a queue implemented via dynamic circular array and include a provision for resize in your implementation. Initialize the dynamic array to a size of 20. 4) You must use the flag method to check for overflow/underflow. 5) You have to supply the functions, IsEmpty, Top, Push, Pop, and IsFull as defined in the file lec08-Stacks - 202007010 under the notes in TRACS Resources 6) YOUR PROGRAM MUST COMPILE under CodeBlocks or under g++ on the department Linux server: if it does not compile it will not be graded and you will get a 1-as a warning. If YOU got it to compile, contact me asap and we will work it out. 7) Input to the program: Put a set of strings composed of the characters 'A' and 'B' in the input file, one string per line. The input file should be named exp.txt. The name can be hardwired into your program.

Answer 1

Here i am providing the answer. Hope it helps, please give me a like. it helps me a lot.

#include<iostream>
#include<fstream>

using namespace std;

//Queue class
class Queue
{
private:
//data members
int front, rear, count, capacity;
char *q;
public:
//constructor
Queue();
//public functions
void enqueue(char c);
char dequeue();
char getFront();
bool isEmpty();
void resize();
void reset();
};
//constructor
Queue::Queue()
{
capacity = 20;
q = new char[capacity];
front=rear=-1;
count=0;
}
//function enqueue
void Queue::enqueue(char c)
{
if(count==capacity)
resize();
rear = (rear+1)%capacity;
q[rear] = c;
count++;
}
//function dequeue
char Queue::dequeue()
{
if(isEmpty())
return ' ';
front = (front+1)%capacity;
count--;
return q[front];
}
//function return front value
char Queue::getFront()
{
if(isEmpty())
return ' ';
int tfront = (front+1)%capacity;
return q[tfront];
}
//function resize the queue
void Queue::resize()
{
int n = capacity;
capacity = capacity*2;
char *tmp = new char[capacity];
for(int i=0; i<n; i++)
{
tmp[i] = q[i];
}
delete []q;
q = tmp;
delete []tmp;
}
//function reset the queue
void Queue::reset()
{
count = 0;
front = rear = -1;
}
//function isEmpty return true when queue is empty
bool Queue::isEmpty()
{
return count==0;
}

//function returns true when a string format is valid otherwise false
bool isValid(string s, Queue q)
{
//enqueue all the characters of the string
for(int i=0; i<s.size(); i++){
q.enqueue(s[i]);
}

int n=0;
//count number of A at beginning
while(!q.isEmpty() && q.getFront()=='A')
{
q.dequeue();
n++;
}
//return false if the string is invalid
if(q.isEmpty()) return false;

int m = n;
//check n number of B in the middle
while(!q.isEmpty() && q.getFront()=='B')
{
q.dequeue();
n--;
}
//return false if the string is invalid
if(q.isEmpty() || n!=0) return false;
//check n number of A at end
while(!q.isEmpty() && q.getFront()=='A')
{
q.dequeue();
m--;
}
//return true if the string is valid
if(q.isEmpty() && m==0) return true;
//return false if the string is invalid
return false;
}

//main function
int main(int argc, char *argv[])
{
ifstream fin;
//check the number of arguments
if(argc<2)
{
cerr<<"Too few arguments!"<<endl;
return 1;
}
//open the file
fin.open(argv[1]);
//check file exist or not
if(!fin.is_open())
{
cerr<<"File not exist! "<<endl;
return 1;
}

Queue q;
string str;
while(1)
{
//read a string from the file
fin>>str;
//check end of file
if(fin.eof()) break;
//check the string format is valid or not
if(isValid(str, q)== true)
cout <<str << " == Format is OK"<<endl;
else
cout <<str << " == Format not acceptable"<<endl;
}
return 0;
}

exp.dat (input file)

AAABBBAAA
aaaa
ABAABBBBAAAA
BBBB

Output:

g++ stringFormatChecker.cpp

a exp.dat
AAABBBAAA == Format is OK
aaaa == Format not acceptable
ABAABBBBAAAA == Format not acceptable
BBBB == Format not acceptable

Thank you. please like.