C语言链栈实现的简易计算器

#include 
#include 
#define OK 1
#define ERROR 0
typedef struct Stack_num
{
	int num;
	struct Stack_num *next;
}Stack_num,*LinkStack_num_ptr;
typedef struct LinkStack_num
{
	struct Stack_num* top;
	int count;
}LinkStack_num;
typedef struct Stack_opt
{
	char opt;
	struct Stack_opt *next;
}Stack_opt,*LinkStack_opt_ptr;
typedef struct LinkStack_opt
{
	struct Stack_opt* top;
	int count;
}LinkStack_opt;
bool Push_num(LinkStack_num *S,int e)
{
	LinkStack_num_ptr s=(LinkStack_num_ptr)malloc(sizeof(Stack_num));
	s->num=e;
	s->next=S->top;
	S->top=s;
	S->count++;
	return OK;
 } 
bool Pop_num(LinkStack_num *S,int *e)
{
	LinkStack_num_ptr p;
	if(S->top==NULL)
	{
		return ERROR;
	}
	*e=S->top->num;
	p=S->top;
	S->top=S->top->next;
	free(p);
	S->count--;
	return OK; 
}
bool Push_opt(LinkStack_opt *S,char e)
{
	LinkStack_opt_ptr s=(LinkStack_opt_ptr)malloc(sizeof(Stack_opt));
	s->opt=e;
	s->next=S->top;
	S->top=s;
	S->count++;
	return OK;
 } 
bool Pop_opt(LinkStack_opt *S,char *e)
{
	LinkStack_opt_ptr p;
	if(S->top==NULL)
	{
		return ERROR;
	}
	*e=S->top->opt;
	p=S->top;
	S->top=S->top->next;
	free(p);
	S->count--;
	return OK; 
}
int Priority(char ch)/*优先级判断函数*/
{
	switch(ch)
	{
		case '(':
			return 3;
		case '*':
		case '/':
			return 2;
		case '+':
		case '-':
			return 1;
		default:
			return 0;
	}
}
int main()
{
	char opt[100];
	LinkStack_num* stack_num=(LinkStack_num*)malloc(sizeof(LinkStack_num));
	LinkStack_opt* stack_opt=(LinkStack_opt*)malloc(sizeof(LinkStack_opt));;
	stack_num->top=NULL;
	stack_num->count=0;
	stack_opt->top=NULL;
	stack_opt->count=0;
	int i=0,tmp=0;
	char option;
	int num1,num2;
	printf("please input : \n");
	scanf("%s",opt);
	
	while(opt[i]!='\0'||stack_opt->top!=NULL)
	{
		if(opt[i]>='0'&&opt[i]<='9')
		{
			tmp = tmp*10+opt[i]-'0';
			i++;
			if(opt[i]<'0'||opt[i]>'9')
			{
				Push_num(stack_num,tmp);
				tmp = 0;
			}
		}
		else
		{
			if(stack_opt->top==NULL||(stack_opt->top->opt=='('&&opt[i]!=')')||Priority(opt[i])>Priority(stack_opt->top->opt))
			{
				Push_opt(stack_opt,opt[i]);
				i++;
				continue;
			}
			if(stack_opt->top->opt=='('&&opt[i]==')')
			{
				char temp;
				Pop_opt(stack_opt,&temp);
				i++;
				continue;
			}
			if((opt[i]=='\0'&&stack_opt->top!=NULL)||opt[i]==')'&&stack_opt->top->opt!='('||Priority(opt[i])<=Priority(stack_opt->top->opt))
			{
				Pop_opt(stack_opt,&option);
				switch(option)
				{
					case '+':
						{
							Pop_num(stack_num,&num1);
							Pop_num(stack_num,&num2);
							Push_num(stack_num,(num1+num2));
							break;
						}
					case '-':
						{
							Pop_num(stack_num,&num1);
							Pop_num(stack_num,&num2);
							Push_num(stack_num,(num2-num1));
							break;
						}	
					case '*':
						{
							Pop_num(stack_num,&num1);
							Pop_num(stack_num,&num2);
							Push_num(stack_num,(num1*num2));
							break;
						}	
					case '/':
						{
							Pop_num(stack_num,&num1);
							Pop_num(stack_num,&num2);
							Push_num(stack_num,(num2/num1));
							break;
						}
				}
	
				 
			}
		}
	}
	printf("result : %d\n",stack_num->top->num);
		
}