顺序栈的应用-括号匹配

#include<stdio.h>
#define MAXSIZE 100
typedef struct {
char a[MAXSIZE];
int top;
}sequence_stack;


void init(sequence_stack *st)//栈的初始化
{
st->top = 0;
}




int empty(sequence_stack st)//判断栈是否为空
{
return (st.top ? 0 : 1);
}




char read(sequence_stack st)//读取栈顶元素
{
if (empty(st) == 1)
return '0';
else
return st.a[st.top-1];
}




void push(sequence_stack *st, char x)//插入元素
{
if (st->top == MAXSIZE)
{
printf("栈已满，无法进行插入操作！\n");
exit(1);
}
st->a[st->top] = x;
st->top = st->top+ 1;
}


void dele(sequence_stack *st)//删除栈顶元素
{
if (empty(*st) == 1)
{
printf("栈为空，无法进行删除操作！\n");
}
st->top= st->top- 1;
}


int match(char c[])
{
sequence_stack S;
init(&S);
int i = 0;
while (c[i] != '#')
{
switch (c[i])
{
case '{':
case '[':
case '(':push(&S, c[i]); break;
case '}': if (read(S) == '{')
{
dele(&S); break;
}
else
return 0;
case ']': if (read(S) == '[')
{
dele(&S);
break;
}
else
return 0; 
case ')': if (read(S) == '(')
{
dele(&S);
break;
}
  else
return 0; 
}
++i;
}
return empty(S);
}


void main()
{
char c[MAXSIZE];
char ch;
int i = 0;
while (1)
{
ch = getchar();
if (ch == '{' || ch == '[' || ch == '(' || ch == '}' || ch == ']' || ch == ')')
{
c[i] = ch;
++i;
}
else
if (ch == '#')
{
c[i] = ch;
++i;
break;
}
}
c[i] = '\0';
int j = 0;
printf("输入的内容是：");
for (; c[j] != '\0'; j++)
printf("%c  ", c[j]);
printf("\n");
int q = match(c);
if(q==1)
printf("所输入的括号能够匹配\n");
if (q == 0)
printf("所输入的括号不能匹配\n");
}