数据结构-判别括号配对.doc

武汉理工大学数据结构课程设计附表：1.源程序：#include#include#include#define MAX_STACK_SIZE 100typedef struct SqStack char data;struct SqStack *next;SqStack;/链元素typedef struct Stack struct SqStack *base; /栈底指针struct SqStack *top; /栈顶指针Stack;/栈Stack S;int a,Aj=0;/全局变量char string100;typedef struct nodechar key;element_tr;/运算符栈typedef struct Nodeint data;element_nd;/操作数元素void creatstack(Stack &S)S.top=S.base=NULL;/建立初始化链栈void push(Stack &S,char e)SqStack* Q;Q=(SqStack*)malloc(sizeof(SqStack);Q-next=S.top;S.top=Q;S.top-data=e;+Aj;/左括号入栈char Pop(Stack &S) char e;SqStack *q;e=S.top-data;q=S.top-next;free(S.top);S.top=q;return e;/括号出栈int check( ) a=1,Aj=0;int w=0;char sh,ch,*st,*stt;printf(请输入算术表达式并以“=”结束输入:n);scanf(%s,string);getchar();st=stt=string;ch=*st;sh=*+stt;while(ch!=)if(w=0)if(ch=|ch=|ch=)a=-1;Aj=1;if(ch=|ch=(|ch=)&(sh=)a=-1;Aj+;break;if(a=-1)break;w+;if(ch=|ch=(|ch=|ch=|ch=|ch=)/判断是否满足入栈和出栈条件switch(ch)case : push(S,ch);break;case : push(S,ch);break;case (: push(S,ch);break;/左括号入栈case : if(Pop(S)!=)a=-1;Aj+;break;else Aj+;break;case ): if( Pop(S)!=()a=-1;Aj+;break;elseAj+;break;case : if( Pop(S)!=)a=-1;Aj+;break;elseAj+;break;/出栈并与字符ch匹配比较ch=*(+st);sh=*(+stt);if(S.base=S.top)&(ch=|ch=|ch=)a=-1;Aj+;if(a=-1)break;if(S.base!=S.top)a=-1;return a;void main()/主函数int st;char w=y;printf(n*括号配对判别*n);LL :while(w!=n&w!=N)creatstack(S);st=check();if(st=-1)printf(表达式中第( %d )个括号与对应括号不匹配,请重新输入n,Aj);goto LL;else printf(表达式中括号匹配