-
Notifications
You must be signed in to change notification settings - Fork 0
/
Parser.cpp
259 lines (207 loc) · 7.57 KB
/
Parser.cpp
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
#include "Parser.h"
#include <iostream>
Parser::~Parser() {
delete datalogProgram;
for (Token* token : tokens) {
delete token;
}
}
// Checks the syntax of the input program by parsing the vector of tokens generated by the lexer
// While doing so, generates a DatalogProgram object to be handled by the execution engine
DatalogProgram* Parser::Parse(std::vector<Token*> tokens) {
this->tokens = tokens;
this->index = 0;
try {
ParseDatalogProgram();
} catch (Token*& badToken) {
std::cout << "Failure!" << std::endl;
std::cout << " " << badToken->ToString() << std::endl;
}
return datalogProgram;
}
// After this function is called, a complete DatalogProgram object will be generated and returned
DatalogProgram* Parser::ParseDatalogProgram() {
datalogProgram = new DatalogProgram();
MatchTerminal(TokenType::SCHEMES);
MatchTerminal(TokenType::COLON);
datalogProgram->AddScheme(ParseScheme());
ParseSchemeList();
MatchTerminal(TokenType::FACTS);
MatchTerminal(TokenType::COLON);
ParseFactList();
MatchTerminal(TokenType::RULES);
MatchTerminal(TokenType::COLON);
ParseRuleList();
MatchTerminal(TokenType::QUERIES);
MatchTerminal(TokenType::COLON);
datalogProgram->AddQuery(ParseQuery());
ParseQueryList();
MatchTerminal(TokenType::END_OF_FILE);
return datalogProgram;
}
// Adds each scheme to the DatalogProgram object (except the first)
void Parser::ParseSchemeList() {
if (tokens.at(index)->GetType() != TokenType::FACTS) {
datalogProgram->AddScheme(ParseScheme());
ParseSchemeList();
}
}
// Adds each fact to the DatalogProgram object
void Parser::ParseFactList() {
if (tokens.at(index)->GetType() != TokenType::RULES) {
datalogProgram->AddFact(ParseFact());
ParseFactList();
}
}
// Adds each rule to the DatalogProgram object
void Parser::ParseRuleList() {
if (tokens.at(index)->GetType() != TokenType::QUERIES) {
datalogProgram->AddRule(ParseRule());
ParseRuleList();
}
}
// Adds each query to the DatalogProgram object (except the first)
void Parser::ParseQueryList() {
if (tokens.at(index)->GetType() != TokenType::END_OF_FILE) {
datalogProgram->AddQuery(ParseQuery());
ParseQueryList();
}
}
// Generates a scheme with an ID and populates it with parameters
Predicate* Parser::ParseScheme() {
Predicate* scheme = new Predicate();
scheme->SetId(tokens.at(index)->GetDesc());
MatchTerminal(TokenType::ID);
MatchTerminal(TokenType::LEFT_PAREN);
Parameter* parameter = new Parameter(tokens.at(index)->GetDesc());
scheme->AddParameter(parameter);
MatchTerminal(TokenType::ID);
ParseIdList(scheme);
MatchTerminal(TokenType::RIGHT_PAREN);
return scheme;
}
// Generates a fact with an ID and populates it with parameters
Predicate* Parser::ParseFact() {
Predicate* fact = new Predicate();
fact->SetId(tokens.at(index)->GetDesc());
MatchTerminal(TokenType::ID);
MatchTerminal(TokenType::LEFT_PAREN);
Parameter* parameter = new Parameter(tokens.at(index)->GetDesc());
fact->AddParameter(parameter);
MatchTerminal(TokenType::STRING);
ParseStringList(fact);
MatchTerminal(TokenType::RIGHT_PAREN);
MatchTerminal(TokenType::PERIOD);
return fact;
}
// Generates a rule with a head predicate and body predicates
Rule* Parser::ParseRule() {
Rule* rule = new Rule();
rule->AddHeadPredicate(ParseHeadPredicate());
MatchTerminal(TokenType::COLON_DASH);
rule->AddBodyPredicate(ParsePredicate());
ParsePredicateList(rule);
MatchTerminal(TokenType::PERIOD);
return rule;
}
// Generates a query
Predicate* Parser::ParseQuery() {
Predicate* query;
query = ParsePredicate();
MatchTerminal(TokenType::Q_MARK);
return query;
}
// Generates a head predicate with an ID and parameters
Predicate* Parser::ParseHeadPredicate() {
Predicate* headPredicate = new Predicate();
headPredicate->SetId(tokens.at(index)->GetDesc());
MatchTerminal(TokenType::ID);
MatchTerminal(TokenType::LEFT_PAREN);
Parameter* parameter = new Parameter(tokens.at(index)->GetDesc());
headPredicate->AddParameter(parameter);
MatchTerminal(TokenType::ID);
ParseIdList(headPredicate);
MatchTerminal(TokenType::RIGHT_PAREN);
return headPredicate;
}
// Generates a predicate (used by ParseQuery)
Predicate* Parser::ParsePredicate() {
Predicate* predicate = new Predicate();
predicate->SetId(tokens.at(index)->GetDesc());
MatchTerminal(TokenType::ID);
MatchTerminal(TokenType::LEFT_PAREN);
predicate->AddParameter(ParseParameter());
ParseParameterList(predicate);
MatchTerminal(TokenType::RIGHT_PAREN);
return predicate;
}
// Populates a rule with one predicate then calls itself recursively
void Parser::ParsePredicateList(Rule*& rule) {
if (tokens.at(index)->GetType() != TokenType::PERIOD) {
MatchTerminal(TokenType::COMMA);
rule->AddBodyPredicate(ParsePredicate());
ParsePredicateList(rule);
}
}
// Populates a predicate with one parameter then calls itself recursively
void Parser::ParseParameterList(Predicate*& predicate) {
if (tokens.at(index)->GetType() != TokenType::RIGHT_PAREN) {
MatchTerminal(TokenType::COMMA);
predicate->AddParameter(ParseParameter());
ParseParameterList(predicate);
}
}
// Populates a predicate with one parameter then calls itself recursively
void Parser::ParseStringList(Predicate*& predicate) {
if (tokens.at(index)->GetType() != TokenType::RIGHT_PAREN) {
MatchTerminal(TokenType::COMMA);
Parameter* parameter = new Parameter(tokens.at(index)->GetDesc());
predicate->AddParameter(parameter);
MatchTerminal(TokenType::STRING);
ParseStringList(predicate);
}
}
// Populates a predicate with one parameter then calls itself recursively
void Parser::ParseIdList(Predicate*& predicate) {
if (tokens.at(index)->GetType() != TokenType::RIGHT_PAREN) {
MatchTerminal(TokenType::COMMA);
Parameter* parameter = new Parameter(tokens.at(index)->GetDesc());
predicate->AddParameter(parameter);
MatchTerminal(TokenType::ID);
ParseIdList(predicate);
}
}
// Generates a parameter
Parameter* Parser::ParseParameter() {
Parameter* parameter = new Parameter(tokens.at(index)->GetDesc());
if (tokens.at(index)->GetType() == TokenType::STRING) {
MatchTerminal(TokenType::STRING);
}
else {
MatchTerminal(TokenType::ID);
}
return parameter;
}
// Checks if the current input token's type matches the terminal in the production.
// If it does, advance to the next token. If not, throw an exception.
void Parser::MatchTerminal(TokenType typeToMatch) {
// Skips the token if it is a comment
while (tokens.at(index)->GetType() == TokenType::COMMENT) {
index++;
}
if (tokens.at(index)->GetType() == typeToMatch) {
// If we are at the END_OF_FILE token, stop here.
if (tokens.at(index)->GetType() == TokenType::END_OF_FILE) {
return;
}
index++;
}
else {
throw tokens.at(index);
}
}
// Prints a string representation of the DatalogProgram object
void Parser::PrintStructs() {
std::cout << "Success!" << std::endl;
std::cout << datalogProgram->ToString() << std::endl;
}