案例3.3表达式求值

案例3.3表达式求值

案例描述

代码实现

#pragma once
#include <iostream>

using namespace std;

//顺序栈的存储结构
#define MAXSIZE 100
typedef struct {
    int *base;  //栈底指针
    int *top;   //栈顶指针
    //栈可用的最大容量
    int stacksize;     
}SqStack;


//顺序栈的初始化
void InitStack(SqStack& S) 
{         
    //构造一个空栈
    S.base = new int[MAXSIZE];
    //存储分配失败
    if (!S.base)
    {
        exit(1);
    }      
    //栈顶指针等于栈底指针
    S.top = S.base;   
    //栈的最大容量
    S.stacksize = MAXSIZE;
}


//顺序栈的入栈
void Push(SqStack& S, char e)
{
    //栈满
    if (S.top - S.base == S.stacksize)
    {
        cout << "栈满" << endl;
        exit(0);
    }

    *S.top = e;
    *S.top++;
}

//顺序栈的判空
bool StackEmpty(SqStack S)
{
    if (S.top == S.base)
    {
        return true;
    }
    else
    {
        return false;
    }
}
//顺序栈的出栈

void Pop(SqStack& S, char& e)
{

    if (StackEmpty(S))
    {
        cout << "栈空" << endl;
        exit(0);
    }
    S.top--;
    e = *S.top;
}

//获取栈的第一个元素（访问栈顶元素）
int GetTop(SqStack S)
{
	//栈非空 
    if (S.top!=S.base)
    {
		//返回栈顶元素的值，栈顶指针不变
        return *(S.top-1);
    }
    
}



//判断读入字符是否为运算符
bool In(char e)
{
    if (e == '+' ||
        e == '-' ||
        e == '*' ||
        e == '/' ||
        e == '(' ||
        e == ')' ||
        e == '#')
    {
        return true;//是运算符
    }
        
    else
    {
        return false;//不是运算符
    }
        
}
//比较运算符的优先级
//对照数据集书78页的表，a为纵轴值，b为横轴值
char Precede(char a, char b)
{
	char f;
	if (a == '+' || a == '-')
	{
		if (b == '+' || b == '-' || b == ')' || b == '#')
			f = '>';
		else if (b == '*' || b == '/' || b == '(')
			f = '<';
	}
	else if (a == '*' || a == '/')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == ')' || b == '#')
			f = '>';
		else if (b == '(')
			f = '<';
	}
	else if (a == '(')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == '(')
			f = '<';
		else if (b == ')')
			f = '=';
	}
	else if (a == ')')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == ')' || b == '#')
			f = '>';
	}
	else if (a == '#')
	{
		if (b == '+' || b == '-' || b == '*' || b == '/' || b == '(')
			f = '<';
		else if (b == '#')
			f = '=';
	}
	return f;
}

//计算二元运算结果
char Operate(char a, char theta, char b)
{
	char c;
	//把a b 变成int类型
	a = a - '0';
	b = b - '0';
	if (theta == '+')
		//变成字符类型
		c = a + b + '0';
	else if (theta == '-')
		c = a - b + '0';
	else if (theta == '*')
		c = a * b + '0';
	else if (theta == '/')
		c = a / b + '0';
	return c;
}



int EvaluateExpression()
{
	SqStack OPND, OPTR;
	char ch, a, b, theta, x;
	InitStack(OPND);
	InitStack(OPTR);
	Push(OPTR, '#');
	cin>>ch;
	while (ch != '#' || GetTop(OPTR) != '#')
	{
		if (!In(ch))
		{
			Push(OPND, ch);
			cin >> ch;
		}
		else
		{
			switch (Precede(GetTop(OPTR), ch))
			{
			case '<':
				Push(OPTR, ch);
				cin >> ch;
				break;
			case '>':
				Pop(OPTR, theta);
				Pop(OPND, b);
				Pop(OPND, a);
				Push(OPND, Operate(a, theta, b));
				break;
			case '=':
				Pop(OPTR, x);
				cin >> ch;
				break;
			}
		}
	}
	//变成int类型
	return GetTop(OPND) - '0';
}
int main()
{
	cout<<"请输入算术表达式,并以#结束"<<endl;
	cout<<"结果是:"<< EvaluateExpression()<<endl;

	system("pause");
	return 0;
}

运行结果