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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
|
/*
*
* Interpreteur de ligne de commande
*
*/
#include <stdio.h>
#include <limits.h>
#ifdef HAVE_CONFIG_H
#include "config.h"
#else
#define _(x) x
#endif
#include "interface.h"
#include "exceptions.h"
#include "pile.h"
typedef unsigned char op_t;
typedef struct operator_t {
op_t op;
int pri, func;
} operator_t;
op_t pile_operators[PILEOP_MAX];
int pile_nestedcall[PILECALL_MAX];
int pileop_pos = 0, pilecall_pos = 0;
operator_t operators[] = {
{',', 0, OP_NEST},
{'+', 2, OP_PLUS},
{'-', 2, OP_MOINS},
{'*', 3, OP_MUL},
{'/', 3, OP_DIV},
{'%', 3, OP_MOD},
{'^', 4, OP_EXP},
{'+' + 128, 5, OP_PLUS_UNARY},
{'-' + 128, 5, OP_MOINS_UNARY},
{'=', 1, OP_ASSIGN},
{'(', 6, OP_FUNC_CALL},
{'(' + 128, 6, OP_LPAREN},
{255, -1, -1}
};
operator_t get_op(op_t op)
{
int i;
for (i = 0; operators[i].op != 255; i++) {
if (operators[i].op == op)
return operators[i];
}
return operators[i];
}
int get_pri(op_t op)
{
return get_op(op).pri;
}
int get_func(op_t op)
{
return get_op(op).func;
}
op_t get_last_op(void)
{
if (pileop_pos)
return pile_operators[pileop_pos - 1];
else
return -1;
}
op_t pop_op(void)
{
if (pileop_pos)
return pile_operators[--pileop_pos];
return -1;
}
void push_op(op_t op)
{
if (pileop_pos != PILEOP_MAX)
pile_operators[pileop_pos++] = op;
else
exception(-1, _("Too many nested operators in expression.\n"));
}
int pop_call(void)
{
if (pilecall_pos)
fprintf(stderr, "Dépilement du dernier appel de fonction: %i\n",
pile_nestedcall[pilecall_pos - 1]);
return pile_nestedcall[--pilecall_pos];
return -1;
}
void increment_call(void)
{
if (pilecall_pos) {
fprintf(stderr, "Incrément du dernier appel de fonction: %i\n",
pile_nestedcall[pilecall_pos - 1]);
if (pile_nestedcall[pilecall_pos - 1] != -1)
pile_nestedcall[pilecall_pos - 1]++;
}
}
int get_last_call(void)
{
if (pilecall_pos)
return pile_nestedcall[pilecall_pos - 1];
return -1;
}
void push_call(int call)
{
fprintf(stderr, "Empilement d'un appel de fonction: %i\n", call);
if (pilecall_pos != PILECALL_MAX)
pile_nestedcall[pilecall_pos++] = call;
else
exception(-1, _("Too many nested functions calls in expression.\n"));
}
char *getword(char *line, char *p)
{
char o;
do {
if (*(line) != ' ') {
o = *(p++) = *line;
fprintf(stderr, "getword(): a trouvé le caractère '%c'\n", o);
}
line++;
} while ((*line) && (*line != ')') && (*line != ';') && (get_func(*line) == -1)
&& (get_func(o) == -1));
*p = '\0';
return line;
}
int parse_line(char *line)
{
char buffer[BUFSIZ];
op_t op;
int got_unary = 128, nbrargs;
fprintf(stderr, "Analyse de: \"%s\"...\n\n", line);
while (*line) {
line = getword(line, buffer);
fprintf(stderr, "parse_line(): getword a trouvé le mot \"%s\"\n", buffer);
if (get_func(buffer[0]) != -1) {
fprintf(stderr, "Il s'agit d'un opérateur.\n");
buffer[0] += got_unary;
if (got_unary) {
fprintf(stderr, "Opérateur de type unaire\n");
}
if (get_pri(buffer[0]) == -1) {
if (got_unary) {
exception(-1, _("Invalid unary operator"));
} else {
exception(-1, _("Invalid binary operator"));
}
}
fprintf(stderr, "Priorité du dernier op: %i, priorité actu: %i\n",
get_pri(get_last_op()), get_pri(buffer[0]));
while (get_pri(get_last_op()) >= get_pri(buffer[0])
&& ((get_last_op() & 127) != '(')) {
fprintf(stderr,
"Il y a un opérateur plus important sur la file.\n");
act_pile(get_func(pop_op()));
got_unary = 0;
fprintf(stderr, "Priorité du dernier op: %i, priorité actu: %i\n",
get_pri(get_last_op()), get_pri(buffer[0]));
}
fprintf(stderr, "Mise sur la file\n");
if (buffer[0] == '(') {
push_call(0);
}
if (buffer[0] == ',') {
increment_call();
} else
push_op(buffer[0]);
got_unary = 128;
} else if ((buffer[0] == ';') || (buffer[0] == ')')) {
fprintf(stderr, "Caractère spécial\n");
switch (buffer[0]) {
case ';':
fprintf(stderr, "Vidage complet de la file (fin de commande).\n");
while (pileop_pos) {
op = pop_op();
if (op == '(')
exception(-1,
_
("Parse error: too much left parenthesis"));
act_pile(get_func(op));
}
break;
case ')':
fprintf(stderr, "Vidage de la file jusqu'à '(' car ')' trouvée.\n");
while (1) {
if (!pileop_pos)
exception(-1,
_
("Parse error: too much right parenthesis"));
op = pop_op();
if (((op & 127) == '('))
break;
act_pile(get_func(op));
}
if (op == '(') {
nbrargs = pop_call();
push_pile_int(nbrargs);
act_pile(get_func(op));
}
got_unary = 0;
break;
}
} else if (((buffer[0] >= 'A') && (buffer[0] <= 'Z'))
|| ((buffer[0] >= 'a') && (buffer[0] <= 'z'))
|| ((buffer[0] >= '0') && (buffer[0] <= '9')) || (buffer[0] == '_')) {
fprintf(stderr, "Symbole.\n");
push_pile(buffer);
got_unary = 0;
if (!get_last_call())
increment_call();
} else if (buffer[0]) {
exception(-1, _("Invalid character"));
}
}
}
|
