程序设计 括号匹配问题

#include <stdio.h>
#include<stdlib.h>
#include<string.h>
typedef char StackItem;
typedef struct astack *Stack;
typedef struct astack {
int top,maxtop;
StackItem *data;
}Astack;
void Error(char *s)
{
printf("%s",s);
// exit(1);
}
Stack StackInit(int size)
{
Stack S=(Stack)malloc(sizeof astack);
S->data=(StackItem*)malloc(size*sizeof(StackItem));
S->maxtop=size;
S->top=-1;
return S;
}
int StackEmpty(Stack S)
{
return S->top<0;
}
int StackFull(Stack S)
{
return S->top==S->maxtop;
}
StackItem StackTop(Stack S)
{
if(StackEmpty(S))Error("Stack is empty");
else return S->data[S->top];
}
void Push(StackItem x,Stack S)
{
if(StackFull(S))Error("Stack is full");
else S->data[++S->top]=x;
}
StackItem Pop(Stack S)
{
if(StackEmpty(S)) Error("Stack is empty");
else return S->data[S->top--];
}
void Parenthsis(char *expr)
{
int i,n;
Stack ss=StackInit(100);
n=strlen(expr);
for(i=1;i<=n;i++)
{
if(expr[i-1]=='(')Push(i,ss);
else if(expr[i-1]==')')
{
if(StackEmpty(ss))
{
printf("the right square at position %d is not matched \n",i);
}
else
printf("%d %d \n",Pop(ss),i);
}
}
while(!StackEmpty(ss))
printf("the left square at position %d is not matched \n",Pop(ss));

}

int main(int argc, char* argv[])
{
char s[40];
printf("Please input a formula including parenthsis:\n");
scanf("%s",s);
Parenthsis(s);
scanf("%s",s);
return 0;
}

用栈实现，不是很复杂的！有时间了再给你传吧！

编译原理的作业吧，代码很复杂，就不写了