-
Notifications
You must be signed in to change notification settings - Fork 0
/
q3.js
358 lines (302 loc) · 8.48 KB
/
q3.js
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
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
/*Anthony Courchesne
* 260688650
* COMP302 ast 2
* october 2016
*/
//----------Question 3---------------
//*****TO PARSE A STRING USE PARSE(STRING)**********
//PROGRAM DESCRIPTION
/*
The funtion parse define an object that contain a string so I can pass it as a reference
and use the string as a global, modifiable variable
The function removeToken call the scan function and reduce the string in the s object by the correct amount
The others function use recursion to parse every component, one function for each grammar rule, which
correspond to 1 function call for each node in the AST.
To parse a string, use the function parse(string)
*/
function removeToken(s, tset){ //take a string and a tokenset
var t = scan(s.str, tset);
s.str = s.str.substr(t.tokenvalue.length);
return t;
}
function parse(s){
//Define the global string that will be consumed token by token
var consume = {str: s};
return parseOuter(consume);
}
//Those functions use scan and return AST
function parseOuter(s){
//The parameter is in fact an object that contains a string so it is passed by reference to modify it within any parse function
var Outset = {
TSTART : true,
DSTART : true,
OUTERTEXT : true
}
if (!s.str){ //Check for end of string
return null;
}
var t = removeToken(s,Outset);
switch (t.token) {
case "OUTERTEXT":
return {
name: "outer",
OUTERTEXT: t.tokenvalue,
templateinvocation: null,
templatedef: null,
next: parseOuter(s)
}
case "TSTART": //Template invocation
return {
name: "outer",
OUTERTEXT: null,
templateinvocation: parseTemplateInvocation(s),
templatedef: null,
next: parseOuter(s)
}
case "DSTART": //Definition invocation
return {
name: "outer",
OUTERTEXT: null,
templateinvocation: null,
templatedef: parseTemplateDef(s),
next: parseOuter(s)
}
}
}
function parseTemplateInvocation(s){
// return template invocation ADT
//<templateinvocation> ::= TSTART <itext> <targs> TEND
var Inset = {
PSTART : true,
TSTART : true,
DSTART : true,
PIPE : true,
TEND : true,
INNERTEXT : true,
}
if (!s.str){ //Check for end of string
return null;
}
var rvalue = {
name : "templateinvocation",
itext : null,
targs : null
}
//Since we assume not empty and legal syntax, first part will be itext up to PIPE or TEND
var ans = parseIText(s);
rvalue.itext = ans.node;
//var nextToken = ans.nextToken; //last token get from the string, Should be TEND or PIPE
switch(ans.nextToken){
case "TEND":
break;
case "PIPE":
rvalue.targs = parseTArgs(s);
break;
}
return rvalue;
}
function parseTemplateDef(s){
//Similar to templateinvocation
var Inset = {
PSTART : true,
TSTART : true,
DSTART : true,
PIPE : true,
DEND : true,
INNERDTEXT : true,
}
if (!s.str){ //Check for end of string
return null;
}
var rvalue = {
name : "templatedef",
dtext : null,
dargs : null
}
//Since we assume not empty and legal syntax, first part will be itext up to PIPE or DEND
var ans = parseDText(s);
rvalue.dtext = ans.node;
//var nextToken = ans.nextToken; //last token get from the string, Should be TEND or PIPE
switch(ans.nextToken){
case "DEND":
break;
case "PIPE":
rvalue.dargs = parseDArgs(s);
break;
}
return rvalue;
}
function parseTParam(s){
if (!s.str){ //Check for end of string
return null;
}
var rvalue = {
name : "tparam",
PNAME : null
}
var tset = {
PNAME : true
}
var t = removeToken(s,tset);
rvalue.PNAME = t.tokenvalue;
removeToken(s, {PEND : true}); //remove the token PEND since it will not be usefull (No error checking, expecting good input)
return rvalue;
}
function parseIText(s){
var Inset = {
PSTART : true,
TSTART : true,
DSTART : true,
PIPE : true,
TEND : true,
INNERTEXT : true
}
if (!s.str){ //Check for end of string
return null;
}
var rvalue = {
name : "itext",
INNERTEXT : null,
templateinvocation : null,
templatedef : null,
tparam : null,
next : null
}
var t = null;
t = removeToken(s, Inset);
switch (t.token) {
case "INNERTEXT": //Set itext INNERTEXT and parse next itext
rvalue.INNERTEXT = t.tokenvalue;
break;
case "TSTART":
rvalue.templateinvocation = parseTemplateInvocation(s);
break;
case "DSTART":
rvalue.templatedef = parseTemplateDef(s);
break;
case "PSTART":
rvalue.tparam = parseTParam(s);
break;
case "PIPE":
return {
node: null,
nextToken: t.token
}
case "TEND":
return {
node: null,
nextToken: t.token
}
}
var ans = parseIText(s); //parse the next itext
var nextToken = null;
if(ans.nextToken == "PIPE" || ans.nextToken == "TEND"){
nextToken = ans.nextToken
}
rvalue.next = ans.node;
return {
node: rvalue,
nextToken: nextToken //should be either PIPE or TEND
}
}
function parseDText(s){
var InDset = {
PSTART: true,
TSTART: true,
DSTART: true,
PIPE: true,
DEND: true,
INNERDTEXT: true
}
if (!s.str) { //Check for end of string
return null;
}
var rvalue = {
name: "dtext",
INNERDTEXT: null,
templateinvocation: null,
templatedef: null,
tparam: null,
next: null
}
var t = null;
t = removeToken(s, InDset);
switch (t.token) {
case "INNERDTEXT": //Set itext INNERTEXT and parse next itext
rvalue.INNERDTEXT = t.tokenvalue;
break;
case "TSTART":
rvalue.templateinvocation = parseTemplateInvocation(s);
break;
case "DSTART":
rvalue.templatedef = parseTemplateDef(s);
break;
case "PSTART":
rvalue.tparam = parseTParam(s);
break;
case "PIPE":
return {
node: null,
nextToken: t.token
}
case "DEND":
return {
node: null,
nextToken: t.token
}
}
var ans = parseDText(s); //parse the next itext
var nextToken = null;
if (ans.nextToken == "PIPE" || ans.nextToken == "DEND") {
nextToken = ans.nextToken
}
rvalue.next = ans.node;
return {
node: rvalue,
nextToken: nextToken //should be either PIPE or TEND
}
}
function parseTArgs(s){
if (!s.str){ //Check for end of string
return null;
}
var rvalue = {
name : "targs",
itext : null,
next : null
}
//Since we assume not empty and legal syntax, first part will be itext up to PIPE or TEND
var ans = parseIText(s);
rvalue.itext = ans.node;
var t = ans.nextToken; //last token get from the string, Should be TEND or PIPE
switch(ans.nextToken){
case "TEND":
break;
case "PIPE":
rvalue.next = parseTArgs(s);
break;
}
return rvalue;
}
function parseDArgs(s){
if (!s.str){ //Check for end of string
return null;
}
var rvalue = {
name : "dargs",
dtext : null,
next : null
}
//Since we assume not empty and legal syntax, first part will be itext up to PIPE or TEND
var ans = parseDText(s);
rvalue.dtext = ans.node;
var t = ans.nextToken; //last token get from the string, Should be TEND or PIPE
switch(ans.nextToken){
case "TEND":
break;
case "PIPE":
rvalue.next = parseDArgs(s);
break;
}
return rvalue;
}