-
Notifications
You must be signed in to change notification settings - Fork 0
/
whitespace2.js
602 lines (507 loc) · 19.6 KB
/
whitespace2.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
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
// Token tests:
const SSTS = " \t\t\n \t \t\n";
const indx23 = " \t\t\n \t \n \t\n \t \n";
const SLS = indx23 + " \n ";
const SLL = indx23 + " \n\n";
const TSSS = indx23 + "\t ";
const TSST = indx23 + "\t \t";
const TSSL = indx23 + "\t \n";
const indx44 = indx23 + " \t\t \n \t \t\n \t\t\t\n";
const TTS = indx44 + "\t\t ";
const TSTS = indx44 + "\t \t ";
const TSTT = indx44 + "\t \t\t";
const TTT = TTS + "\t\t\t";
let whiteSpaceStream = TTT;
// " \t\t\n \t \n \t\n \t \n \t\t \n \t \t\n \t\t\t\n \n\t \t\n \t\t\n\t\n \t\t\n \t\t\n \t\t\n \t\n\n\n"; // 5123
console.log("white space length is " + whiteSpaceStream.length);
// MEMORY THINGS:
const stack = [];
const heap = new Object();
let readRegister = [];
let inputPointer = 0;
// These functions are for reading from input
// *
const readCharFromInput = (indx, inputArr) => {
console.log("TOKEN TLTS READING CHARACTER FROM INPUT...");
// Get character from input:
const a = inputArr.pop();
const heapAddress = stack.popValue(stack.length - 1, 1);
// Store value a at heapAddress on heap:
$.storeAtHeapAddress(a, heapAddress);
return indx;
};
const readNumFromInput = (indx, inputArr) => {
let currentInputIndx = inputPointer;
let terminatingCharacter = "\n";
let readInput = [];
// Handle converting parsed number into correct base:
const convertNumToBinary = (numString) => {
return num;
};
const convertNumToHex = (numString) => {
return num;
};
const convertNumToOctal = (numString) => {
return num;
};
for (
currentInputIndx;
inputArr[currentInputIndx] != terminatingCharacter;
currentInputIndx--
) {
readInput.push(inputArr[currentInputIndx]); // [s, i, h, t] -> [t, h, i, s]
}
inputPointer = currentInputIndx;
// Check input
if (readInput.length < 1) {
console.log("Number read from input is not long enough");
throw new Error();
}
const prefix = readInput[0];
let num = "";
switch (prefix) {
case "0":
let pref2 = readInput[1];
switch (pref2) {
case undefined:
console.log("Number is decimal 0");
num = BigInt(readInput.join(""));
case "x":
console.log("number is hex");
num = convertNumToHex(readInput);
case "b":
console.log("number is binary");
num = convertNumToBinary(readInput);
default:
console.log("number is octal");
num = convertNumToOctal(readInput);
}
default:
console.log("number is decimal and not 0");
num = BigInt(readInput.join(""));
}
};
// VimIsTrash['pushValue'](v)
const VimIsTrash = {
pushValue: (v) => {
console.log(`Pushing ${v} onto stack.`);
// v is an array of values to be pushed onto the stack
for (const val of v) {
stack.push(val);
}
},
popValue: (start, count) => {
console.log(
`Popping ${count} values off stack starting from indx ${start}.`
);
// Make sure there are values on the stack before popping:
if (stack.length === 0) {
console.log(
"ERROR: Attempting to pop value from stack, but stack is empty."
);
throw new Error();
}
// Make sure there are enough values on the stack:
if (stack.length < count) {
console.log(
`ERROR: Attempting to pop ${count} values off of stack, but stack length is only ${stack.length}.`
);
throw new Error();
}
const poppedItems = stack.splice(start, count);
return poppedItems;
},
getNum: (indx) => {
console.log(`Getting N number.`);
// move index to start consuming number
indx++;
if (whiteSpaceStream[indx] === "\n") {
console.log(
`ERROR: this number is just a terminal character! \n
The currentIndex is ${indx},
the character is ${whiteSpaceStream[indx]}`
);
throw new Error();
}
let sign = whiteSpaceStream[indx] === "\t" ? -1 : 1;
indx++;
let num = new Number(0);
for (indx; whiteSpaceStream[indx] !== "\n"; indx++) {
// Bit shift number to the left to increment it (in binary)
num << 1; // 011101
if (whiteSpaceStream[indx] === "\t") {
num++;
} else {
if (whiteSpaceStream[indx] !== " ") {
console.log(
`ERROR: this character is not a number, line 214 \n
The currentIndex is ${indx},
the character is ${whiteSpaceStream[indx]}`
);
throw new Error();
}
}
}
// return array w/ number and new indx:
console.log(`Returning N = ${num} from getNum()`);
return [num * sign, indx];
},
doMath: (operands, operation) => {
console.log(`Doing math: ${operands[1]} ${operation} ${operands[0]}`);
// operands is an array of the operands
const a = operands[0];
const b = operands[1];
// operation...
switch (operation) {
case "+":
return b + a;
case "-":
return b - a;
case "*":
return b * a;
case "/":
return Math.floor(b / a);
case "%":
return b % a;
}
},
storeAtHeapAddress: (value, address) => {
console.log(`Storing value ${value} at heap address ${address}`);
// Make address string:
const aString = address.toString();
// const aString = "69";
// If this key already exists:
if (heap[aString]) {
console.log(`That address already exists on the heap`);
throw new Error();
}
heap[aString] = value;
console.log(`HEAP at address ${aString}: ${heap[aString]}`);
return;
},
getValueFromHeapAddress: (address) => {
// console.log(`Getting value at address ${address} from the heap`);
// Make sure the address is a string, access it the same way we're creating the key:
const aString = address.toString();
// const aString = "69";
console.log(`Getting value at address ${aString} from the heap`);
// Check obj keys for aString:
const val = heap[aString];
// If there is nothing at this address, freak out:
if (val == undefined) {
console.log(`ERROR: that address doesn't exist in the heap`);
throw new Error();
}
console.log(`Value from heap = ${val}`);
return val;
},
};
let $ = VimIsTrash;
// Start at root for each new command, hit a leaf = new command, start at root again
const tokenTrie = {
// Stack Manipulation TOKENS
" ": {
// TOKEN: SS: Pushes N onto the stack
" ": (indx) => {
console.log(`TOKEN: SS: Push N onto stack`);
// Get number to be pushed
let arrFromGetNum = $.getNum(indx);
let numToPush = arrFromGetNum[0];
// Set instruction pointer to new index from getNum()
indx = arrFromGetNum[1];
// Push num to stack
$.pushValue([numToPush]);
return indx;
},
"\t": {
// TOKEN: STS: DuplicateNthValueOnStackAndPushOntoStack
" ": (indx) => {
console.log(
`TOKEN: STS: Duplicate Nth Value On Stack And Push Onto Stack`
);
// get num (Nth value)
const getNumArr = $.getNum(indx)[0];
const nthValue = getNumArr[0];
indx = getNumArr[1];
// pop
// ** popValue() is returning an array of the values popped from stack
let start = stack.length - nthValue;
const popVal = $.popValue(start, 1)[0];
// duplicate
const copy = popVal;
// push copy and popVal
$.pushValue([popVal, copy]);
// return new index:
return indx;
},
// TOKEN: STL: discard top N Values from stack
"\n": (indx) => {
console.log(`TOKEN: STL: Discard top N values from stack`);
// get num for N value
const getNumArr = $.getNum(indx);
const nValue = getNumArr[0];
indx = getNumArr[1];
// pop nValue values off stack
// let start = stack.length - (1 + nValue);
// $.popValue(start, );
for (let i = 1; i <= nValue; i++) {
let start = stack.length - 1;
$.popValue(start, 1);
}
// return new index:
return indx;
},
// TOKEN: STT: "\t": this TOKEN doesn't exist (STS)
},
"\n": {
// TOKEN: SLS = Duplicate top value on stack
" ": (indx) => {
console.log("TOKEN: SLS: Duplicate top value on stack");
// pop top value off the stack (the last value in the array)
// ** popValue() returns an array of values popped from stack
const start = stack.length - 1;
const popVal = $.popValue(start, 1)[0];
// push both onto stack:
const copy = popVal;
$.pushValue([popVal, copy]);
return indx;
},
// TOKEN: SLT = Swap two values on stack
"\t": (indx) => {
console.log("TOKEN: SLT: Swap two values on stack");
// pop top two top values on the stack:
// ** popValue() returns the values popped in an array
const start = stack.length - 2; // [x,y,x,y,x,y]
const poppedVals = $.popValue(start, 2);
// push them back on to the stack, swapped:
$.pushValue([poppedVals[1], poppedVals[0]]);
return indx;
},
// TOKEN: SLL = Discard the top value on stack
"\n": (indx) => {
console.log(`TOKEN: SLL: Discard the top value on stack`);
// pop top value from stack:
const start = stack.length - 1;
$.popValue(start, 1);
return indx;
},
},
},
// Arithmetic && Heap Access & I/O TOKENS:
"\t": {
// Arithmetic TOKENS:
" ": {
" ": {
// TOKEN: TSSS: Pop a & b, add them, push them back onto stack
" ": (indx) => {
console.log(
"TOKEN: TSSS: Pop A & B, add them, push them back onto stack"
);
// Pop A and B:
const start = stack.length - 2;
const poppedVals = $.popValue(start, 2);
const a = poppedVals[0];
const b = poppedVals[1];
// Add them:
const sum = $.doMath([a, b], "+");
// push answer onto stack
$.pushValue([sum]);
return indx;
},
// TOKEN: TSST: Pop a & b, then push b-a
"\t": (indx) => {
console.log("TOKEN: TSST: Pop a &b, then push b-a");
// Pop A and B:
const start = stack.length - 2;
const poppedVals = $.popValue(start, 2);
const a = poppedVals[0];
const b = poppedVals[1];
// do math:
const operation = "-";
const answer = $.doMath([a, b], operation);
// push result onto stack
$.pushValue([answer]);
return indx;
},
// TOKEN: TSSL: Pop a & b, and push b * a onto stack
"\n": (indx) => {
console.log(
"TOKEN: TSSL: Pop a & b, and push b * a onto stack"
);
// Pop A and B:
const start = stack.length - 2;
const poppedVals = $.popValue(start, 2);
const a = poppedVals[0];
const b = poppedVals[1];
// do math:
const operation = "*";
const answer = $.doMath([a, b], operation);
// push result onto stack
$.pushValue([answer]);
return indx;
},
},
"\t": {
// TOKEN: TSTS: DIVISION
" ": (indx) => {
console.log(
" TOKEN: TSTS: DIVISION of a and b and then push on stack"
);
// Pop A and B:
const start = stack.length - 2;
const poppedVals = $.popValue(start, 2);
const a = poppedVals[0];
if (a === 0) {
console.log(
`ERROR: a cannot be used in division operation b/c it's 0`
);
throw new Error();
}
const b = poppedVals[1];
// do math:
const operation = "/";
const answer = $.doMath([a, b], operation);
// push result onto stack
$.pushValue([answer]);
return indx;
},
// TOKEN: TSTT: Modulo
"\t": (indx) => {
console.log(
"TOKEN: TSTT Mmodulo a and b and put the answer on the stack"
);
// Pop A and B:
const start = stack.length - 2;
const poppedVals = $.popValue(start, 2);
const a = poppedVals[0];
if (a === 0) {
console.log(
`ERROR: a cannot be used in division operation b/c it's 0`
);
throw new Error();
}
const b = poppedVals[1];
// do math:
const operation = "%";
const answer = $.doMath([a, b], operation);
// push result onto stack
$.pushValue([answer]);
return indx;
},
},
},
// Heap Access TOKENS:
"\t": {
// TOKEN: TTS: Pop a & b store a at heap address b
" ": (indx) => {
console.log(
"TOKEN: TTS: Pop a & b off the stack & store a at heap address b"
);
// Pop A and B:
const start = stack.length - 2;
const poppedVals = $.popValue(start, 2);
const a = poppedVals[0];
const b = poppedVals[1];
// store a on heap at address b
$.storeAtHeapAddress(a, b);
return indx;
},
"\t": (indx) => {
// TOKEN: TTT: pop a, push heap value at adress a on to the stack
console.log(
"TOKEN: TTT: pop a, push heap value at adress a on to the stack"
);
const a = $.popValue(stack.length - 1, 1);
const heapVal = $.getValueFromHeapAddress(a);
// Turn string value back into number:
const numVal = heapVal * 1;
// Push value from heap onto stack:
stack.push(numVal);
return indx;
},
},
// I/O TOKENS:
"\n": {
" ": {
" ": (indx) => {
// TLSS TOKEN: Pop a value off the stack and output it as a character.
console.log(
" TLSS TOKEN: Pop a value off the stack and output it as a character."
);
return;
},
"\t": (indx) => {
// TLST TOKEN: Pop a value off the stack and output it as a character.
console.log(
" TLST TOKEN: Pop a value off the stack and output it as a character."
);
return;
},
},
"\t": {
" ": (indx, readInputFlag) => {
// TOKEN: TLTS: Read a character from input, a, Pop a value off the stack, b, then store the ASCII value of a at heap address b.
register.push(readCharFromInput);
readInputFlag = true;
return indx;
},
"\t": (indx, readInputFlag) => {
// TOKEN: TLTT: Read a number from input, a, Pop a value off the stack, b, then store a at heap address b.
readRegister.push(readNumFromInput);
readInputFlag = true;
return indx;
},
},
},
},
};
function whitespace(stream, input) {
let inputArr = input.split("");
// Reverse the input arr so we can just pop items off it as we need
inputArr.reverse();
// Set the input pointer to end of inputArr:
inputPointer = inputArr.length - 1;
let currentNode = tokenTrie;
let readFromInputFlag = false;
let output = "";
// go through stream char by char to find token in tokenTrie
// ea token function should return the new index (or if the
// index hasn't changed, return the same index as was given to it)
for (
let instructionPointer = 0;
instructionPointer <= stream.length - 1;
instructionPointer++
) {
currentNode = currentNode[stream[instructionPointer]];
if (typeof currentNode === "function") {
// Set the instruction pointer to the returned value of ea token function
// ** We might want to return more than the new index in the future
// **
instructionPointer = currentNode(
instructionPointer,
readFromInputFlag
);
// Check if the function is for reading from input:
if (readFromInputFlag) {
console.log("GETTING FUNC FROM REGISTER");
readFromInputFlag = false;
// Call whatever read input function is in the register:
instructionPointer = register[0](instructionPointer, inputArr);
// Clear the register:
register = [];
}
console.log(`INDEX: ${instructionPointer}`);
// We've executed a function, so reset the currentNode
currentNode = tokenTrie;
console.log(`OUTPUT: ${output}`);
console.log(`STACK: ${stack}`);
console.log(`type of stack value 0 = ${typeof stack[0]}`);
}
}
return output;
}
// Test Input:
const testInput = "33";
const testStream = " \t\t\n \t \n \n\t\t\n\t\t\t\n\t\t\n\n\n";
whitespace(testStream, testInput);
// whitespace(whiteSpaceStream, testInput);