-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathArithExpr.hpp
More file actions
166 lines (126 loc) · 4 KB
/
ArithExpr.hpp
File metadata and controls
166 lines (126 loc) · 4 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
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
#ifndef EXPRINTER_ARITHEXPR_HPP
#define EXPRINTER_ARITHEXPR_HPP
#include "Token.hpp"
#include "SymTab.hpp"
class Functions;
// Classes in this file define the internal representation of expressions.
// An ExprNode serves as the base class (super class) for an expression.
// It forces the derived classes (subclasses) to implement two functions, print and
// evaluate.
class ExprNode {
public:
ExprNode(Token token);
Token token() const;
Token &token() { return _token; }
virtual void print() = 0;
virtual TypeDescriptor* evaluate(SymTab &symTab) = 0;
private:
Token _token;
};
// An InfixExprNode is useful to represent binary arithmetic operators.
class InfixExprNode: public ExprNode { // An expression tree node.
public:
InfixExprNode(Token tk);
ExprNode *&left();
ExprNode *&right();
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
private:
ExprNode *_left, *_right;
};
// A RelExprNode is useful to represent binary relational operators.
class RelExprNode: public ExprNode { // An expression tree node.
public:
RelExprNode(Token tk);
ExprNode *&left();
ExprNode *&right();
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
private:
ExprNode *_left, *_right;
};
// A BoolExprNode is useful to represent binary boolean operators.
class BoolExprNode: public ExprNode { // An expression tree node.
public:
BoolExprNode(Token tk);
ExprNode *&left();
ExprNode *&right();
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
private:
ExprNode *_left, *_right;
};
// A NotExprNode is useful to represent the unary 'not' operator.
class NotExprNode: public ExprNode { // An expression tree node.
public:
NotExprNode(Token tk);
ExprNode *&right();
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
private:
ExprNode *_right;
};
// A Subscription is useful to represent a subscription into an array
class Subscription: public ExprNode {
public:
Subscription(Token varName, ExprNode* subscript);
ExprNode *&subscript();
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
private:
ExprNode *_subscript;
};
// A Len is useful to represent a length call on an array
class Len: public ExprNode {
public:
Len(Token varName);
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
};
class Call: public ExprNode {
public:
Call(Token funcName, Functions* funcList, std::vector<ExprNode*> args);
std::vector<ExprNode*> &args();
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
private:
std::vector<ExprNode*> _args;
Functions* _funcList;
};
// WholeNumber is a leaf-node in an expression tree. It corresponds to
// a terminal in the production rules of the grammar that describes the
// syntax of expressions.
class WholeNumber: public ExprNode {
public:
WholeNumber(Token token);
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
};
// Variable is a leaf-node in an expression tree. It corresponds to
// a terminal in the production rules of the grammar that describes the
// syntax of expressions.
class Variable: public ExprNode {
public:
Variable(Token token);
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
};
// Double is a leaf-node in an expression tree. It corresponds to
// a terminal in the production rules of the grammar that describes the
// syntax of expressions.
class Double: public ExprNode {
public:
Double(Token token);
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
};
// String is a leaf-node in an expression tree. It corresponds to
// a terminal in the production rules of the grammar that describes the
// syntax of expressions.
class String: public ExprNode {
public:
String(Token token);
virtual void print();
virtual TypeDescriptor* evaluate(SymTab &symTab);
};
#endif //EXPRINTER_ARITHEXPR_HPP