-
Notifications
You must be signed in to change notification settings - Fork 0
/
ExpressionTree.h
318 lines (292 loc) · 7.38 KB
/
ExpressionTree.h
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
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
/**
* @file ExpressionTree.h
* @author Dan R. Lipsa
* @brief Nodes used in an expression tree built by the parser
* @ingroup parser
*/
#ifndef __EXPRESSION_TREE_H__
#define __EXPRESSION_TREE_H__
#include "ParsingData.h"
/**
* @brief Types of nodes in an expression tree
*/
struct ExpressionTreeType
{
enum Enum
{
NUMBER,
VARIABLE,
ARRAY_ELEMENT,
UNARY_FUNCTION,
BINARY_FUNCTION,
CONDITIONAL
};
};
/**
* @brief Base class for all types of nodes in an expression tree.
*
* An expression tree is a tree with operators (or functions) as
* internal nodes and operands (numbers and variables) as leafs.
*/
class ExpressionTree
{
public:
/**
* Constructs an ExpressionTree
*/
ExpressionTree (const ParsingData& parsingData)
: m_parsingData (parsingData)
{}
virtual ~ExpressionTree ()
{}
const ParsingData& GetParsingData ()
{
return m_parsingData;
}
/**
* Calculates and returns the value of the expression represented
* by the tree
* @return the value of the tree
*/
virtual double Value () = 0;
virtual size_t Height () const
{
return 0;
}
virtual ExpressionTreeType::Enum GetType () const = 0;
virtual ExpressionTree* GetSimplifiedTree () = 0;
virtual string ToString () = 0;
virtual bool HasConditional ()
{
return false;
}
string ToParenthesisString ();
bool IsProperBinaryFunction () const;
protected:
const ParsingData& m_parsingData;
};
/**
* @brief A number expression tree node
*/
class ExpressionTreeNumber : public ExpressionTree
{
public:
/**
* Constructs a number node
*/
ExpressionTreeNumber (const ParsingData& parsingData, double value) :
ExpressionTree (parsingData),
m_value (value)
{}
/**
* Value of the number
* @return value of the number
*/
virtual double Value ();
virtual ExpressionTree* GetSimplifiedTree ();
virtual ExpressionTreeType::Enum GetType () const
{
return ExpressionTreeType::NUMBER;
}
virtual string ToString ();
private:
/**
* Value of the nubmber node
*/
double m_value;
};
/**
* @brief A variable expression tree node
*/
class ExpressionTreeVariable : public ExpressionTree
{
public:
/**
* Constructs a variable node
* @param name the name of the variable
* @param parsingData data which allows us to get the value of a variable.
*/
ExpressionTreeVariable (const ParsingData& parsingData, const char* name);
/**
* Value of the variable
* @return the value of the variable
*/
virtual double Value ();
virtual ExpressionTree* GetSimplifiedTree ();
virtual ExpressionTreeType::Enum GetType () const
{
return ExpressionTreeType::VARIABLE;
}
virtual string ToString ();
bool IsCoordinate () const;
private:
/**
* Variable name
*/
string m_name;
ParsingData::VariableIt m_it;
};
/**
* @brief An array element expression tree node
*/
class ExpressionTreeArrayElement : public ExpressionTree
{
public:
ExpressionTreeArrayElement (const ParsingData& parsingData,
const char* name, const vector<size_t>& index);
/**
* Value of the variable
* @return the value of the variable
*/
virtual double Value ();
virtual ExpressionTree* GetSimplifiedTree ();
virtual ExpressionTreeType::Enum GetType () const
{
return ExpressionTreeType::ARRAY_ELEMENT;
}
virtual string ToString ();
private:
/**
* Variable name
*/
string m_name;
ParsingData::ArrayIt m_it;
vector<size_t> m_index;
};
/**
* @brief An unary function or unary operator expression tree node.
*/
class ExpressionTreeUnaryFunction : public ExpressionTree
{
public:
/**
* Constructs an unary function tree node
* @param name name of the unary function
* @param param expression tree parameter to the function
* @param parsingData allows us to get the function associated
* with the function name
*/
ExpressionTreeUnaryFunction (
const ParsingData& parsingData, const char* name, ExpressionTree* param);
/**
* Value of the function applied to the parameter.
* @return the value of the function applied to the parameter.
*/
virtual double Value ();
virtual size_t Height () const
{
return 1 + m_param->Height ();
}
virtual ExpressionTree* GetSimplifiedTree ();
virtual ExpressionTreeType::Enum GetType () const
{
return ExpressionTreeType::UNARY_FUNCTION;
}
virtual string ToString ();
virtual bool HasConditional ()
{
return m_param->HasConditional ();
}
private:
/**
* Name of the function
*/
string m_name;
ParsingData::UnaryFunctionIt m_it;
boost::shared_ptr<ExpressionTree> m_param;
};
/**
* @brief A binary function or binary operator expression tree node
*/
class ExpressionTreeBinaryFunction : public ExpressionTree
{
public:
/**
* Constructs a binary function tree node
* @param parsingData allows us to get the function associated
* with the function name
* @param name name of the function
* @param first child of the tree node
* @param second second child of the tree node
*/
ExpressionTreeBinaryFunction (
const ParsingData& parsingData,
const char* name,
ExpressionTree* first, ExpressionTree* second);
/**
* Value of the function applied to the parameters
* @return the value of the function applied to the parameters.
*/
virtual double Value ();
virtual size_t Height () const
{
return 1 + max (m_first->Height (), m_second->Height ());
}
virtual ExpressionTree* GetSimplifiedTree ();
virtual ExpressionTreeType::Enum GetType () const
{
return ExpressionTreeType::BINARY_FUNCTION;
}
virtual string ToString ();
virtual bool HasConditional ()
{
return m_first->HasConditional () || m_second->HasConditional ();
}
bool IsOperator () const;
private:
/**
* Function name
*/
string m_name;
ParsingData::BinaryFunctionIt m_it;
boost::shared_ptr<ExpressionTree> m_first;
boost::shared_ptr<ExpressionTree> m_second;
};
/**
* @brief A conditional expression `first ? second : third' expression tree node
*/
class ExpressionTreeConditional : public ExpressionTree
{
public:
/**
* Constructs a binary function tree node
*/
ExpressionTreeConditional (
const ParsingData& parsingData,
ExpressionTree* first, ExpressionTree* second, ExpressionTree* third)
: ExpressionTree (parsingData),
m_first (first), m_second (second), m_third (third)
{
}
/**
* Value of the contitional expression
*/
virtual double Value ();
virtual size_t Height () const
{
return 1 + max (max (m_first->Height (), m_second->Height ()),
m_third->Height ());
}
virtual ExpressionTree* GetSimplifiedTree ();
virtual ExpressionTreeType::Enum GetType () const
{
return ExpressionTreeType::CONDITIONAL;
}
virtual string ToString ();
virtual bool HasConditional ()
{
return true;
}
private:
boost::shared_ptr<ExpressionTree> m_first;
boost::shared_ptr<ExpressionTree> m_second;
boost::shared_ptr<ExpressionTree> m_third;
};
inline ostream& operator<< (ostream& ostr, ExpressionTree& t)
{
return ostr << t.ToString ();
}
#endif //__EXPRESSION_TREE_H__
// Local Variables:
// mode: c++
// End: