-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexpression.cpp
More file actions
307 lines (237 loc) · 6.68 KB
/
Copy pathexpression.cpp
File metadata and controls
307 lines (237 loc) · 6.68 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
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
#include "Expression.h"
#include <stack>
//constructor
Expression::Expression() {
original = " ";
valid = false;
type = illegal;
}
//copy contructor
Expression::Expression(const string& s) {
set(s);
}
//set method, used to set the private variables
void Expression::set(const string& s) {
original = s; //original string
string str = "";
int i = 0;
while (i < s.size()){ //until the end of the string
//if the char at i is equal to =, /, *, -, +, (, ), or ; they is a space added between them
if ((s.at(i) == '=') || (s.at(i) == '/') || (s.at(i) == '*') || (s.at(i) == '-') || (s.at(i) == '+') || (s.at(i) == '(') || (s.at(i) == ')') || (s.at(i) ==';')) {
str.push_back(' ');
str.push_back(s.at(i));
str.push_back(' ');
}
else {
str.push_back(s.at(i));
}
i++;
}
string set;
int j;
i = 0;
while (i < str.size()) {
//if there is a space, we have found a token added into the tokenized vector
while ((str[i] == ' ') && (str[i] != '\0')) {
i++;
}
j = i;
while ((str[j] != ' ' ) && (str[j] != '\0')){
j++;
}
for (i; i < j; i++) {
set.push_back(str[i]);
}
i = j + 1;
tokenized.push_back(set);
set.clear();
}
i = 0, j = 0;
// check if there is any = signs
while (s[i] != '=') {
i++;
}
//check if there isnt any = signs
while ((s[j] == '+') || (s[j] == '-') || (s[j] == '*') || (s[j] == '/') || (isdigit(s[j])) || (isalpha(s[j]))) {
j++;
}
//if there is an = sign, type is assignment
if (i < s.size()) {
type = assignment;
valid = true;
}
//else is an arithmetic
else if (j == s.size()) {
type = arithmetic;
valid = true;
}
//if neither applies it is an illegal type
else {
type = illegal;
valid = false;
}
}
//we postfix the tokenized expression earlier.
void Expression::postfixed(){
stack <Token> ops;
int i = 0;
for (i; i < tokenized.size(); i++) {
if ((tokenized[i].get_type() == ID ) || (tokenized[i].get_type() == INT)) {
postfix.push_back(tokenized[i]);
}
else if (tokenized[i].get_type() == Openbrace) {
ops.push(tokenized[i]);
}
else if (tokenized[i].get_type() == Closebrace) {
while (ops.top().get_type() != Openbrace) {
postfix.push_back(ops.top());
ops.pop();
}
ops.pop();
}
else if (tokenized[i].get_type() == OP) {
while ((!ops.empty()) && (ops.top().get_priority() >= tokenized[i].get_priority())){
postfix.push_back(ops.top());
ops.pop();
}
ops.push(tokenized[i]);
}
}
while (!ops.empty()) {
postfix.push_back(ops.top());
ops.pop();
}
}
//we prefix the expression
void Expression::prefixed() {
int index;
while ((tokenized[index].get_type() != EQ) && index < tokenized.size()) {
index++;
}
if (index == tokenized.size()) {
stack <Token> ops;
int i = 0;
while (i < tokenized.size()) {
if (tokenized[i].get_type() == Openbrace) {
ops.push(tokenized[i]);
}
else if (tokenized[i].get_type() == Closebrace) {
while (!ops.empty() && ops.top().get_type() != Openbrace) {
Token op1 = prefix.back();
prefix.pop_back();
Token op2 = prefix.back();
prefix.pop_back();
Token op = ops.top();
ops.pop();
string temp = op.get_token() + " " + op2.get_token() + " " + op1.get_token();
prefix.push_back(temp);
}
ops.pop();
}
else if ((tokenized[i].get_type() == ID) || (tokenized[i].get_type() == INT)){
prefix.push_back(tokenized[i]);
}
else {
while (!ops.empty() && tokenized[i].get_priority() <= ops.top().get_priority()) {
Token op1 = prefix.back();
prefix.pop_back();
Token op2 = prefix.back();
prefix.pop_back();
Token op = ops.top();
ops.pop();
string temp = op.get_token() + " " + op2.get_token() + " " + op1.get_token();
prefix.push_back(temp);
}
ops.push(tokenized[i]);
}
i++;
}
while (!ops.empty()) {
Token op1 = prefix.back();
prefix.pop_back();
Token op2 = prefix.back();
prefix.pop_back();
Token op = ops.top();
ops.pop();
string temp = op.get_token() + " " + op2.get_token() +" " +op1.get_token();
prefix.push_back(temp);
}
}
}
void Expression::parenthesize() {
// postfixed(); //make sure the vector isnt empty
stack <string> ops;
string a, b;
string parenthesis;
for (int i = 0; i < postfix.size(); i++) {
if (postfix[i].get_type() == OP) {
a = ops.top(); //get the top
ops.pop(); //pop the top
b= ops.top(); //get the top
ops.pop(); // pop the top
parenthesis= "(" + b + postfix[i].get_token() + a + ")";
ops.push(parenthesis); //push the result back in the sa
}
else if((postfix[i].get_type() == INT) || (postfix[i].get_type() == ID)) { //if is an operand
ops.push(postfix[i].get_token());//push the operand on the stack
}
}
parenthesized = ops.top();
}
//methods used to print out the orignal, parenthesized, postfixed, prefixed.
void Expression::displayPost() const {
for (int i = 0; i < postfix.size(); i++) {
cout << postfix[i].get_token() <<" ";
}
}
void Expression::displayPre() const {
for (int i = 0; i < prefix.size(); i++) {
cout << prefix[i].get_token() <<" ";
}
}
void Expression::displayParenth() const {
cout << parenthesized;
}
void Expression::display() const {
for (int i = 0; i < tokenized.size(); i++) {
cout << tokenized[i].get_token() <<" ";
}
}
//used to calculate for the evaluation method
float calculate (float a, float b, string op) {
if (op == "+")
return a + b;
else if (op == "-")
return a - b;
else if (op == "*")
return a * b;
else if (op == "/")
return a / b;
}
float Expression::evaluate() {
postfixed(); //calling the function to make sure parenthesized isnt empty
float a, b;
stack <float> ops; //stack for operands
for (int i = 0; i < postfix.size(); i++) {
if(postfix[i].get_type() == OP) {
a = ops.top(); //get the top
ops.pop(); //pop the top
b = ops.top(); //get the top
ops.pop(); //pop the top
ops.push(calculate(b, a, postfix[i].get_token())); //push the val on the stack
}
else if (postfix[i].get_type() == INT) {
ops.push(postfix[i].value()); //if an operand push it on the stack
}
}
return ops.top();
}
Exp_type Expression::get_type() const {
return type;
}
string Expression::get_original() const {
return original;
}
vector <Token> Expression::get_tokenized() const{
return tokenized;
}