CS2-Project4/Infix.cpp at master · hentg089/CS2-Project4 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
//
//Mark Hentges 5814125 - 3/16/2023
//

#include "DivideByZero.h"
#include "Infix.h"

bool Infix::isPrecedenceGreater(char check, char compare){
    if((check == 42 || check == 47) && (compare == 43 || compare == 45 || compare == 40)) {
        return true;
    } else if((check == 43 || check == 45) && (compare == 40)){
        return true;
    }
    else{
        return false;
    }
}

void Infix::performOperation(LinkedStack<int>& valueStack, LinkedStack<char>& operators){
    int RHSoperand = valueStack.peek();
    valueStack.pop();
    int LHSoperand = valueStack.peek();
    valueStack.pop();
    char op = operators.peek();
    operators.pop();
    int result = 0;
    switch (op) {
        case '+':
            result = LHSoperand + RHSoperand;
            break;
        case '-':
            result = LHSoperand - RHSoperand;
            break;
        case '*':
            result = LHSoperand * RHSoperand;
            break;
        case '/':
            if(RHSoperand == 0){
                throw DivideByZero("Infinite result - Cannot handle division-by-zero.");
            }
            result = LHSoperand / RHSoperand;
            break;
    }
    valueStack.push(result);
}

void Infix::setInfixString(std::string infix){
    this->infix = infix;
}

std::string Infix::getInfixString(){
    return infix;
}

int Infix::getEvaluatedInfix(){
    LinkedStack<char> operators;
    LinkedStack<int> value;

    for(char c : infix){
        switch(c){
            case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9':
                value.push(c - 48); //shifts the char values
                break;
            case '(':
                operators.push(c);
                break;
            case '*': case '+': case '-': case '/':
                if(operators.isEmpty() || isPrecedenceGreater(c, operators.peek())){
                    operators.push(c);
                }
                else{
                    while(!operators.isEmpty() && !isPrecedenceGreater(c, operators.peek())){
                        performOperation(value, operators);
                    }
                    operators.push(c);
                }
                break;
            case ')':
                while(operators.peek() != '('){
                    performOperation(value, operators);
                }
                operators.pop();
                break;
        }
    }

    while(!operators.isEmpty()){
        performOperation(value, operators);
    }

    return value.peek();
}