Breaking News: Grepper is joining You.com. Read the official announcement!

C Algorithm for well formedness of paranthesis

Elated Eagle answered on August 24, 2022 Popularity 1/10 Helpfulness 1/10

answer C Algorithm for well formedness of paranthesis

C Algorithm for well formedness of paranthesis

Comment

// C program  to check the balanced parenthesis.  
#include<stdio.h> 
#include<string.h>
int main()  
{  
    char expression[50]; // declaration of char type array  
    int x=0, i=0; // declaration of two integer type variables  
    printf("\nEnter an expression");  
    scanf("%s", expression);  
// Scanning the expression until we reach the end of the expression.     
 while(expression[i]!= '\0')  
    {  
    // Condition to check the symbol is '('     
     if(expression[i]=='(')  
        {  
            x++;    // incrementing 'x' variable   
        }  
     // condition to check the symbol is ')'     
     else if(expression[i]==')')  
        {  
            x--;   // decrementing 'x' variable  
            if(x<0)  
            break;  
        }  
    i++;       // incrementing 'i' variable.  
    }  
    // Condition to check whether x is equal to 0 or not.  
    if(x==0)  
    {  
        printf("Expression is balanced");  
    }  
      
    else  
    {  
        printf("Expression is unbalanced");  
    }  
    return 0;  
}

Popularity 1/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: algorithm c whatever

Link to this answer
Share Copy Link

Contributed on Aug 24 2022

Elated Eagle

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

C Algorithm for well formedness of paranthesis

Contents

More Related Answers

C Algorithm for well formedness of paranthesis

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.