c语言计算器源代码

《c语言计算器源代码》由会员上传分享，免费在线阅读，更多相关内容在应用文档-天天文库。

1、#include#include#include#definemaxsize100typedefdoubledatatype1;typedefchardatatype2;typedefstructstack1{datatype1data1[maxsize];inttop1;/*栈顶元素*/}seqstack1,*pseqstack1;/*顺序栈*/typedefstructstack2{datatype2data2[maxsize];inttop2;/*栈顶元素*/}seqstack2,*pseqstack2;/*顺序栈

2、*//*栈的初始化*/pseqstack1init_seqstack1(void){pseqstack1S;S=(pseqstack1)malloc(sizeof(pseqstack1));if(S)S->top1=-1;returnS;}pseqstack2init_seqstack2(void){pseqstack2S;S=(pseqstack2)malloc(sizeof(pseqstack2));if(S)S->top2=-1;returnS;}/*判断栈空*/intempty_seqstack1(pseqstack1S){if(S->top1==-1)return1

3、;elsereturn0;}intempty_seqstack2(pseqstack2S){if(S->top2==-1)return1;elsereturn0;}/*X入栈*/intpush_seqstack1(pseqstack1S,datatype1X){if(S->top1==maxsize-1){printf("栈满，无法入栈！");return0;}else{S->top1++;S->data1[S->top1]=X;return1;}}intpush_seqstack2(pseqstack2S,datatype2X){if(S->top2==maxsize-

4、1){printf("栈满，无法入栈！");return0;}else{S->top2++;S->data2[S->top2]=X;return1;}}/*X出栈*/intpop_seqstack1(pseqstack1S,datatype1*X){if(empty_seqstack1(S))return0;else{*X=S->data1[S->top1];S->top1--;return1;}}intpop_seqstack2(pseqstack2S,datatype2*X){if(empty_seqstack2(S))return0;else{*X=S->data2

5、[S->top2];S->top2--;return1;}}/*求栈顶元素*/intgettop_seqstack1(pseqstack1S,datatype1*X){if(empty_seqstack1(S))return0;else*X=S->data1[S->top1];return1;}intgettop_seqstack2(pseqstack2S,datatype2*X){if(empty_seqstack2(S))return0;else*X=S->data2[S->top2];return1;}/*判断字符是否为操作数。若是返回1，否则返回0*/intisnum

6、(charc){if(c>='0'&&c<='9')return1;elsereturn0;}/*求后缀表达式的值*/doublepostfix_exp(char*A){pseqstack1S;/*定义栈S*/doubleoperand=0;doubleresult;/*存放栈顶元素*/doublea;/*运算符ch前的操作数出栈存入a*/doubleb;/*运算符ch后的操作数出栈存入b*/doublec;/*c==achb*/charch;/*存放读取到的表达式(A)的字符*/ch=*A++;/*读表达式字符=>A*/S=init_seqstack1();/*初始化栈*/

7、while(ch!='#')/*遇到元素!='#'时*/{if(isnum(ch))/*判断ch是否为数字字符,计算出操作数*/operand=operand*10+(ch-'0');else/*否则*/{if(operand){push_seqstack1(S,operand);/*当前字符不是数字,操作数结束,要入栈*/operand=0;}if(ch!='@'&&ch!=''){pop_seqstack1(S,&b);/*运算符ch后的操作数出栈存入b*/pop_seqstack1(S,&a);/