Noah_Cal_Expression_With_Stack.h

#ifndef NOAH_CAL_EXPRESSION_WITH_STACK_H_INCLUDED
#define NOAH_CAL_EXPRESSION_WITH_STACK_H_INCLUDED
#include "Noah_stack.h"
#include "Noah_expression_normaltoRPN.h"
#include 
#include 
#include 
#include 
using namespace std;string input_expression();
int check_expression(string expression);
STK_Elemtype Polish_type_calculate(string expression);
STK_Elemtype Inverse_Polish_type_calculate(string expression);
STK_Elemtype Normal_type_calculate(string expression);//输入一个表达式
string input_expression(){int legal = 0;char expression_chars[256];string expression;while(!legal){cout <<"Please input the expression:"<0 && x==' '){temp = "";operands_num++;}if(x=='('||x==')'||x==' '){if(x=='(')bracket_left++;else if(x == ')')bracket_right++;continue;}if(x=='+'||x=='-'||x=='*'||x=='/'||x=='%'||x=='^')operation_num++;else if(x>='0'&&x<='9'){temp +=x;if(index == expression.size()-1)operands_num++;}elseexpression_error_illegal_char = 1;//有非法字符//cout<0 && x==' '){push(s,stof(temp));temp = "";}/*cout<='0'&&x<='9'){temp = x + temp;if(index==0)push(s,stof(temp));}}return pop(s);
}//计算逆波兰式
STK_Elemtype Inverse_Polish_type_calculate(string expression){sq_stack s;initStack(s);//正序遍历表达式字符串string temp = "";for (decltype(expression.size()) index = 0; index != expression.size(); index++){char x = expression[index];if(temp.size()>0 && x==' '){push(s,stof(temp));temp = "";}/*cout<='0'&&x<='9'){temp = temp + x;if(index==expression.size()-1)push(s,stof(temp));}}return pop(s);
}//计算中缀表达式,先转为逆波兰式再计算逆波兰式
STK_Elemtype Normal_type_calculate(string expression){return Inverse_Polish_type_calculate(RPN(expression));
}#endif // NOAH_CAL_EXPRESSION_WITH_STACK_H_INCLUDED

Noah_expression_noemaltoRPN.h

#ifndef NOAH_EXPRESSION_NORMALTORPN_H_INCLUDED
#define NOAH_EXPRESSION_NORMALTORPN_H_INCLUDED
#include 
#include 
#include 
#include "Noah_stack.h"using namespace std;
int priority_func(char op);//判断运算符的优先级
int priority_func(char op)
{int priority;if(op == '*' || op == '/') priority = 2;if(op == '+' || op == '-') priority = 1;if(op == '(') priority = 0;return priority;
}//将中缀表达式转为逆波兰式
string RPN(string str)
{string str1="";stack s;int i;string temp = "";for(i = 0; i < str.size(); i ++ ){//cout<0){str1 = str1+ " " + temp;temp = "";}continue;}//是数字的情况下直接输出if(str[i] >= '0' && str[i] <= '9' ){temp = temp+string(1,str[i]);if(i==str.size()-1)str1 = str1+ " " + temp;}else //不是数字的情况分类讨论进行判断{//栈为空时直接入栈if(s.empty()) s.push(str[i]);//左括号入栈else if(str[i] == '(') s.push(str[i]);//如果是右括号，只要栈顶不是左括号，就弹出并输出else if(str[i] == ')'){while(s.top() != '('){str1 = str1+ " " + s.top();s.pop();}//弹出左括号，但不输出s.pop();}else{//栈顶元素的优先级大于等于当前的运算符，就将其输出while(priority_func(str[i]) <= priority_func(s.top())){str1 = str1+ " " + s.top();s.pop();//栈为空，停止if(s.empty()) break;}s.push(str[i]);}}}//最后，如果不为空，就把所以的元素全部弹出while(!s.empty()){str1 = str1+ " " + s.top();s.pop();}string str2 = str1.substr(1,str1.size());str1 = str2;return str1;
}#endif // NOAH_EXPRESSION_NORMALTORPN_H_INCLUDED

Main.cpp

#include 
using namespace std;
#include 
#include 
#include 
#include "Noah_Cal_Expression_With_Stack.h"
void Menue_gui();
void func1();
void func2();
void func3();int main()
{while(1){Menue_gui();int func;scanf("%d",&func);switch(func){case 0:exit(0);case 1:func1();break;case 2:func2();break;case 3:func3();break;default:printf("Input error! Please try again!");}printf("\n");system("pause");}return 0;
}//菜单界面
void Menue_gui(){system("cls");//清屏printf("****************Polish, inverse Polish, and infix expression calculators*********************\n");printf("*********************************************************************************************\n");printf("Menue:\n");printf("\nExit this program------------------------------------------------------0.\n");printf("\nPolish expression calculator-------------------------------------------1.\n");printf("\nReverse Polish expression calculator-----------------------------------2.\n");printf("\nInfix expression calculator--------------------------------------------3.\n");printf("\n**********************************************************************************************\n");printf("Choose the function you want to use(input number):\n");
}//功能1界面
void func1(){system("cls");//清屏printf("-----ENTER FUNCTION : Polish expression calculator--1.-----\n");printf("Input Polish expression(example:+ 2 * 3 - 5 1)\n");string polish_expression;polish_expression = input_expression();float reslut = float(Polish_type_calculate(polish_expression));printf("Result:%.2f",reslut);
}//功能2界面
void func2(){system("cls");//清屏printf("-----ENTER FUNCTION : Inverse Polish expression calculator--2-----.\n");printf("Input Inverse Polish expression(example:2 3 5 1 - * +)\n");string Inverse_polish_expression;Inverse_polish_expression = input_expression();float reslut = float(Inverse_Polish_type_calculate(Inverse_polish_expression));printf("Result:%.2f",reslut);
}//功能3界面
void func3(){system("cls");//清屏printf("-----ENTER FUNCTION : Infix expression calculator--3.-----\n");printf("Input Infix expression(example:4 + 2 * 3 – 10 / 5)\n");string Infix_expression;Infix_expression = input_expression();float reslut = float(Normal_type_calculate(Infix_expression));printf("Result:%.2f",reslut);
}