-
Notifications
You must be signed in to change notification settings - Fork 2
/
asm-llvm.js
3146 lines (2855 loc) · 138 KB
/
asm-llvm.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
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// `asm-llvm.js` is a parser for [asm.js](http://asmjs.org) written
// in [TurtleScript](http://github.com/cscott/turtlescript), a
// syntactically-simplified JavaScript. It is written by
// C. Scott Ananian and released under an MIT license.
//
// The parser is based on the tiny, fast
// [acorn parser](http://marijnhaverbeke.nl/acorn/)
// of Marijn Haverbeke, which in turn borrowed from
// [Esprima](http://esprima.org) by Ariya Hidayat.
//
// `asm-llvm.js` attempts to do parsing, type-checking, and compilation to
// LLVM bytecode in a single pass. Mozilla
// [bug 854061](https://bugzilla.mozilla.org/show_bug.cgi?id=854061)
// describes a similar attempt in the Firefox/SpiderMonkey codebase;
// [bug 864600](https://bugzilla.mozilla.org/show_bug.cgi?id=864600)
// describes recent changes to the `asm.js` spec to allow single-pass
// compilation.
//
// Copyright (c) 2013 C. Scott Ananian
define(['text!asm-llvm.js'], function asm_llvm(asm_llvm_source) {
"use strict";
// The module object.
// (This is used by `tests.js` to recreate the module source.)
var asm_llvm_module = {
__module_name__: "asm-llvm",
__module_init__: asm_llvm,
__module_deps__: [],
__module_source__: asm_llvm_source
};
// ## `asm.js` type system
// Set up the [type system of asm.js](http://asmjs.org/spec/latest/#types).
var Type = {
_id: 0,
_derived: {},
supertypes: []
};
// We do hash-consing of `Type` objects so that we have a singleton object
// representing every unique type, no matter how it was derived.
// The basis is `Type.derive()`, which creates one `Type` object from
// another.
Type.derive = (function() {
var id = 1;
var eq = function(ty) {
return (this===ty);
};
return function(spec, properties) {
var ty = this._derived[spec];
if (ty) { return ty; }
ty = this._derived[spec] = Object.create(this);
ty._id = id; id += 1;
ty._derived = Object.create(null);
ty.supertypes = [];
ty.value = false;
ty.min = ty.max = null;
// Default to a simple toString method, good for value types.
properties = properties || {};
if (!properties.hasOwnProperty('toString')) {
properties.toString = function() { return spec; };
}
// Default to a fast isSubtypeOf method
if (!properties.hasOwnProperty('supertypes')) {
properties.isSubtypeOf = eq;
}
// Allow the caller to override arbitrary properties.
Object.keys(properties || {}).forEach(function(k) {
if (properties[k] !== undefined) {
ty[k] = properties[k];
}
});
return ty;
};
})();
// Compute the subtype relation between types, based on the
// `supertypes` field.
Type.isSubtypeOf = function(ty) {
if (this === ty) { return true; } // common case
return this.supertypes.some(function(t) {
return t.isSubtypeOf(ty);
});
};
var Types = Object.create(null);
// The top-level internal types (which do not escape, and are not
// a supertype of any other type) are "doublish" and "intish".
// Intish represents the result of a JavaScript integer operation
// that must be coerced back to an integer with an explicit
// coercion.
Types.Intish = Type.derive("intish", { value: true });
// Similar to intish, the doublish type represents operations that
// are expected to produce a double but may produce additional
// junk that must be coerced back to a number.
Types.Doublish = Type.derive("doublish", { value: true });
// Void is the type of functions that are not supposed to return any
// useful value.
Types.Void = Type.derive("void", { value: true });
// The other internal (non-escaping) types are 'unknown' and 'int'.
// The unknown type represents a value returned from an FFI call.
Types.Unknown = Type.derive("unknown", {
value: true,
supertypes: [Types.Doublish, Types.Intish]
});
// The int type is the type of 32-bit integers where the
// signedness is not known.
Types.Int = Type.derive("int", {
value: true,
supertypes: [Types.Intish]
});
// The rest of the value types can escape into non-asm.js code.
Types.Extern = Type.derive("extern", { value: true });
Types.Double = Type.derive("double", {
value: true,
supertypes: [Types.Doublish, Types.Extern]
});
Types.Signed = Type.derive("signed", {
value: true,
supertypes: [Types.Extern, Types.Int],
min: -2147483648, // -2^31
max: -1 // range excludes 0
});
Types.Unsigned = Type.derive("unsigned", {
value: true,
supertypes: [Types.Int],
min: 2147483648, // 2^31
max: 4294967295 // (2^32)-1
});
Types.Fixnum = Type.derive("fixnum", {
value: true,
supertypes: [Types.Signed, Types.Unsigned],
min: 0,
max: 2147483647 // (2^31)-1
});
// Global (non-value) types.
Types.Function = Type.derive("Function");
Types.ArrayBufferView = Type.derive("ArrayBufferView");
['Int', 'Uint', 'Float'].forEach(function(elementType) {
var view = Types.ArrayBufferView.derive(elementType+'Array');
Types[elementType+'Array'] = function(n) {
return view.derive(n, {
arrayBufferView: true,
base: (elementType==='Float') ? Types.Doublish : Types.Intish,
bytes: Math.floor(n/8),
toString: function() { return elementType + n + 'Array'; }
});
};
});
Types.Arrow = (function() {
var arrowToString = function() {
var params = Array.prototype.map.call(this, function(pt) {
return pt.toString();
});
return '(' + params.join(',') + ')->' + this.retType.toString();
};
var arrowApply = function(args) {
return Array.prototype.every.call(this, function(pt, i) {
return args[i].isSubtypeOf(pt);
}) ? this.retType : null;
};
return function(argtypes, retType) {
// We derive a function type starting from the return type, and
// proceeding to the argument types in order.
var result = retType.derive('()->', {
arrow: true,
retType: retType,
length: 0, // number of arguments
apply: arrowApply,
toString: arrowToString
});
Array.prototype.forEach.call(argtypes, function(ty, idx) {
var param = { length: (idx+1), toString: undefined };
param[idx] = ty;
result = result.derive(ty._id, param);
});
return result;
};
})();
Types.FunctionTypes = (function() {
var functionTypesToString = function() {
var types = Array.prototype.map.call(this, function(f) {
return f.toString();
});
return '[' + types.join(' ^ ') + ']';
};
var functionTypesApply = function(args) {
var i = 0;
while (i < this.length) {
var ty = this[i].apply(args);
if (ty!==null) { return ty; }
i += 1;
}
return null;
};
return function(functiontypes) {
// Sort the function types by id, to make a canonical ordering,
// then derive the `FunctionTypes` type.
functiontypes.sort(function(a,b) { return a._id - b._id; });
var result = Type.derive('FunctionTypes', {
functiontypes: true,
length: 0, // number of arrow types
/* methods */
apply: functionTypesApply,
toString: functionTypesToString
});
functiontypes.forEach(function(ty, idx) {
var param = { length: (idx+1), toString: undefined };
param[idx] = ty;
result = result.derive(ty._id, param);
});
return result;
};
})();
Types.Table = (function() {
var tableToString = function() {
return '(' + this.base.toString() + ')[' + this.size + ']';
};
return function(functype, size) {
var t = functype.derive('Table', { table: true, base: functype });
return t.derive(size, { size: size, toString: tableToString });
};
})();
// Special type used to mark the module name, stdlib, foreign, and heap
// identifiers.
Types.Module = Type.derive("Module");
// Special type used to mark possible forward references.
// Note that a value of ForwardReference type should always be actually
// of type `Arrow` (local function) or `Table` (global function table).
Types.ForwardReference = Type.derive("ForwardReference");
// Quick self-test for the type system. Ensure that identical types
// created at two different times still compare ===.
var test_types = function() {
var sqrt1 = Types.FunctionTypes(
[Types.Arrow([Types.Double], Types.Double)]);
var sqrt2 = Types.FunctionTypes(
[Types.Arrow([Types.Double], Types.Double)]);
console.assert(sqrt1 === sqrt2);
console.assert(sqrt1.functiontypes);
console.assert(sqrt1.length===1);
console.assert(sqrt1[0].arrow);
console.assert(sqrt1[0].length===1);
console.assert(sqrt1[0][0]===Types.Double);
console.assert(Types.Arrow([],Types.Double).toString() === '()->double');
console.assert(sqrt1.toString() === '[(double)->double]');
// Test function table types.
var t1 = Types.Table(sqrt1[0], 16);
var t2 = Types.Table(sqrt2[0], 16);
console.assert(t1 === t2);
console.assert(t1.table);
console.assert(t1.size === 16);
console.assert(t1.toString() === '((double)->double)[16]');
};
test_types();
// Utility functions and constants.
var ceilLog2 = function(x) {
var r = 0; x-=1;
while (x!==0) { x = Math.floor(x/2); r+=1; } // XXX want shift!
return r;
};
// Only powerOf2 sizes are legit for function tables.
var powerOf2 = function(x) {
/* return (x & (x - 1)) === 0; // how cool kids do it */
return x === Math.pow(2, ceilLog2(x)); // TurtleScript needs bitwise ops
};
// ### Operator and standard library type tables.
// Unary operator types, from
// http://asmjs.org/spec/latest/#unary-operators
Types.unary = {
'+': Types.FunctionTypes(
[ Types.Arrow([Types.Signed], Types.Double),
Types.Arrow([Types.Unsigned], Types.Double),
Types.Arrow([Types.Doublish], Types.Double) ]),
'-': Types.FunctionTypes(
[ Types.Arrow([Types.Int], Types.Intish),
Types.Arrow([Types.Double], Types.Double) ]),
'~': Types.FunctionTypes(
[ Types.Arrow([Types.Intish], Types.Signed) ]),
'!': Types.FunctionTypes(
[ Types.Arrow([Types.Int], Types.Int) ]),
'~~': Types.FunctionTypes(
[ Types.Arrow([Types.Double], Types.Signed),
Types.Arrow([Types.Intish], Types.Signed) ])
};
// Binary operator types, from
// http://asmjs.org/spec/latest/#binary-operators
Types.binary = {
'+': Types.FunctionTypes(
[ Types.Arrow([Types.Double, Types.Double], Types.Double) ]),
'-': Types.FunctionTypes(
[ Types.Arrow([Types.Doublish, Types.Doublish], Types.Double) ]),
'*': Types.FunctionTypes(
[ Types.Arrow([Types.Doublish, Types.Doublish], Types.Double) ]),
'/': Types.FunctionTypes(
[ Types.Arrow([Types.Signed, Types.Signed], Types.Intish),
Types.Arrow([Types.Unsigned, Types.Unsigned], Types.Intish),
Types.Arrow([Types.Doublish, Types.Doublish], Types.Double) ]),
'%': Types.FunctionTypes(
[ Types.Arrow([Types.Signed, Types.Signed], Types.Intish),
Types.Arrow([Types.Unsigned, Types.Unsigned], Types.Intish),
Types.Arrow([Types.Doublish, Types.Doublish], Types.Double) ]),
'>>>': Types.FunctionTypes(
[ Types.Arrow([Types.Intish, Types.Intish], Types.Unsigned) ])
};
['|','&','^','<<','>>'].forEach(function(op) {
Types.binary[op] = Types.FunctionTypes(
[ Types.Arrow([Types.Intish, Types.Intish], Types.Signed) ]);
});
['<','<=','>','>=','==','!='].forEach(function(op) {
Types.binary[op] = Types.FunctionTypes(
[ Types.Arrow([Types.Signed, Types.Signed], Types.Int),
Types.Arrow([Types.Unsigned, Types.Unsigned], Types.Int),
Types.Arrow([Types.Double, Types.Double], Types.Int) ]);
});
// Standard library member types, from
// http://asmjs.org/spec/latest/#standard-library
Types.stdlib = {
'Infinity': Types.Double,
'NaN': Types.Double
};
['E','LN10','LN2','LOG2E','LOG10E','PI','SQRT1_2','SQRT2'].
forEach(function(f) {
Types.stdlib['Math.'+f] = Types.Double;
});
['acos','asin','atan','cos','sin','tan','ceil','floor','exp','log','sqrt'].
forEach(function(f) {
Types.stdlib['Math.'+f] = Types.FunctionTypes(
[Types.Arrow([Types.Doublish], Types.Double)]);
});
Types.stdlib['Math.abs'] = Types.FunctionTypes(
[Types.Arrow([Types.Signed], Types.Unsigned),
Types.Arrow([Types.Doublish], Types.Double)]);
Types.stdlib['Math.atan2'] = Types.stdlib['Math.pow'] = Types.FunctionTypes(
[Types.Arrow([Types.Doublish, Types.Doublish], Types.Double)]);
Types.stdlib['Math.imul'] = Types.FunctionTypes(
[Types.Arrow([Types.Int, Types.Int], Types.Signed)]);
// ## Tokens
// Some tokenizer functions will have alternate implementations in a
// TurtleScript environment -- for example, we'll try to avoid
// using regular expressions and dynamic eval.
var runningInTS = false; // XXX replace with an appropriate dynamic test
// Here we start borrowing liberally from acorn!
// We move the token types into module context, since they are
// (for all practical purposes) constants.
// ### Token Types
// The assignment of fine-grained, information-carrying type objects
// allows the tokenizer to store the information it has about a
// token in a way that is very cheap for the parser to look up.
// All token type variables start with an underscore, to make them
// easy to recognize.
// These are the general types. The `type` property is only used to
// make them recognizeable when debugging.
var _num = {type: "num"};
var _regexp = {type: "regexp"};
var _string = {type: "string"};
var _name = {type: "name"};
var _eof = {type: "eof"};
// `_dotnum` is a number with a `.` character in it; `asm.js` uses
// this to distinguish `double` from integer literals. We also
// use _dotnum to represent constants with negative exponent, such as
// `1e-1`.
var _dotnum = {type: "dotnum"};
// Keyword tokens. The `keyword` property (also used in keyword-like
// operators) indicates that the token originated from an
// identifier-like word, which is used when parsing property names.
//
// The `beforeExpr` property is used to disambiguate between regular
// expressions and divisions. It is set on all token types that can
// be followed by an expression (thus, a slash after them would be a
// regular expression).
//
// `isLoop` marks a keyword as starting a loop, which is important
// to know when parsing a label, in order to allow or disallow
// continue jumps to that label.
var _break = {keyword: "break"};
var _case = {keyword: "case", beforeExpr: true};
var _catch = {keyword: "catch"};
var _continue = {keyword: "continue"};
var _debugger = {keyword: "debugger"};
var _default = {keyword: "default"};
var _do = {keyword: "do", isLoop: true};
var _else = {keyword: "else", beforeExpr: true};
var _finally = {keyword: "finally"};
var _for = {keyword: "for", isLoop: true};
var _function = {keyword: "function"};
var _if = {keyword: "if"};
var _return = {keyword: "return", beforeExpr: true};
var _switch = {keyword: "switch"};
var _throw = {keyword: "throw", beforeExpr: true};
var _try = {keyword: "try"};
var _var = {keyword: "var"};
var _while = {keyword: "while", isLoop: true};
var _with = {keyword: "with"};
var _new = {keyword: "new", beforeExpr: true};
var _this = {keyword: "this"};
// The keywords that denote values.
var _null = {keyword: "null", atomValue: null};
var _true = {keyword: "true", atomValue: true};
var _false = {keyword: "false", atomValue: false};
// Some keywords are treated as regular operators. `in` sometimes
// (when parsing `for`) needs to be tested against specifically, so
// we assign a variable name to it for quick comparing.
var _in = {keyword: "in", binop: 7, beforeExpr: true};
// Map keyword names to token types.
var keywordTypes = {
"break": _break, "case": _case, "catch": _catch,
"continue": _continue, "debugger": _debugger, "default": _default,
"do": _do, "else": _else, "finally": _finally, "for": _for,
"function": _function, "if": _if, "return": _return,
"switch": _switch, "throw": _throw, "try": _try, "var": _var,
"while": _while, "with": _with, "null": _null, "true": _true,
"false": _false, "new": _new, "in": _in,
"instanceof": {keyword: "instanceof", binop: 7, beforeExpr: true},
"this": _this,
"typeof": {keyword: "typeof", prefix: true, beforeExpr: true},
"void": {keyword: "void", prefix: true, beforeExpr: true},
"delete": {keyword: "delete", prefix: true, beforeExpr: true}
};
// Punctuation token types. Again, the `type` property is purely for
// debugging.
var _bracketL = {type: "[", beforeExpr: true};
var _bracketR = {type: "]"};
var _braceL = {type: "{", beforeExpr: true};
var _braceR = {type: "}"};
var _parenL = {type: "(", beforeExpr: true};
var _parenR = {type: ")"};
var _comma = {type: ",", beforeExpr: true};
var _semi = {type: ";", beforeExpr: true};
var _colon = {type: ":", beforeExpr: true};
var _dot = {type: "."};
var _question = {type: "?", beforeExpr: true};
// Operators. These carry several kinds of properties to help the
// parser use them properly (the presence of these properties is
// what categorizes them as operators).
//
// `binop`, when present, specifies that this operator is a binary
// operator, and will refer to its precedence.
//
// `prefix` and `postfix` mark the operator as a prefix or postfix
// unary operator. `isUpdate` specifies that the node produced by
// the operator should be of type UpdateExpression rather than
// simply UnaryExpression (`++` and `--`).
//
// `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as
// binary operators with a very low precedence, that should result
// in AssignmentExpression nodes.
var _slash = {binop: 10, beforeExpr: true};
var _eq = {isAssign: true, beforeExpr: true};
var _assign = {isAssign: true, beforeExpr: true};
var _plusmin = {binop: 9, prefix: true, beforeExpr: true};
var _incdec = {postfix: true, prefix: true, isUpdate: true};
var _prefix = {prefix: true, beforeExpr: true};
var _bin1 = {binop: 1, beforeExpr: true};
var _bin2 = {binop: 2, beforeExpr: true};
var _bin3 = {binop: 3, beforeExpr: true};
var _bin4 = {binop: 4, beforeExpr: true};
var _bin5 = {binop: 5, beforeExpr: true};
var _bin6 = {binop: 6, beforeExpr: true};
var _bin7 = {binop: 7, beforeExpr: true};
var _bin8 = {binop: 8, beforeExpr: true};
var _bin10 = {binop: 10, beforeExpr: true};
// Provide access to the token types for external users of the
// tokenizer.
asm_llvm_module.tokTypes = {
_bracketL: _bracketL, _bracketR: _bracketR, _braceL: _braceL,
_braceR: _braceR, _parenL: _parenL, _parenR: _parenR, _comma: _comma,
_semi: _semi, _colon: _colon, _dot: _dot, _question: _question,
_slash: _slash, _eq: _eq, _name: _name, _eof: _eof, _num: _num,
_regexp: _regexp, _string: _string, _dotnum: _dotnum
};
Object.keys(keywordTypes).forEach(function(kw) {
asm_llvm_module.tokTypes['_' + kw] = keywordTypes[kw];
});
// This is a trick taken from Esprima. It turns out that, on
// non-Chrome browsers, to check whether a string is in a set, a
// predicate containing a big ugly `switch` statement is faster than
// a regular expression, and on Chrome the two are about on par.
// This function uses `eval` (non-lexical) to produce such a
// predicate from a space-separated string of words.
//
// It starts by sorting the words by length.
var makePredicate = function(words) {
words = words.split(" ");
// When running under TurtleScript, substitute a much simpler
// implementation (for now at least).
if (runningInTS) {
return function(str) { return words.indexOf(str) >= 0; };
}
// Otherwise, do the optimized code generation!
var f = "", cats = [];
var i = 0;
while (i < words.length) {
var j = 0;
while (j < cats.length) {
if (cats[j][0].length === words[i].length) {
cats[j].push(words[i]);
break;
}
j += 1;
}
if (j === cats.length) {
cats.push([words[i]]);
}
i += 1;
}
var compareTo = function(arr) {
if (arr.length === 1) {
f += "return str === " + JSON.stringify(arr[0]) + ";";
return;
}
f += "switch(str){";
arr.forEach(function(c) {
f += "case " + JSON.stringify(c) + ":";
});
f += "return true}return false;";
};
// When there are more than three length categories, an outer
// switch first dispatches on the lengths, to save on comparisons.
if (cats.length > 3) {
cats.sort(function(a, b) {return b.length - a.length;});
f += "switch(str.length){";
cats.forEach(function(cat) {
f += "case " + cat[0].length + ":";
compareTo(cat);
});
f += "}";
// Otherwise, simply generate a flat `switch` statement.
} else {
compareTo(words);
}
return Function.New("str", f);
};
// The ECMAScript 3 reserved word list.
var isReservedWord3 = makePredicate("abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile");
// ECMAScript 5 reserved words.
var isReservedWord5 = makePredicate("class enum extends super const export import");
// The additional reserved words in strict mode.
var isStrictReservedWord = makePredicate("implements interface let package private protected public static yield");
// The forbidden variable names in strict mode.
var isStrictBadIdWord = makePredicate("eval arguments");
// And the keywords.
var isKeyword = makePredicate("break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this");
// ## Character categories
// Big ugly regular expressions that match characters in the
// whitespace, identifier, and identifier-start categories. These
// are only applied when a character is found to actually have a
// code point above 128.
var nonASCIIwhitespace = RegExp.New("[\u1680\u180e\u2000-\u200a\u2028\u2029\u202f\u205f\u3000\ufeff]");
var nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u0527\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0\u08a2-\u08ac\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0977\u0979-\u097f\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c33\u0c35-\u0c39\u0c3d\u0c58\u0c59\u0c60\u0c61\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d60\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f4\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f0\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191c\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19c1-\u19c7\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2119-\u211d\u2124\u2126\u2128\u212a-\u212d\u212f-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u2e2f\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309d-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fcc\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua697\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua78e\ua790-\ua793\ua7a0-\ua7aa\ua7f8-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa80-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uabc0-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
var nonASCIIidentifierChars = "\u0300-\u036f\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u0620-\u0649\u0672-\u06d3\u06e7-\u06e8\u06fb-\u06fc\u0730-\u074a\u0800-\u0814\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0840-\u0857\u08e4-\u08fe\u0900-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962-\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09d7\u09df-\u09e0\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2-\u0ae3\u0ae6-\u0aef\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b5f-\u0b60\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c01-\u0c03\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62-\u0c63\u0c66-\u0c6f\u0c82\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2-\u0ce3\u0ce6-\u0cef\u0d02\u0d03\u0d46-\u0d48\u0d57\u0d62-\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0df2\u0df3\u0e34-\u0e3a\u0e40-\u0e45\u0e50-\u0e59\u0eb4-\u0eb9\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f41-\u0f47\u0f71-\u0f84\u0f86-\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u1000-\u1029\u1040-\u1049\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u170e-\u1710\u1720-\u1730\u1740-\u1750\u1772\u1773\u1780-\u17b2\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u1920-\u192b\u1930-\u193b\u1951-\u196d\u19b0-\u19c0\u19c8-\u19c9\u19d0-\u19d9\u1a00-\u1a15\u1a20-\u1a53\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1b46-\u1b4b\u1b50-\u1b59\u1b6b-\u1b73\u1bb0-\u1bb9\u1be6-\u1bf3\u1c00-\u1c22\u1c40-\u1c49\u1c5b-\u1c7d\u1cd0-\u1cd2\u1d00-\u1dbe\u1e01-\u1f15\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2d81-\u2d96\u2de0-\u2dff\u3021-\u3028\u3099\u309a\ua640-\ua66d\ua674-\ua67d\ua69f\ua6f0-\ua6f1\ua7f8-\ua800\ua806\ua80b\ua823-\ua827\ua880-\ua881\ua8b4-\ua8c4\ua8d0-\ua8d9\ua8f3-\ua8f7\ua900-\ua909\ua926-\ua92d\ua930-\ua945\ua980-\ua983\ua9b3-\ua9c0\uaa00-\uaa27\uaa40-\uaa41\uaa4c-\uaa4d\uaa50-\uaa59\uaa7b\uaae0-\uaae9\uaaf2-\uaaf3\uabc0-\uabe1\uabec\uabed\uabf0-\uabf9\ufb20-\ufb28\ufe00-\ufe0f\ufe20-\ufe26\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
var nonASCIIidentifierStart = RegExp.New("[" + nonASCIIidentifierStartChars + "]");
var nonASCIIidentifier = RegExp.New("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
// Valid RegExp flags.
var validRegExpFlags = RegExp.New("^[gmsiy]*$");
// Whether a single character denotes a newline.
var newline = RegExp.New("[\n\r\u2028\u2029]");
// Matches a whole line break (where CRLF is considered a single
// line break). Used to count lines.
var lineBreak = RegExp.New("\r\n|[\n\r\u2028\u2029]", "g");
// Test whether a given character code starts an identifier.
var isIdentifierStart = asm_llvm_module.isIdentifierStart = function(code) {
if (code < 65) { return code === 36; }
if (code < 91) { return true; }
if (code < 97) { return code === 95; }
if (code < 123) { return true; }
return code >= 0xaa &&
// Don't use the regexp if we're running under TurtleScript.
(!runningInTS) &&
nonASCIIidentifierStart.test(String.fromCharCode(code));
};
// Test whether a given character is part of an identifier.
var isIdentifierChar = asm_llvm_module.isIdentifierChar = function(code) {
if (code < 48) { return code === 36; }
if (code < 58) { return true; }
if (code < 65) { return false; }
if (code < 91) { return true; }
if (code < 97) { return code === 95; }
if (code < 123) { return true; }
return code >= 0xaa &&
// Don't use the regexp if we're running under TurtleScript.
(!runningInTS) &&
nonASCIIidentifier.test(String.fromCharCode(code));
};
// ## Tokenizer
// Let's start with the tokenizer. Unlike acorn, we
// encapsulate the tokenizer state so that it is re-entrant.
var Compiler = function() {
var options, input, inputLen, sourceFile;
// A second optional argument can be given to further configure
// the parser process. These options are recognized:
var defaultOptions = this.defaultOptions = {
// `ecmaVersion` indicates the ECMAScript version to
// parse. Must be either 3 or 5. This influences support
// for strict mode, the set of reserved words, and support
// for getters and setter.
ecmaVersion: 5,
// Turn on `strictSemicolons` to prevent the parser from doing
// automatic semicolon insertion.
strictSemicolons: false,
// When `allowTrailingCommas` is false, the parser will not allow
// trailing commas in array and object literals.
allowTrailingCommas: true,
// By default, reserved words are not enforced. Enable
// `forbidReserved` to enforce them.
forbidReserved: false,
// When `locations` is on, `loc` properties holding objects with
// `start` and `end` properties in `{line, column}` form (with
// line being 1-based and column 0-based) will be attached to the
// nodes.
locations: false,
// A function can be passed as `onComment` option, which will
// cause Acorn to call that function with `(block, text, start,
// end)` parameters whenever a comment is skipped. `block` is a
// boolean indicating whether this is a block (`/* */`) comment,
// `text` is the content of the comment, and `start` and `end` are
// character offsets that denote the start and end of the comment.
// When the `locations` option is on, two more parameters are
// passed, the full `{line, column}` locations of the start and
// end of the comments.
onComment: null,
// Nodes have their start and end characters offsets recorded in
// `start` and `end` properties (directly on the node, rather than
// the `loc` object, which holds line/column data. To also add a
// [semi-standardized][range] `range` property holding a `[start,
// end]` array with the same numbers, set the `ranges` option to
// `true`.
//
// [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678
ranges: false,
// It is possible to parse multiple files into a single AST by
// passing the tree produced by parsing the first file as
// `program` option in subsequent parses. This will add the
// toplevel forms of the parsed file to the `Program` (top) node
// of an existing parse tree.
program: null,
// When `location` is on, you can pass this to record the source
// file in every node's `loc` object.
sourceFile: null
};
var setOptions = function(opts) {
options = opts || {};
Object.keys(defaultOptions).forEach(function(opt) {
if (!Object.prototype.hasOwnProperty.call(options, opt)) {
options[opt] = defaultOptions[opt];
}
});
sourceFile = options.sourceFile || null;
};
// State is kept in variables local to the Tokenizer. We already saw the
// `options`, `input`, and `inputLen` variables above.
// The current position of the tokenizer in the input.
var tokPos;
// The start and end offsets of the current token.
var tokStart, tokEnd;
// When `options.locations` is true, these hold objects
// containing the tokens start and end line/column pairs.
var tokStartLoc, tokEndLoc;
// The type and value of the current token. Token types are objects,
// named by variables against which they can be compared, and
// holding properties that describe them (indicating, for example,
// the precedence of an infix operator, and the original name of a
// keyword token). The kind of value that's held in `tokVal` depends
// on the type of the token. For literals, it is the literal value,
// for operators, the operator name, and so on.
var tokType, tokVal;
// Interal state for the tokenizer. To distinguish between division
// operators and regular expressions, it remembers whether the last
// token was one that is allowed to be followed by an expression.
// (If it is, a slash is probably a regexp, if it isn't it's a
// division operator. See the `parseStatement` function for a
// caveat.)
var tokRegexpAllowed;
// When `options.locations` is true, these are used to keep
// track of the current line, and know when a new line has been
// entered.
var tokCurLine, tokLineStart;
// These store the position of the previous token, which is useful
// when finishing a node and assigning its `end` position.
var lastStart, lastEnd, lastEndLoc;
// This is the parser's state. `inFunction` is used to reject
// `return` statements outside of functions, `labels` to verify that
// `break` and `continue` have somewhere to jump to, and `strict`
// indicates whether strict mode is on.
var inFunction, labels, strict;
// The `getLineInfo` function is mostly useful when the
// `locations` option is off (for performance reasons) and you
// want to find the line/column position for a given character
// offset. `input` should be the code string that the offset refers
// into.
var getLineInfo = this.getLineInfo = function(input, offset) {
var line = 1, cur = 0;
while (true) {
lineBreak.lastIndex = cur;
var match = lineBreak.exec(input);
if (match && match.index < offset) {
line += 1;
cur = match.index + match[0].length;
} else { break; }
}
return {line: line, column: offset - cur};
};
// Forward declarations.
var skipSpace;
// Acorn is organized as a tokenizer and a recursive-descent parser.
// The `tokenize` export provides an interface to the tokenizer.
// For asm-llvm.js, we sacrificed a little bit of performance
// in order to properly encapsulate the tokenizer.
var initTokenState, readToken;
this.tokenize = function(inpt, opts) {
input = String(inpt); inputLen = input.length;
setOptions(opts);
initTokenState();
var t = {};
var getToken = function(forceRegexp) {
readToken(forceRegexp);
t.start = tokStart; t.end = tokEnd;
t.startLoc = tokStartLoc; t.endLoc = tokEndLoc;
t.type = tokType; t.value = tokVal;
return t;
};
getToken.jumpTo = function(pos, reAllowed) {
tokPos = pos;
if (options.locations) {
tokCurLine = tokLineStart = lineBreak.lastIndex = 0;
var match;
while ((match = lineBreak.exec(input)) && match.index < pos) {
tokCurLine += 1;
tokLineStart = match.index + match[0].length;
}
}
var ch = input.charAt(pos - 1);
tokRegexpAllowed = reAllowed;
skipSpace();
};
return getToken;
};
// This function is used to raise exceptions on parse errors. It
// takes an offset integer (into the current `input`) to indicate
// the location of the error, attaches the position to the end
// of the error message, and then raises a `SyntaxError` with that
// message.
var raise = function (pos, message) {
var loc = getLineInfo(input, pos);
message += " (" + loc.line + ":" + loc.column + ")";
var err = SyntaxError.New(message);
err.pos = pos; err.loc = loc; err.raisedAt = tokPos;
Object.Throw(err);
};
// These are used when `options.locations` is on, for the
// `tokStartLoc` and `tokEndLoc` properties.
var line_loc_t = function() {
this.line = tokCurLine;
this.column = tokPos - tokLineStart;
};
// Reset the token state. Used at the start of a parse.
initTokenState = function() {
tokCurLine = 1;
tokPos = tokLineStart = 0;
tokRegexpAllowed = true;
skipSpace();
};
// Called at the end of every token. Sets `tokEnd`, `tokVal`, and
// `tokRegexpAllowed`, and skips the space after the token, so that
// the next one's `tokStart` will point at the right position.
var finishToken = function(type, val) {
tokEnd = tokPos;
if (options.locations) { tokEndLoc = line_loc_t.New(); }
tokType = type;
skipSpace();
tokVal = val;
tokRegexpAllowed = type.beforeExpr;
};
var skipBlockComment = function() {
var startLoc = options.onComment && options.locations && line_loc_t.New();
var start = tokPos, end = input.indexOf("*/", tokPos += 2);
if (end === -1) { raise(tokPos - 2, "Unterminated comment"); }
tokPos = end + 2;
if (options.locations) {
lineBreak.lastIndex = start;
var match;
while ((match = lineBreak.exec(input)) && match.index < tokPos) {
tokCurLine += 1;
tokLineStart = match.index + match[0].length;
}
}
if (options.onComment) {
options.onComment(true, input.slice(start + 2, end), start, tokPos,
startLoc, options.locations && line_loc_t.New());
}
};
var skipLineComment = function() {
var start = tokPos;
var startLoc = options.onComment && options.locations && line_loc_t.New();
var ch = input.charCodeAt(tokPos+=2);
while (tokPos < inputLen && ch !== 10 && ch !== 13 && ch !== 8232 && ch !== 8329) {
tokPos += 1;
ch = input.charCodeAt(tokPos);
}
if (options.onComment) {
options.onComment(false, input.slice(start + 2, tokPos), start, tokPos,
startLoc, options.locations && line_loc_t.New());
}
};
// Called at the start of the parse and after every token. Skips
// whitespace and comments, and.
skipSpace = function() {
while (tokPos < inputLen) {
var ch = input.charCodeAt(tokPos);
var next;
if (ch > 47 && ch < 160) {
break; // fast path
} else if (ch === 32) { // ' '
tokPos += 1;
} else if (ch === 10) {
tokPos += 1;
tokCurLine += 1;
tokLineStart = tokPos;
} else if(ch === 13) {
tokPos += 1;
next = input.charCodeAt(tokPos);
if(next === 10) {
tokPos += 1;
}
if(options.locations) {
tokCurLine += 1;
tokLineStart = tokPos;
}
} else if(ch < 14 && ch > 8) {
tokPos += 1;
} else if (ch === 47) { // '/'
next = input.charCodeAt(tokPos+1);
if (next === 42) { // '*'
skipBlockComment();
} else if (next === 47) { // '/'
skipLineComment();
} else { break; }
} else if ((ch < 14 && ch > 8) || ch === 32 || ch === 160) { // ' ', '\xa0'
tokPos += 1;
} else if (ch >= 5760 &&
// Don't use the regexp if we're running under
// TurtleScript.
(!options.runningInTS) &&
nonASCIIwhitespace.test(String.fromCharCode(ch))) {
tokPos += 1;
} else {
break;
}
}
};
// ### Token reading
// This is the function that is called to fetch the next token. It
// is somewhat obscure, because it works in character codes rather
// than characters, and because operator parsing has been inlined
// into it.
//
// All in the name of speed.
//
// The `forceRegexp` parameter is used in the one case where the
// `tokRegexpAllowed` trick does not work. See `parseStatement`.
// Forward declarations.
var readNumber, readHexNumber, readRegexp, readString;
var readWord, readWord1, finishOp;
var readToken_dot = function() {
var next = input.charCodeAt(tokPos+1);
if (next >= 48 && next <= 57) { return readNumber(true); }
tokPos += 1;
return finishToken(_dot);
};
var readToken_slash = function() { // '/'
var next = input.charCodeAt(tokPos+1);
if (tokRegexpAllowed) { tokPos += 1; return readRegexp(); }
if (next === 61) { return finishOp(_assign, 2); }
return finishOp(_slash, 1);
};
var readToken_mult_modulo = function() { // '%*'
var next = input.charCodeAt(tokPos+1);
if (next === 61) { return finishOp(_assign, 2); }
return finishOp(_bin10, 1);
};
var readToken_pipe_amp = function(code) { // '|&'
var next = input.charCodeAt(tokPos+1);
if (next === code) {
return finishOp(code === 124 ? _bin1 : _bin2, 2);
}
if (next === 61) { return finishOp(_assign, 2); }
return finishOp(code === 124 ? _bin3 : _bin5, 1);
};