forked from rescript-lang/rescript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcaml_lexer.js
256 lines (237 loc) · 8.49 KB
/
caml_lexer.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
'use strict';
/***********************************************************************/
/* */
/* Objective Caml */
/* */
/* Xavier Leroy, projet Cristal, INRIA Rocquencourt */
/* */
/* Copyright 1996 Institut National de Recherche en Informatique et */
/* en Automatique. All rights reserved. This file is distributed */
/* under the terms of the GNU Library General Public License, with */
/* the special exception on linking described in file ../LICENSE. */
/* */
/***********************************************************************/
/* $Id: lexing.c 6045 2004-01-01 16:42:43Z doligez $ */
/* The table-driven automaton for lexers generated by camllex. */
function caml_lex_array(s) {
var l = s.length / 2;
var a = new Array(l);
// when s.charCodeAt(2 * i + 1 ) > 128 (0x80)
// a[i] < 0
// for(var i = 0 ; i <= 0xffff; ++i) { if (i << 16 >> 16 !==i){console.log(i<<16>>16, 'vs',i)}}
//
for (var i = 0; i < l; i++)
a[i] = (s.charCodeAt(2 * i) | (s.charCodeAt(2 * i + 1) << 8)) << 16 >> 16;
return a;
}
;
var caml_lex_engine_aux = (function (tbl, start_state, lexbuf, exn){
if (!Array.isArray(tbl.lex_default)) {
tbl.lex_base = caml_lex_array(tbl.lex_base);
tbl.lex_backtrk = caml_lex_array(tbl.lex_backtrk);
tbl.lex_check = caml_lex_array(tbl.lex_check);
tbl.lex_trans = caml_lex_array(tbl.lex_trans);
tbl.lex_default = caml_lex_array(tbl.lex_default);
}
var c;
var state = start_state;
//var buffer = bytes_of_string(lexbuf.lex_buffer);
var buffer = lexbuf.lex_buffer;
if (state >= 0) {
/* First entry */
lexbuf.lex_last_pos = lexbuf.lex_start_pos = lexbuf.lex_curr_pos;
lexbuf.lex_last_action = -1;
}
else {
/* Reentry after refill */
state = -state - 1;
}
for (;;) {
/* Lookup base address or action number for current state */
var base = tbl.lex_base[state];
if (base < 0)
return -base - 1;
/* See if it's a backtrack point */
var backtrk = tbl.lex_backtrk[state];
if (backtrk >= 0) {
lexbuf.lex_last_pos = lexbuf.lex_curr_pos;
lexbuf.lex_last_action = backtrk;
}
/* See if we need a refill */
if (lexbuf.lex_curr_pos >= lexbuf.lex_buffer_len) {
if (lexbuf.lex_eof_reached === 0)
return -state - 1;
else
c = 256;
}
else {
/* Read next input char */
c = buffer[lexbuf.lex_curr_pos];
lexbuf.lex_curr_pos++;
}
/* Determine next state */
if (tbl.lex_check[base + c] === state) {
state = tbl.lex_trans[base + c];
}
else {
state = tbl.lex_default[state];
}
/* If no transition on this char, return to last backtrack point */
if (state < 0) {
lexbuf.lex_curr_pos = lexbuf.lex_last_pos;
if (lexbuf.lex_last_action == -1)
throw exn
else
return lexbuf.lex_last_action;
}
else {
/* Erase the EOF condition only if the EOF pseudo-character was
consumed by the automaton (i.e. there was no backtrack above)
*/
if (c == 256)
lexbuf.lex_eof_reached = 0;
}
}
});
var empty_token_lit = "lexing: empty token";
function caml_lex_engine(tbls, i, buf) {
return caml_lex_engine_aux(tbls, i, buf, {
RE_EXN_ID: "Failure",
_1: empty_token_lit
});
}
/***********************************************/
/* New lexer engine, with memory of positions */
/***********************************************/
/**
* s -> Lexing.lex_tables.lex_code
* mem -> Lexing.lexbuf.lex_mem (* int array *)
*/
function caml_lex_run_mem(s, i, mem, curr_pos) {
for (;;) {
var dst = s.charCodeAt(i);
i++;
if (dst == 0xff)
return;
var src = s.charCodeAt(i);
i++;
if (src == 0xff)
mem[dst] = curr_pos;
else
mem[dst] = mem[src];
}
}
/**
* s -> Lexing.lex_tables.lex_code
* mem -> Lexing.lexbuf.lex_mem (* int array *)
*/
function caml_lex_run_tag(s, i, mem) {
for (;;) {
var dst = s.charCodeAt(i);
i++;
if (dst == 0xff)
return;
var src = s.charCodeAt(i);
i++;
if (src == 0xff)
mem[dst] = -1;
else
mem[dst] = mem[src];
}
}
;
var caml_new_lex_engine_aux = (function (tbl, start_state, lexbuf, exn) {
if (!Array.isArray(tbl.lex_default)) {
tbl.lex_base = caml_lex_array(tbl.lex_base);
tbl.lex_backtrk = caml_lex_array(tbl.lex_backtrk);
tbl.lex_check = caml_lex_array(tbl.lex_check);
tbl.lex_trans = caml_lex_array(tbl.lex_trans);
tbl.lex_default = caml_lex_array(tbl.lex_default);
}
if(!Array.isArray(tbl.lex_default_code)){
tbl.lex_base_code = caml_lex_array(tbl.lex_base_code);
tbl.lex_backtrk_code = caml_lex_array(tbl.lex_backtrk_code);
tbl.lex_check_code = caml_lex_array(tbl.lex_check_code);
tbl.lex_trans_code = caml_lex_array(tbl.lex_trans_code);
tbl.lex_default_code = caml_lex_array(tbl.lex_default_code);
}
var c, state = start_state;
//var buffer = caml_bytes_of_string(lexbuf.lex_buffer);
var buffer = lexbuf.lex_buffer;
if (state >= 0) {
/* First entry */
lexbuf.lex_last_pos = lexbuf.lex_start_pos = lexbuf.lex_curr_pos;
lexbuf.lex_last_action = -1;
}
else {
/* Reentry after refill */
state = -state - 1;
}
for (;;) {
/* Lookup base address or action number for current state */
var base = tbl.lex_base[state];
if (base < 0) {
var pc_off = tbl.lex_base_code[state];
caml_lex_run_tag(tbl.lex_code, pc_off, lexbuf.lex_mem);
return -base - 1;
}
/* See if it's a backtrack point */
var backtrk = tbl.lex_backtrk[state];
if (backtrk >= 0) {
var pc_off = tbl.lex_backtrk_code[state];
caml_lex_run_tag(tbl.lex_code, pc_off, lexbuf.lex_mem);
lexbuf.lex_last_pos = lexbuf.lex_curr_pos;
lexbuf.lex_last_action = backtrk;
}
/* See if we need a refill */
if (lexbuf.lex_curr_pos >= lexbuf.lex_buffer_len) {
if (lexbuf.lex_eof_reached == 0)
return -state - 1;
else
c = 256;
}
else {
/* Read next input char */
c = buffer[lexbuf.lex_curr_pos];
lexbuf.lex_curr_pos++;
}
/* Determine next state */
var pstate = state;
if (tbl.lex_check[base + c] == state)
state = tbl.lex_trans[base + c];
else
state = tbl.lex_default[state];
/* If no transition on this char, return to last backtrack point */
if (state < 0) {
lexbuf.lex_curr_pos = lexbuf.lex_last_pos;
if (lexbuf.lex_last_action == -1)
throw exn;
else
return lexbuf.lex_last_action;
}
else {
/* If some transition, get and perform memory moves */
var base_code = tbl.lex_base_code[pstate], pc_off;
if (tbl.lex_check_code[base_code + c] == pstate)
pc_off = tbl.lex_trans_code[base_code + c];
else
pc_off = tbl.lex_default_code[pstate];
if (pc_off > 0)
caml_lex_run_mem(tbl.lex_code, pc_off, lexbuf.lex_mem, lexbuf.lex_curr_pos);
/* Erase the EOF condition only if the EOF pseudo-character was
consumed by the automaton (i.e. there was no backtrack above)
*/
if (c == 256)
lexbuf.lex_eof_reached = 0;
}
}
});
function caml_new_lex_engine(tbl, i, buf) {
return caml_new_lex_engine_aux(tbl, i, buf, {
RE_EXN_ID: "Failure",
_1: empty_token_lit
});
}
exports.caml_lex_engine = caml_lex_engine;
exports.caml_new_lex_engine = caml_new_lex_engine;
/* Not a pure module */