Write a function that receives a string of characters as its input, and check if it is symmetric to a dollar sign. You may use following function header: bool isInLanguage_1(string aString) 2. Write a function that receives a string of characters and return true if the string is in language, otherwise it returns false. You may use following function header (Assume a string is in language if it is read from the left side is the same as it is read from the right side. For example, a-b-d-c is not in the language, a-b-c-a-c-b-a is in language): bool isInLanguage_2(string aString

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...
icon
Related questions
Question

1. Write a function that receives a string of characters as its input, and check if it is symmetric to a dollar sign. You may use following function header:

bool isInLanguage_1(string aString)

2. Write a function that receives a string of characters and return true if the string is in language, otherwise it returns false. You may use following function header (Assume a string is in language if it is read from the left side is the same as it is read from the right side. For example, a-b-d-c is not in the language, a-b-c-a-c-b-a is in language):

bool isInLanguage_2(string aString)

 

I tried using a while loop, but for some reason, I am not getting the output I was hoping for and would like you to check this out.

gint main() {
Stack<char> char_stack;
string contained_str;
cout « "Enter a string with $ sign: ";
<<
getline( &: cin, &: contained_str);
int i = 0;
while(contained_str[i] != '\®'){
cout « contained_str[i] « endl;
char_stack.push(contained_str[i]);
i++;
char_stack.isInLanguage_1(contained_str);
return 0;
Transcribed Image Text:gint main() { Stack<char> char_stack; string contained_str; cout « "Enter a string with $ sign: "; << getline( &: cin, &: contained_str); int i = 0; while(contained_str[i] != '\®'){ cout « contained_str[i] « endl; char_stack.push(contained_str[i]); i++; char_stack.isInLanguage_1(contained_str); return 0;
template <class ItemType>
bool Stack<ItemType>::isInLanguage_1(const string &containing_str) {
if (isEmpty()){
cout « "It is empty here!" « endl;
return false;
else{
if (items[containing_str] == '$'){
top--;
return true;
return false;
Transcribed Image Text:template <class ItemType> bool Stack<ItemType>::isInLanguage_1(const string &containing_str) { if (isEmpty()){ cout « "It is empty here!" « endl; return false; else{ if (items[containing_str] == '$'){ top--; return true; return false;
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY