else if(expli]=='&& StackNotEmpty(my Stack) && StackTop( myStack,&c)&匙c三=’{) StackPop ( &my Stack, &c) else if(exp[i]==''&& StackNotEmpty(myStack) & StackTop(my Stack, &c)&&c!='t) printf("左右括号配对次序不正确!\n"); return;} else if((exp[i]=’)’)‖|(exp[i]==’])|1 (expli]=='))&&! Stack NotEmpty(myStack)) printf("右括号多于左括号!n"); return;}4 else if(exp[i] == '}' && StackNotEmpty(myStack) && StackTop(myStack, &c) && c == '{') StackPop(&myStack, &c); else if(exp[i] == '}' && StackNotEmpty(myStack) && StackTop(myStack, &c) && c != '{') {printf("左右括号配对次序不正确！\n");return;} else if(((exp[i] == ')') || (exp[i] == ']') || (exp[i] == '}')) && !StackNotEmpty(myStack)) { printf("右括号多于左括号！\n"); return;} }