This repository was archived by the owner on Sep 17, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinterpreter.c
More file actions
68 lines (56 loc) · 2.51 KB
/
Copy pathinterpreter.c
File metadata and controls
68 lines (56 loc) · 2.51 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "interpreter.h"
#include "nodes.h"
#include "values.h"
Number interpreter_visit(Interpreter *interpreter, Node *node) {
interpreter->error = NULL;
switch (node->node_type) {
case NumberNode:
return (Number) { node->value };
case AddNode:
return interpreter_visit_add_node(interpreter, node);
case SubtractNode:
return interpreter_visit_subtract_node(interpreter, node);
case MultiplyNode:
return interpreter_visit_multiply_node(interpreter, node);
case DivideNode:
return interpreter_visit_divide_node(interpreter, node);
case PowerNode:
return interpreter_visit_power_node(interpreter, node);
case PlusNode:
return interpreter_visit_plus_node(interpreter, node);
case MinusNode:
return interpreter_visit_minus_node(interpreter, node);
default:
interpreter->error = "Invalid node";
return (Number) { 0 };
}
}
Number interpreter_visit_add_node(Interpreter *interpreter, Node *node) {
return (Number) { interpreter_visit(interpreter, node->node_a).value + interpreter_visit(interpreter, node->node_b).value };
}
Number interpreter_visit_subtract_node(Interpreter *interpreter, Node *node) {
return (Number) { interpreter_visit(interpreter, node->node_a).value - interpreter_visit(interpreter, node->node_b).value };
}
Number interpreter_visit_multiply_node(Interpreter *interpreter, Node *node) {
return (Number) { interpreter_visit(interpreter, node->node_a).value * interpreter_visit(interpreter, node->node_b).value };
}
Number interpreter_visit_divide_node(Interpreter *interpreter, Node *node) {
double value = interpreter_visit(interpreter, node->node_b).value;
if (value == 0.0) {
interpreter->error = "Zero division error";
return (Number) { 0 };
}
return (Number) { interpreter_visit(interpreter, node->node_a).value / value };
}
Number interpreter_visit_power_node(Interpreter *interpreter, Node *node) {
return (Number) { pow(interpreter_visit(interpreter, node->node_a).value, interpreter_visit(interpreter, node->node_b).value) };
}
Number interpreter_visit_plus_node(Interpreter *interpreter, Node *node) {
return interpreter_visit(interpreter, node->node_a);
}
Number interpreter_visit_minus_node(Interpreter *interpreter, Node *node) {
return (Number) { -1 * interpreter_visit(interpreter, node->node_a).value };
}