Application of Stack and Queue in slove it C++

Question

Write a code in C++ [using object oriented approach] that will take a mathematical expression as input and output whether the parentheses are balanced or not in the expression.                          [10 points]

Sample Input: (5 + (9-(3+2))+ 4)

Sample Output: Balanced 

Sample Input: (5 + (9-(3+2)+ 4)

Sample Output: Not Balanced

You have to submit the code along with the output of the code in reasonable detail in a single pdf file. Your code must contain comments as required.

Answer 1

using namespace std;

#include <iostream>

#include <stack>

#include <string.h>

bool checkParens(char * strMathExpression)

{

stack<int> _stack;

int x=1;

bool boolReturn=true;

int nStrLen = strlen(strMathExpression);

for (int iLoop=0; iLoop<nStrLen; iLoop++)

{

char chCurChar = strMathExpression[iLoop];

if (chCurChar=='(')

{

_stack.push(x);

}

if (chCurChar==')')

{

if (_stack.empty())

{

boolReturn=false;

break;

}

else

{

_stack.pop();

}

}

}

if (!_stack.empty())

{

boolReturn=false;

}

return( boolReturn);

}

int main()

{

char mathExpr[] = "(5 + (9-(3+2))+ 4)";

//char mathExpr[] = "(5 + (9-(3+2)+ 4)";

bool boolReturn = checkParens(mathExpr);

if (boolReturn)

{

cout << "BALANCED !!!" <<endl;

}

else

{

cout << "UNBALANCED:MIS-MATCHED PARENTHESIS " <<endl;

}

}