-
Notifications
You must be signed in to change notification settings - Fork 22
/
yieldable-parser.js
executable file
·345 lines (333 loc) · 9.48 KB
/
yieldable-parser.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
/* **************************************************************************
*
* (c) Copyright IBM Corp. 2017
*
* This program and the accompanying materials are made available
* under the terms of the Apache License v2.0 which accompanies
* this distribution.
*
* The Apache License v2.0 is available at
* http://www.opensource.org/licenses/apache2.0.php
*
* Contributors:
* Multiple authors (IBM Corp.) - initial implementation and documentation
***************************************************************************/
'use strict';
const { indexOfGenerator } = require('./utils/index-of-generator');
/**
* This method parses a JSON text to produce an object or array.
* It can throw a SyntaxError exception, if the string is malformed.
* @param { string } text
* @param { function or array } reviver
* @param { number } intensity
* @param { function } cb
* @return { function } yieldCPU
*/
let parseWrapper = (text, reviver, intensity, cb) => {
let counter = 0;
let keyN = 0;
let parseStr = text;
let at = 0;
let ch = ' ';
let word = '';
function ParseError(m) {
this.name = 'ParseError';
this.message = m;
this.text = parseStr;
}
// Seek to the next character, after skipping white spaces, if any.
let seek = () => {
ch = parseStr.charAt(at);
at++;
while (ch && ch <= ' ') {
seek();
}
return ch;
};
// Seek to the previous character, required in some special cases.
let unseek = () => {
ch = parseStr.charAt(--at);
};
// Match 'true', 'false' and 'null' built-ins.
let wordCheck = () => {
word = '';
do {
word += ch;
seek();
} while (ch.match(/[a-z]/i));
parseStr = parseStr.slice(at - 1);
at = 0;
return word;
};
// Process strings specially.
let normalizeUnicodedString = function*() {
let inQuotes = ' ';
let tempIndex = at;
let index = 0;
let slash = 0;
let c = '"';
while (c) {
index = yield * indexOfGenerator(parseStr, '"', tempIndex + 1);
tempIndex = index;
ch = parseStr.charAt(tempIndex - 1);
while (ch === '\\') {
slash++;
ch = parseStr.charAt(tempIndex - (slash + 1));
}
if (slash % 2 === 0) {
inQuotes = parseStr.substring(at, index);
parseStr = parseStr.slice(++index);
slash = 0;
break;
} else
slash = 0;
}
// When parsing string values, look for " and \ characters.
index = yield * indexOfGenerator(inQuotes, '\\');
while (index >= 0) {
let escapee = {
'"': '"',
'\'': '\'',
'/': '/',
'\\': '\\',
b: '\b',
f: '\f',
n: '\n',
r: '\r',
t: '\t',
};
let hex = 0;
let i = 0;
let uffff = 0;
at = index;
ch = inQuotes.charAt(++at);
if (ch === 'u') {
uffff = 0;
for (i = 0; i < 4; i += 1) {
hex = parseInt(ch = inQuotes.charAt(++at), 16);
if (!isFinite(hex)) {
break;
}
uffff = uffff * 16 + hex;
}
inQuotes = inQuotes.slice(0, index) +
String.fromCharCode(uffff) + inQuotes.slice(index + 6);
at = index;
} else if (typeof escapee[ch] === 'string') {
inQuotes = inQuotes.slice(0, index) +
escapee[ch] + inQuotes.slice(index + 2);
at = index + 1;
} else
break;
index = yield * indexOfGenerator(inQuotes, '\\', at);
}
at = 0;
return inQuotes;
};
/**
* This function parses the current string and returns the JavaScript
* Object, through recursive method, and yielding back occasionally
* based on the intensity parameter.
* @return { object } returnObj
*/
function * parseYield() {
let key = '';
let returnObj = {};
let returnArr = [];
let v = '';
let inQuotes = '';
let num = 0;
let numHolder = '';
let addup = () => {
numHolder += ch;
seek();
};
// Handle premitive types. eg: JSON.parse(21)
if (typeof parseStr === 'number' || typeof parseStr === 'boolean' ||
parseStr === null) {
parseStr = '';
return text;
} else if (typeof parseStr === 'undefined') {
parseStr = undefined;
return text;
} else if (parseStr.charAt(0) === '[' && parseStr.charAt(1) === ']') {
parseStr = '';
return [];
} else if (parseStr.charAt(0) === '{' && parseStr.charAt(1) === '}') {
parseStr = '';
return {};
} else {
// Yield the parsing work at specified intervals.
if (++counter > 512 * intensity) {
counter = 0;
yield;
}
// Common case: non-premitive types.
if (keyN !== 1)
seek();
switch (ch) {
case '{':
// Object case
seek();
if (ch === '}') {
parseStr = parseStr.slice(at);
at = 0;
return returnObj;
}
do {
if (ch !== '"')
seek();
keyN = 1;
key = yield *parseYield();
keyN = 0;
seek();
returnObj[key] = yield *parseYield();
seek();
if (ch === '}') {
parseStr = parseStr.slice(at);
at = 0;
return returnObj;
}
} while (ch === ',');
return new ParseError('Bad object');
case '[':
// Array case
seek();
if (ch === ']') {
parseStr = parseStr.slice(at);
at = 0;
return returnArr;
}
unseek();
do {
v = yield *parseYield();
returnArr.push(v);
seek();
if (ch === ']') {
parseStr = parseStr.slice(at);
at = 0;
return returnArr;
}
} while (ch === ',');
return new ParseError('Bad array');
case '"':
parseStr = parseStr.slice(at - 1);
at = 0;
if (parseStr.charAt(0) === '"' && parseStr.charAt(1) === '"') {
parseStr = parseStr.slice(2);
at = 0;
return inQuotes;
} else {
seek();
return yield * normalizeUnicodedString();
}
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
case '-':
if (ch === '-') addup();
do {
addup();
if (ch === '.' || ch === 'e' || ch === 'E' ||
ch === '-' || ch === '+' ||
(ch >= String.fromCharCode(65) &&
ch <= String.fromCharCode(70)))
addup();
} while (ch === '-' || ch === '+' || (isFinite(ch) && ch !== ''));
num = Number(numHolder);
parseStr = parseStr.slice(at - 1);
at = 0;
return num;
case 't':
word = wordCheck();
if (word === 'true')
return true;
else return new ParseError('Unexpected character');
case 'f':
word = wordCheck();
if (word === 'false')
return false;
else return new ParseError('Unexpected character');
case 'n':
word = wordCheck();
if (word === 'null')
return null;
else return new ParseError('Unexpected character');
default:
return new ParseError('Unexpected character');
}
}
}
/**
* If there is a reviver function, we recursively walk the new structure,
* passing each name/value pair to the reviver function for possible
* transformation, starting with a temporary root object that holds the result
* in an empty key. If there is not a reviver function, we simply return the
* result.
* @param { object } yieldedObject
* @param { string } key
* @return { function } reviver
*/
let revive = (yieldedObject, key) => {
let k = '';
let v = '';
let val = yieldedObject[key];
if (val && typeof val === 'object') {
for (k in val) {
if (Object.prototype.hasOwnProperty.call(val, k)) {
v = revive(val, k);
if (v !== undefined)
val[k] = v;
else
delete val[k];
}
}
}
return reviver.call(yieldedObject, key, val);
};
let yielding = '';
// To hold 'parseYield' genarator function
function * yieldBridge() {
yielding = yield* parseYield();
}
let rs = yieldBridge();
let gen = rs.next();
// Main yield control logic.
let yieldCPU = () => {
setImmediate(() => {
gen = rs.next();
if (gen && gen.done === true) {
let isEmpty = (value) => {
if (value.charAt(0) === '}' || value.charAt(0) === ']')
value = value.substring(1, value.length);
return typeof value === 'string' && !value.trim();
};
if (typeof yielding === 'undefined')
return cb(new ParseError('Unexpected Character'), null);
else if (yielding instanceof ParseError)
return cb(yielding, null);
else if (!isEmpty(parseStr))
return cb(new ParseError('Unexpected Character'), null);
else {
if (reviver !== null) {
if (typeof reviver === 'function') {
let result = revive({'': yielding}, '');
return cb(null, result);
}
} else
return cb(null, yielding);
}
}
yieldCPU();
});
};
return yieldCPU();
};
exports.parseWrapper = parseWrapper;