-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathoperators.c
130 lines (108 loc) · 3.32 KB
/
operators.c
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
/***************************************************************************
This file is a part of Interpretor.
Interpretor is a simple interpretor of a basic language.
Copyright (C) 2011 DURET Simon
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
***************************************************************************/
#include <math.h>
#include <assert.h>
#include "global.h"
struct operator
{
int c;
double (*callback)(struct tree*, struct tree*);
int priority;
};
/***************************************************
* Private functions
**************************************************/
static double op_add(struct tree *left, struct tree *right)
{
return calc_tree(left) + calc_tree(right);
}
static double op_sub(struct tree *left, struct tree *right)
{
return calc_tree(left) - calc_tree(right);
}
static double op_pow(struct tree *left, struct tree *right)
{
return pow(calc_tree(left), calc_tree(right));
}
static double op_div(struct tree *left, struct tree *right)
{
return calc_tree(left) / calc_tree(right);
}
static double op_mul(struct tree *left, struct tree *right)
{
return calc_tree(left) * calc_tree(right);
}
static double op_mod(struct tree *left, struct tree *right)
{
return fmod(calc_tree(left), calc_tree(right));
}
static double op_greater(struct tree *left, struct tree *right)
{
return calc_tree(left) > calc_tree(right);
}
static double op_lower(struct tree *left, struct tree *right)
{
return calc_tree(left) < calc_tree(right);
}
static double op_not(struct tree *left, struct tree *right)
{
return calc_tree(left) != calc_tree(right);
}
static double op_equal(struct tree *left, struct tree *right)
{
return calc_tree(left) == calc_tree(right);
}
static struct operator Operators[] =
{
{'<', op_lower, 1},
{'>', op_greater, 1},
{'!', op_not, 1},
{'~', op_equal, 1},
{'+', op_add, 2},
{'-', op_sub, 2},
{'*', op_mul, 3},
{'/', op_div, 3},
{'%', op_mod, 3},
{'^', op_pow, 4},
};
/***************************************************
* Public functions
**************************************************/
/* Return the priority of the operator ID */
int priority(int operator_id)
{
if(operator_id < 0)
return -1;
if((unsigned int)operator_id >= sizeof(Operators)/sizeof(*Operators))
return -1;
return Operators[operator_id].priority;
}
/* Return the ID of the operator, if c is an operator, else -1 */
int char_to_operator(int c)
{
unsigned int i;
for(i = 0; i < sizeof(Operators)/sizeof(*Operators); i++)
{
if(c == Operators[i].c)
return i;
}
return -1;
}
double exec_operator(int op_id, struct tree *left, struct tree *right)
{
assert(op_id >= 0);
return Operators[op_id].callback(left, right);
}