括号匹配检验

教科书的例子：

head.h

#define OK 1
#define ERROR 0
#define STACKINITSIZE 100
#define STACKADD 10
typedef int Status;
typedef char SElemType;
typedef struct
{
	SElemType *base;
	SElemType *top;
	int stacksize;
}SqStack;
Status InitStack(SqStack &S);
Status StackEmpty(SqStack &S);
Status GetTop(SqStack &S,SElemType &e);
Status Push(SqStack &S,SElemType e);
Status Pop(SqStack &S,SElemType &e);

function.cpp

#include"head.h"
#include<iostream>
Status InitStack(SqStack &S)
{
	S.base=(SElemType*)malloc(STACKINITSIZE*sizeof(SElemType));
	S.top=S.base;
	S.stacksize=STACKINITSIZE;
	return OK;
}
Status StackEmpty(SqStack &S)
{
	if(S.base==S.top)
		return OK;
	else
		return ERROR;
}
Status GetTop(SqStack &S,SElemType &e)
{
	if(S.base==NULL)
		return ERROR;
	if(S.top==S.base)
		return ERROR;
	else
		e=*(S.top-1);
	return OK;
}
Status Push(SqStack &S,SElemType e)
{
	if(S.top-S.base>= STACKINITSIZE)
	{
		S.base=(SElemType*)realloc(S.base,(STACKINITSIZE+ STACKADD)*sizeof(SElemType));
		S.top=S.base+STACKINITSIZE;
		S.stacksize+=STACKADD;
	}
	*S.top++=e;
	return OK;
}
Status Pop(SqStack &S,SElemType &e)
{
	if(S.top==S.base)
		return ERROR;
	e=*--S.top;
	return OK;
}

main.cpp

#include"head.h"
#include<iostream>
using namespace std;
int main()
{
	SqStack S;
	InitStack(S);
	cout<<"请输入以#号结束的符号列："<<endl;
	char c;
	SElemType e;
	while((c=getchar())!='#')
	{
		if(c=='('||c=='['||c=='{')
		{
			Push(S,c);
			continue;
		}
		else if(c==')')
		{
			if(StackEmpty(S))
			{
				cout<<"不匹配！"<<endl;
				return ERROR;
			}
			 GetTop(S,e);
			 if(e!='(')
			 {
				cout<<"不匹配！"<<endl;
				return ERROR;
			 }
			 else
				 Pop(S,e);
		}
		else if(c==']')
		{
			if(StackEmpty(S))
			{
				cout<<"不匹配！"<<endl;
				return ERROR;
			}
			 GetTop(S,e);
			 if(e!='[')
			 {
				cout<<"不匹配！"<<endl;
				return ERROR;
			 }
			 else
				 Pop(S,e);
		}
		else if(c=='}')
		{
			if(StackEmpty(S))
			{
				cout<<"不匹配！"<<endl;
				return ERROR;
			}
			 GetTop(S,e);
			 if(e!='{')
			 {
				cout<<"不匹配！"<<endl;
				return ERROR;
			 }
			 else
				 Pop(S,e);
		}
	}
	if(!StackEmpty(S))
	{
		cout<<"不匹配！"<<endl;
		return ERROR;
	}
	else
		cout<<"匹配！"<<endl;
		return OK;
}