Calculator/main.c at master · cspesud/Calculator · 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
#include <stdio.h>
#include <stdlib.h>
#include "read.h"


int main(int argc, const char * argv[]) {

    NumberStack *numbers = (NumberStack*)malloc(sizeof(NumberStack));
    numbers->size = 0;
    numbers->top = NULL;
    char tmp;
    for (char c= getchar() ; c!='q'; c = getchar()){

        switch (c) {
            case '+':
            case '-':
            case '*':
            case '/':
            case '=':

                tmp = getchar() ;
                if ((tmp >= '0' && tmp <= '9') && c == '-'){
                    NumberNode* node = (NumberNode*)calloc(1, sizeof(NumberNode));
                    node->value = readNumber(tmp);
                    node->value->sign = -1;
                    pushNumber(numbers, node);
                    continue;
                }

                if (tmp != '\n') { ignoreLine(); continue; }
                if (numbers->size >0  && c == '='){
                    printBigNumber(numbers->top->value);
                }else if (numbers->size >= 2){
                    BigInt* rightValue = numbers->top->value;
                    BigInt* leftValue = numbers->top->nextNode->value;
                    BigInt* result = calculate(c, leftValue, rightValue);

                    if (result == NULL) {
                        continue;
                    }
                    NumberNode* node = (NumberNode*)calloc(1, sizeof(NumberNode));
                    node->value = result;
                    popNumber(numbers);
                    popNumber(numbers);
                    pushNumber(numbers, node);
                    }else{
                    printf("empty stack\n");
                }
                break;
            default:

                if (c >= '0' && c<= '9'){
                    NumberNode* node = (NumberNode*)calloc(1, sizeof(NumberNode));
                    node->value = readNumber(c);
                    pushNumber(numbers, node);
                }
                break;
        }
        }
    return 0;
}