C++ Write a program that takes as input an arithmetic expression followed by a semicolon ;. The program outputs whether the expression contains matching grouping symbols. For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols. However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols. If the expression contains matching grouping symbols, the program output should contain the following text: Expression has matching grouping symbol If the expression does not contain matching grouping symbols, the program output should contain the following text: Expression does not have matching grouping symbols
C++
Write a program that takes as input an arithmetic expression followed by a semicolon ;.
The program outputs whether the expression contains matching grouping symbols.
For example, the arithmetic expressions {25 + (3 – 6) * 8} and 7 + 8 * 2 contains matching grouping symbols.
However, the expression 5 + {(13 + 7) / 8 - 2 * 9 does not contain matching grouping symbols.
If the expression contains matching grouping symbols, the program output should contain the following text:
Expression has matching grouping symbol
If the expression does not contain matching grouping symbols, the program output should contain the following text:
Expression does not have matching grouping symbols.
![main.cpp
myStackh
stackA)Th
+
main.cpp
3 #1jnaеJ H_StackType
4 #define H_StackType
myStack.h
6 #include <iostream>
7 #include <cassert>
8
9 #include "stackADT.h"
10
11 using namespace std;
12
38
13 template <class Type>
14 class stackType: public stackADT<Type>
15 {
16 public:
17 const stackType<Type>& operator= (const stackType<Type>&);
18
19
void initializeStack();
bool isEmptyStack() const;
bool isFullStack() const;
stackADT.h
void push(const Type& newItem);
Type top() const;
void pop();
stackType(int stackSize = 100);
stackType(const stackType<Type>& otherStack);
~stackType();
template <class Type>
void stackType<Type>::initializeStack()
{
1}
stackTop = 0;
template <class Type>
bool stackType<Type>::1sEmptyStack() const
3 {
return(stackTop == 0);
>}
template <class Type>
bool stackType<Type>::isFullStack() const
H{
return(stackTop==maxStackSize);
3}
+
template <class Type>
void stackType<Type>::push(const Type& newItem)
}{
Instructions
Instructions
Write a program that takes as input an arithmetic expression followed by
a semicolon ;
The program outputs whether the expression contains matching
grouping symbols.
For example, the arithmetic expressions (25+ (3-6)* 8} and
7 + 8 * 2 contains matching grouping symbols.
However, the expression 5 + {(13 + 7) / 8 - 2* 9 does not
contain matching grouping symbols.
If the expression contains matching grouping symbols, the program
output should contain the following text:
Expression has matching grouping symbol
If the expression does not contain matching grouping symbols, the
program output should contain the following text:
Expression does not have matching grouping symbols.
main.cpp
myStack.h
1 //Header file: stackADT.h
2
3 #ifndef H_StackADT
4 #define H_StackADT
5
6 template <class Type>
7 class stackADT
8
9 public:
10
11
12
13
14
15
16
17
18
19
virtual void initializeStack() = 0;
virtual bool isEmptyStack() const = 0;
virtual bool isFullStack() const = 0;
virtual void push(const Type& newItem) = 0;
virtual Type top() const = 0;
stackADT.h
20
21
22
23
24
25 };
26
27 #endif
28
virtual void pop() = 0;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fdf5ed780-1f6f-4967-98f6-5be55b32abf1%2F0b3031c2-f6eb-4910-8232-75125b7e5b3a%2Fv55gdr8_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)