스택 괄호검사

수업시간에 배운 내용입니다^^

#include <stdio.h>
#include <string.h>
#define MAX_STACK_SIZE 100
#define TRUE 1
#define FALSE 0
 
typedef int element;
 
typedef struct {
    element stack[MAX_STACK_SIZE];
    int top;
} StackType;
 
void init(StackType *s){
    s->top = -1;
};
 
int is_full(StackType *s){
    if (s->top == (MAX_STACK_SIZE - 1))
        return TRUE;
    else
        return FALSE;
};
 
int is_empty(StackType *s){
    if (s->top == -1)
        return TRUE;
    else
        return FALSE;
};
 
void push(StackType *s,element x){
    if (is_full(s)){
        printf("error overflow");
    }else{
        s->top = s->top + 1;
        s->stack[s->top] = x;
    };
};
 
element pop(StackType *s){
    element e;
    if (is_empty(s)){
        printf("error underflow");
    }
    else{
        e = s->stack[s->top];
        s->top = s->top - 1;
        return e;
    };
};
 
int check_matching(char *in)
{
    StackType s;
    char ch, open_ch;
    int i, n = strlen(in);
    init(&s);
 
    for (i = 0; i < n; i++) {
        ch = in[i];
        switch (ch){
        case '(':   case '[':    case '{':
            push(&s, ch);
            break;
        case ')':   case ']':    case '}':
            if (is_empty(&s))  return FALSE;
            else {
                open_ch = pop(&s);
                if ((open_ch == '(' && ch != ')') || (open_ch == '[' && ch != ']') ||
                    (open_ch == '{' && ch != '}')) {
                    return FALSE;
                }
                break;
            }
        }
    }
    if (!is_empty(&s)) return FALSE;
    return TRUE;
}
 
void display(a){
    if (check_matching(a) == TRUE)
        printf("괄호검사성공\n");
    else
        printf("괄호검사실패\n");
}
int main()
{
    display("{ A[(i+1)]=0}(()); ");
}