#include<stdio.h>
#include<stdlib.h>
#define SIZE 50
typedef int DATA;
#include"SeqStack.h"//顺序栈
int IsOperator(char c)//判断是否为运算符,是返回1,否返回0
{
switch(c)
{
case '+':
case '-':
case '*':
case '/':
case '(':
case ')':
case '=':
return 1;
break;
default:
return 0;
break;
}
}
int PRI(char oper1,char oper2)//判断两个运算符的优先级
//oper1>oper2 返回1; oper1<oper2 返回-1; oper1='(' & oper2=')'返回0;
//优先级由小到大 ( +- */ )
// 等式顺序:num1 oper1 num2 oper2
{
int pri;
switch (oper2)
{
case'+':
case'-':
if(oper1=='('||oper1=='=')
pri=-1; //oper1<oper2
else pri=1;
break;
case'*':
case'/':
if(oper1=='*'||oper1=='/'||oper1==')')
pri=1; //oper1>