C++ Program to check for balanced parentheses in an expression using stack.

c++ proper implementation for balanced paranthesis

#include iostream
#include stack
#include string.h
using namespace std;
void check(char c[],int n)
{
int i;
stack s;
for(i=0;i<n;i++){
if(c[i]=='('|| c[i]=='{' || c[i]=='[')
{
s.push(c[i]);
}
else if(c[i]==')' && s.top()=='(')
{
s.pop();
}
else if(c[i]=='}' && s.top()=='{')
{
s.pop();
}
else if(c[i]==']' && s.top()=='[')
{
s.pop();
}

}
if(s.empty()==true )
{
    printf(" balanced");
}
else
{
    printf(" not balanced");
}

}

int main()
{
char c[100];
int i,n;
printf("enter the expression");
gets(c);
n=strlen(c);
check(c,n);
}

• Tweet
• Share
• Share
• Share
• Share

About Admin MC3

This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.

Related Post