/* Sample Output: Enter infix expression {[a+b-(c/d)+e]} {[a+b-(c/d)+e]} is continuos for paranthesis Enter infix expression [a+b(c-d}+f) [a+b(c-d}+f) is not continuos for paranthesis Enter infix expression a-[b*(c-{d=e-f+(k*l)})] a-[b*(c-{d=e-f+(k*l)})] is continuos for paranthesis */ #include using namespace std; #include #define MAX 50 /*created stack structure It follows Last in first out LIFO approach*/ typedef struct stack { char s[MAX]; int tos; }stack; /*Push function is used to add element to stack */ void push(stack*t,char ele) { t->s[++t->tos]=ele; } /*Isempty function is used to check stack is empty or not*/ int isempty(stack*t) { return (t->tos==-1); } /*Pop function is used to remove element from stack */ char pop(stack *t) { if(isempty(t)) return -1; else { t->tos--; return (t->s[t->tos+1]); } } /*check function is used to check validity of paranthesis*/ int check(char in[]) { stack x; int i,l=strlen(in); char ele; x.tos=-1; for (i=0; i> infix ; if(check(infix)) cout<< infix <<"continuos for paranthesis.\nValid expression"; else cout<< infix <<" is not continuos for paranthesis.\nInvalid expression"; return 0; }

continuity of paranthesis