Initstacki&S);∥始化栈S while(ch= getchar0)=”mn”){ ∥以字符序列的形式输入表达式 switch(ch)t case {) Push(&S,ch) break;∥遇左括号入栈 ∥在遇到右括号时,分别检测匹配情况 case (ch== ) if(StackEmpty(s))retrun FALSE else (Pop(&s, &ch) if(ch='()return FALSE break: case(ch==D): if(StackEmpty(s) retrun FALSE else ( Pop(&s, &ch 请单赤鼠标左键换页!InitStack(&S); //初始化栈S while ((ch=getchar())!=’\n’){ //以字符序列的形式输入表达式 switch (ch) { case (ch==‘(’||ch== ‘[’||ch== ‘{’): Push(&S,ch);break; //遇左括号入栈 //在遇到右括号时，分别检测匹配情况 case (ch== ‘)’): if (StackEmpty(S)) retrun FALSE; else {Pop(&S,&ch); if (ch!= ‘(’) return FALSE; } break; case (ch== ‘]’): if (StackEmpty(S)) retrun FALSE; else {Pop(&S,&ch);