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
|
/*
* Copyright (C) 2012-2013 Robin Haberkorn
*
* 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/>.
*/
#ifndef __EXPRESSIONS_H
#define __EXPRESSIONS_H
#include <glib.h>
#include "undo.h"
template <typename Type>
class ValueStack {
class UndoTokenPush : public UndoToken {
ValueStack<Type> *stack;
Type value;
int index;
public:
UndoTokenPush(ValueStack<Type> *_stack,
Type _value, int _index = 1)
: stack(_stack), value(_value), index(_index) {}
void
run(void)
{
stack->push(value, index);
}
};
class UndoTokenPop : public UndoToken {
ValueStack<Type> *stack;
int index;
public:
UndoTokenPop(ValueStack<Type> *_stack, int _index = 1)
: stack(_stack), index(_index) {}
void
run(void)
{
stack->pop(index);
}
};
int size;
Type *stack;
Type *top;
public:
ValueStack(int _size = 1024) : size(_size)
{
top = stack = new Type[size];
}
~ValueStack()
{
delete stack;
}
inline int
items(void)
{
return top - stack;
}
inline Type &
push(Type value, int index = 1)
{
for (int i = -index + 1; i; i++)
top[i+1] = top[i];
top++;
return peek(index) = value;
}
inline void
undo_push(Type value, int index = 1)
{
undo.push(new UndoTokenPush(this, value, index));
}
inline Type
pop(int index = 1)
{
Type v = peek(index);
top--;
while (--index)
top[-index] = top[-index + 1];
return v;
}
inline void
undo_pop(int index = 1)
{
undo.push(new UndoTokenPop(this, index));
}
inline Type &
peek(int index = 1)
{
return top[-index];
}
inline void
clear(void)
{
top = stack;
}
};
/*
* Arithmetic expression stacks
*/
extern class Expressions {
public:
/* reflects also operator precedence */
enum Operator {
OP_NIL = 0,
OP_POW, // ^*
OP_MUL, // *
OP_DIV, // /
OP_MOD, // ^/
OP_SUB, // -
OP_ADD, // +
OP_AND, // &
OP_OR, // #
// pseudo operators:
OP_NEW,
OP_BRACE,
OP_LOOP,
OP_NUMBER
};
private:
ValueStack<tecoInt> numbers;
ValueStack<Operator> operators;
public:
Expressions() : num_sign(1), radix(10) {}
gint num_sign;
void set_num_sign(gint sign);
gint radix;
void set_radix(gint r);
tecoInt push(tecoInt number);
inline tecoInt
peek_num(int index = 1)
{
return numbers.peek(index);
}
tecoInt pop_num(int index = 1);
tecoInt pop_num_calc(int index, tecoInt imply);
inline tecoInt
pop_num_calc(int index = 1)
{
return pop_num_calc(index, num_sign);
}
tecoInt add_digit(gchar digit);
Operator push(Operator op);
Operator push_calc(Operator op);
inline Operator
peek_op(int index = 1)
{
return operators.peek(index);
}
Operator pop_op(int index = 1);
void eval(bool pop_brace = false);
int args(void);
void discard_args(void);
int find_op(Operator op);
inline void
clear(void)
{
numbers.clear();
operators.clear();
}
const gchar *format(tecoInt number);
private:
void calc(void);
int first_op(void);
} expressions;
#endif
|
