利用堆栈实现的计算器(代码).docx

数据结构课程实验（利用堆栈实现简单计算器）代码共4个文件/main.cc文件#include #include stack.h#include opretor.husing namespace std;void main()Stack1 stack1;Stack2 staxk2;char s50;stack1.Push(=);cout 请输入正确的算术式（正数计算，以=结尾）：s;if(check(s)Calculate(s,stack1,staxk2);elsecout 输入错误！endl;system (pause);/stack.h文件#ifndef STACK_H#define STACK_H#define STACK_INIT_SIZE 100#define STACKINCREMENT 10class Stack1private:char *top;char *base; int stacksize;int size;public:Stack1();Stack1();bool IsFull();bool IsEmpty();void Push(char e);char Pop();char Gettop(char x);int getsize();class Stack2private:double *top;double *base; int stacksize;int size;public:Stack2();Stack2();bool IsFull();bool IsEmpty();void Push(double e);double Pop();double Gettop(double x);int getsize();#endif;/stack.cc文件#include stack.h#include Stack1:Stack1()base = (char *)malloc(STACK_INIT_SIZE*sizeof(char);top = base ;stacksize = STACK_INIT_SIZE;size = 0;Stack1:Stack1()free (base);bool Stack1:IsFull()if(top - base = stacksize)return true;else return false;bool Stack1:IsEmpty() if (top = base) return true; else return false; void Stack1:Push(char e) if(top - base = stacksize) base = (char *) realloc ( base, (stacksize + STACKINCREMENT) * sizeof (char);top = base + stacksize;stacksize += STACKINCREMENT; *top+ = e; size+; char Stack1:Pop() char c; c = *(-top); size-; return c; char Stack1:Gettop(char x) if(!IsEmpty() x = *(top-1); return x; else return o; int Stack1:getsize()return size; Stack2:Stack2()base = (double *)malloc(STACK_INIT_SIZE*sizeof(double);top = base ;stacksize = STACK_INIT_SIZE;size = 0;Stack2:Stack2()free (base);bool Stack2:IsFull()if(top - base = stacksize)return true;else return false;bool Stack2:IsEmpty() if (top = base) return true; else return false;void Stack2:Push(double e) if(top - base = stacksize) base = (double *) realloc ( base, (stacksize + STACKINCREMENT) * sizeof (double);top = base + stacksize;stacksize += STACKINCREMENT; *top+ = e; size+; double Stack2:Pop()double c; c = *(-top); size-; return c;double Stack2:Gettop(double x) if(!IsEmpty() x = *(top-1); return x; else return 0;int Stack2:getsize()return size;/opretor.h文件#ifndef OPRETOR_H#define OPRETOR_H#include stack.hbool check(char ch);double exchange(char str,int dot);void Calculate(char ch,Stack1 stack1,Stack2 stack2);double calculatein(double x,double y,char opr);char precede_op(char a,char b);#endif;/opretor.cc文件#include opretor.h#include using namespace std;struct evaluationunionchar opr;double num;u;char c;bool check(char ch)if(ch09)return false;elsereturn true;double exchange(char str,int dot) /将字符串转化为小数int i,zs;double xs;double re;if(dot=0;i-) re+=(stri-0)*zs; zs*=10; else /若包含小数部分 zs=1;xs=0.1;re=0;for(i=dot-1;i=0;i-) re+=(stri-0)*zs; zs*=10; for(i=dot+1;stri!=0;i+) re+=(stri-0)*xs; xs*=0.1; return re;double calculatein(double x,double y,char opr)double s;switch(opr)case +:s=x+y;break;case -:s=x-y;break;case *:s=x*y;break;case /:s=x/y;break;default:return 0;return s;char precede_op(char a,char b)switch(a)case +:case -:if(b=+|b=-|b=)|b=)return ;else return ;case *:case /:if(b=()return ;case (:if(b=)return =;elsereturn ;case ):if(b=)return ;case =:if(b=)return =;elsereturn =0&chi=0&chi=9|chi=.) if(chi=.)dot=j;ssj+=chi;i+;ssj=0;nn=exchange(ss,dot);evalk.c=N;evalk.u.num=nn;k+;i-;elseevalk.c=O;evalk.u.opr=chi;k+;j=0;for (i=0;ik;i+)if (evali.c=N)cout evali.u.numendl;/stack2.Push(evali.u.num);elsecout evali.u.oprendl;/stack1.Push(evali.u.opr);coutendlendl; for (i=0;i=2)switch(precede_op(e=s