porffor 0.0.0-c743344 → 0.0.0-d650361
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +43 -12
- package/c +0 -0
- package/c.exe +0 -0
- package/compiler/2c.js +350 -0
- package/compiler/builtins.js +6 -1
- package/compiler/codeGen.js +295 -75
- package/compiler/decompile.js +1 -1
- package/compiler/index.js +44 -2
- package/compiler/opt.js +1 -1
- package/compiler/parse.js +1 -0
- package/compiler/prototype.js +90 -29
- package/compiler/sections.js +25 -0
- package/compiler/wrap.js +12 -3
- package/cool.exe +0 -0
- package/g +0 -0
- package/g.exe +0 -0
- package/hi.c +37 -0
- package/out +0 -0
- package/out.exe +0 -0
- package/package.json +1 -1
- package/r.js +39 -0
- package/rhemyn/README.md +37 -0
- package/rhemyn/compile.js +214 -0
- package/rhemyn/parse.js +321 -0
- package/rhemyn/test/parse.js +59 -0
- package/runner/index.js +54 -40
- package/runner/transform.js +2 -1
- package/tmp.c +58 -0
package/rhemyn/parse.js
ADDED
@@ -0,0 +1,321 @@
|
|
1
|
+
const State = {
|
2
|
+
none: 0,
|
3
|
+
insideSet: 1
|
4
|
+
};
|
5
|
+
|
6
|
+
const Quantifiers = {
|
7
|
+
'*': [ 0 ], // 0 -
|
8
|
+
'+': [ 1 ], // 1 -
|
9
|
+
'?': [ 0, 1 ], // 0 - 1
|
10
|
+
};
|
11
|
+
const QuantifierKeys = Object.keys(Quantifiers);
|
12
|
+
|
13
|
+
const getArg = (name, def) => {
|
14
|
+
const arg = (typeof process !== 'undefined' ? process.argv : Deno.args).find(x => x.startsWith(`-${name}=`));
|
15
|
+
if (arg) return arg.split('=')[0];
|
16
|
+
|
17
|
+
return def;
|
18
|
+
};
|
19
|
+
|
20
|
+
// full is spec-compliant but slower. not needed most of the time. (evil)
|
21
|
+
const DotChars = () => ({
|
22
|
+
full: [ '\n', '\r', '\u2028', '\u2029' ],
|
23
|
+
simple: [ '\n', '\r' ],
|
24
|
+
fast: [ '\n' ]
|
25
|
+
})[getArg('regex-dot', 'fast')];
|
26
|
+
|
27
|
+
const WordChars = () => ({
|
28
|
+
full: [ [ 'a', 'z' ], [ 'A', 'Z' ], [ '0', '9' ], '_' ],
|
29
|
+
fast: [ [ '_', 'z' ], [ 'A', 'Z' ], [ '0', '9' ] ] // skip individual _ with _-z BUT it also matches '`'
|
30
|
+
})[getArg('regex-word', 'full')];
|
31
|
+
|
32
|
+
const WhitespaceChars = () => ({
|
33
|
+
full: [ ' ', '\t', '\n', '\r', '\u2028', '\u2029' ],
|
34
|
+
simple: [ ' ', '\t', '\n', '\r' ]
|
35
|
+
})[getArg('regex-ws', 'simple')];
|
36
|
+
|
37
|
+
const _Metachars = () => ({
|
38
|
+
unescaped: {
|
39
|
+
'.': [ DotChars(), true ], // dot
|
40
|
+
},
|
41
|
+
escaped: {
|
42
|
+
d: [ [ [ '0', '9' ] ], false ], // digit
|
43
|
+
D: [ [ [ '0', '9' ] ], true ], // not digit
|
44
|
+
w: [ WordChars(), false ], // word
|
45
|
+
W: [ WordChars(), true ], // not word
|
46
|
+
s: [ WhitespaceChars(), false ], // whitespace
|
47
|
+
S: [ WhitespaceChars(), true ], // not whitespace
|
48
|
+
}
|
49
|
+
});
|
50
|
+
|
51
|
+
const EscapeSequences = {
|
52
|
+
f: '\f',
|
53
|
+
n: '\n',
|
54
|
+
r: '\r',
|
55
|
+
t: '\t',
|
56
|
+
v: '\v',
|
57
|
+
'0': '\0'
|
58
|
+
};
|
59
|
+
|
60
|
+
const HexDigit = /[0-9a-fA-F]/;
|
61
|
+
|
62
|
+
export default str => {
|
63
|
+
const Metachars = _Metachars();
|
64
|
+
|
65
|
+
const out = {
|
66
|
+
type: 'Expression',
|
67
|
+
body: []
|
68
|
+
};
|
69
|
+
let node = out, parents = [];
|
70
|
+
|
71
|
+
let state = State.none, setIndex = 0, escape = false;
|
72
|
+
for (let i = 0; i < str.length; i++) {
|
73
|
+
const c = str[i];
|
74
|
+
|
75
|
+
const charNode = char => ({
|
76
|
+
type: 'Character',
|
77
|
+
char
|
78
|
+
});
|
79
|
+
|
80
|
+
const rangeNode = (from, to) => ({
|
81
|
+
type: 'Range',
|
82
|
+
from,
|
83
|
+
to
|
84
|
+
});
|
85
|
+
|
86
|
+
const addChar = (char = c) => {
|
87
|
+
node.body.push(charNode(char));
|
88
|
+
};
|
89
|
+
|
90
|
+
const addSet = (matches, negated = false) => {
|
91
|
+
let body = matches.map(x => x[1] ? rangeNode(x[0], x[1]) : charNode(x));
|
92
|
+
if (state === State.insideSet) {
|
93
|
+
// if negated, mark each node as negated for merge
|
94
|
+
if (negated) body = body.map(x => {
|
95
|
+
x.negated = true;
|
96
|
+
return x;
|
97
|
+
});
|
98
|
+
|
99
|
+
// already in set, merge bodies
|
100
|
+
node.body.push(...body);
|
101
|
+
return;
|
102
|
+
}
|
103
|
+
|
104
|
+
node.body.push({
|
105
|
+
type: 'Set',
|
106
|
+
body,
|
107
|
+
negated
|
108
|
+
});
|
109
|
+
};
|
110
|
+
|
111
|
+
const addMetachar = meta => {
|
112
|
+
const [ matches, negated = false ] = meta;
|
113
|
+
return addSet(matches, negated);
|
114
|
+
};
|
115
|
+
|
116
|
+
// get next char and consume it
|
117
|
+
const seek = (allowEscaped = true) => {
|
118
|
+
const cNext = str[++i];
|
119
|
+
|
120
|
+
if (cNext === '\\') return !allowEscaped ? undefined : [ str[++i], true ];
|
121
|
+
return !allowEscaped ? cNext : [ cNext, false ];
|
122
|
+
};
|
123
|
+
|
124
|
+
// get next char without consuming
|
125
|
+
const peek = (allowEscaped = true, offset = 0) => {
|
126
|
+
const cNext = str[i + 1 + offset];
|
127
|
+
|
128
|
+
if (cNext === '\\') return !allowEscaped ? undefined : [ str[i + 2 + offset], true ];
|
129
|
+
return !allowEscaped ? cNext : [ cNext, false ];
|
130
|
+
};
|
131
|
+
|
132
|
+
if (escape) {
|
133
|
+
escape = false;
|
134
|
+
if (EscapeSequences[c]) {
|
135
|
+
addChar(EscapeSequences[c]);
|
136
|
+
continue;
|
137
|
+
}
|
138
|
+
|
139
|
+
if (Metachars.escaped[c]) {
|
140
|
+
addMetachar(Metachars.escaped[c]);
|
141
|
+
continue;
|
142
|
+
}
|
143
|
+
|
144
|
+
if (c === 'c') {
|
145
|
+
// \c (not [A-Za-z] ...) = literal \c... (WHY)
|
146
|
+
const next = peek(false);
|
147
|
+
if (next == null || /[^a-zA-Z]/.test(next)) {
|
148
|
+
addChar('\\');
|
149
|
+
addChar('c');
|
150
|
+
continue;
|
151
|
+
}
|
152
|
+
|
153
|
+
// \c[A-Za-z]
|
154
|
+
const code = seek(false).charCodeAt(0);
|
155
|
+
addChar(String.fromCharCode(code % 32));
|
156
|
+
continue;
|
157
|
+
}
|
158
|
+
|
159
|
+
if (c === 'x') {
|
160
|
+
// \x = x
|
161
|
+
// \xH = xH
|
162
|
+
// \x[0-9a-zA-Z][0-9a-zA-Z] = \xAB
|
163
|
+
const next1 = peek(false);
|
164
|
+
const next2 = peek(false, 1);
|
165
|
+
|
166
|
+
// missing a char or invalid hex digit
|
167
|
+
if (next1 == null || next2 == null || !HexDigit.test(next1) || !HexDigit.test(next2)) {
|
168
|
+
addChar('x');
|
169
|
+
continue;
|
170
|
+
}
|
171
|
+
|
172
|
+
const code = parseInt(seek(false) + seek(false), 16);
|
173
|
+
addChar(String.fromCodePoint(code));
|
174
|
+
continue;
|
175
|
+
}
|
176
|
+
|
177
|
+
if (c === 'u') {
|
178
|
+
// '\u' = u
|
179
|
+
// '\uHHH' = uHHH
|
180
|
+
// '\uABCD' = \uABCD
|
181
|
+
const next1 = peek(false);
|
182
|
+
const next2 = peek(false, 1);
|
183
|
+
const next3 = peek(false, 2);
|
184
|
+
const next4 = peek(false, 3);
|
185
|
+
|
186
|
+
// missing a char or invalid hex digit
|
187
|
+
if (next1 == null || next2 == null || next3 == null || next4 == null || !HexDigit.test(next1) || !HexDigit.test(next2) || !HexDigit.test(next3) || !HexDigit.test(next4)) {
|
188
|
+
addChar('u');
|
189
|
+
continue;
|
190
|
+
}
|
191
|
+
|
192
|
+
const code = parseInt(seek(false) + seek(false) + seek(false) + seek(false), 16);
|
193
|
+
addChar(String.fromCodePoint(code));
|
194
|
+
continue;
|
195
|
+
}
|
196
|
+
|
197
|
+
addChar();
|
198
|
+
continue;
|
199
|
+
}
|
200
|
+
|
201
|
+
if (c === '\\') {
|
202
|
+
escape = true;
|
203
|
+
continue;
|
204
|
+
}
|
205
|
+
|
206
|
+
switch (state) {
|
207
|
+
case State.none:
|
208
|
+
if (c === '[') {
|
209
|
+
parents.push(node);
|
210
|
+
node = {
|
211
|
+
type: 'Set',
|
212
|
+
body: [],
|
213
|
+
negated: false
|
214
|
+
};
|
215
|
+
|
216
|
+
parents.at(-1).body.push(node);
|
217
|
+
|
218
|
+
state = State.insideSet;
|
219
|
+
setIndex = 0;
|
220
|
+
continue;
|
221
|
+
}
|
222
|
+
|
223
|
+
if (c === '(') {
|
224
|
+
parents.push(node);
|
225
|
+
node = {
|
226
|
+
type: 'Group',
|
227
|
+
body: []
|
228
|
+
};
|
229
|
+
|
230
|
+
parents.at(-1).body.push(node);
|
231
|
+
continue;
|
232
|
+
}
|
233
|
+
|
234
|
+
if (c === ')') {
|
235
|
+
if (node.type !== 'Group') throw new SyntaxError('Unmatched closing parenthesis');
|
236
|
+
|
237
|
+
node = parents.pop();
|
238
|
+
continue;
|
239
|
+
}
|
240
|
+
|
241
|
+
if (QuantifierKeys.includes(c)) {
|
242
|
+
node.body.at(-1).quantifier = Quantifiers[c];
|
243
|
+
|
244
|
+
// lazy modifier
|
245
|
+
if (peek(false) === '?') node.body.at(-1).lazy = true;
|
246
|
+
|
247
|
+
continue;
|
248
|
+
}
|
249
|
+
|
250
|
+
if (Metachars.unescaped[c]) {
|
251
|
+
addMetachar(Metachars.unescaped[c]);
|
252
|
+
continue;
|
253
|
+
}
|
254
|
+
|
255
|
+
addChar();
|
256
|
+
break;
|
257
|
+
|
258
|
+
case State.insideSet:
|
259
|
+
setIndex++;
|
260
|
+
if (setIndex === 1) {
|
261
|
+
// first char in set
|
262
|
+
if (c === '^') {
|
263
|
+
node.negated = true;
|
264
|
+
continue;
|
265
|
+
}
|
266
|
+
}
|
267
|
+
|
268
|
+
if (c === ']') {
|
269
|
+
state = State.none;
|
270
|
+
node = parents.pop();
|
271
|
+
|
272
|
+
continue;
|
273
|
+
}
|
274
|
+
|
275
|
+
// range
|
276
|
+
if (c === '-') {
|
277
|
+
// start of set (or not char), just literal -
|
278
|
+
if (node.body.at(-1)?.char == null) {
|
279
|
+
addChar(); // add -
|
280
|
+
continue;
|
281
|
+
}
|
282
|
+
|
283
|
+
const from = node.body.pop().char;
|
284
|
+
const [ to, escaped ] = seek();
|
285
|
+
|
286
|
+
// end of set, just literal -
|
287
|
+
if (to == null || (!escaped && to === ']')) {
|
288
|
+
addChar(from); // add from char back
|
289
|
+
i--; // rollback seek
|
290
|
+
|
291
|
+
addChar(); // add -
|
292
|
+
continue;
|
293
|
+
}
|
294
|
+
|
295
|
+
// next char was escaped and a metachar, just literal -
|
296
|
+
if (escaped && Metachars.escaped[to] != null) {
|
297
|
+
i -= 2; // rollback seek
|
298
|
+
|
299
|
+
addChar(); // add -
|
300
|
+
continue;
|
301
|
+
}
|
302
|
+
|
303
|
+
if (to < from) throw new SyntaxError('Range out of order');
|
304
|
+
|
305
|
+
node.body.push(rangeNode(from, to));
|
306
|
+
continue;
|
307
|
+
}
|
308
|
+
|
309
|
+
addChar();
|
310
|
+
break;
|
311
|
+
}
|
312
|
+
}
|
313
|
+
|
314
|
+
// still in a group by the end
|
315
|
+
if (node.type !== 'Expression') throw new SyntaxError('Unmatched opening parenthesis');
|
316
|
+
|
317
|
+
// still in a set by the end
|
318
|
+
if (state === State.insideSet) throw new SyntaxError('Unmatched opening square bracket');
|
319
|
+
|
320
|
+
return out;
|
321
|
+
};
|
@@ -0,0 +1,59 @@
|
|
1
|
+
import util from 'node:util';
|
2
|
+
|
3
|
+
import parse from '../parse.js';
|
4
|
+
|
5
|
+
const tests = {
|
6
|
+
'a': {},
|
7
|
+
'a(b)': {},
|
8
|
+
'a(b(c))': {},
|
9
|
+
'ab': {},
|
10
|
+
'[ab]': {},
|
11
|
+
'[a-z]': {},
|
12
|
+
'a*': {},
|
13
|
+
'a+': {},
|
14
|
+
'a?': {},
|
15
|
+
'a(b)+': {},
|
16
|
+
'[^a]': {},
|
17
|
+
'[a^]': {},
|
18
|
+
'[^ab]': {},
|
19
|
+
'.': {},
|
20
|
+
|
21
|
+
// not range
|
22
|
+
'[-]': {},
|
23
|
+
'[0-]': {},
|
24
|
+
'[-0]': {},
|
25
|
+
'[\\s-\\S]': {},
|
26
|
+
'[\\s-.]': {},
|
27
|
+
|
28
|
+
'[\\S]': {},
|
29
|
+
|
30
|
+
'\\c': {},
|
31
|
+
'\\c0': {},
|
32
|
+
'\\cJ': {},
|
33
|
+
|
34
|
+
'\\x': {},
|
35
|
+
'\\x0': {},
|
36
|
+
'\\x0g': {},
|
37
|
+
'\\x0a': {},
|
38
|
+
|
39
|
+
'\\u': {},
|
40
|
+
'\\u0': {},
|
41
|
+
'\\u000': {},
|
42
|
+
'\\u000g': {},
|
43
|
+
'\\u000a': {},
|
44
|
+
|
45
|
+
/*
|
46
|
+
// email regexes
|
47
|
+
'^[a-zA-Z0-9_.+-]+@[a-zA-Z0-9-]+\.[a-zA-Z0-9-.]+$': {},
|
48
|
+
|
49
|
+
// input type=email from HTML spec
|
50
|
+
// https://html.spec.whatwg.org/multipage/input.html#email-state-(type=email)
|
51
|
+
// simpler form
|
52
|
+
'^[a-zA-Z0-9.!#$%&’*+/=?^_`{|}~-]+@[a-zA-Z0-9-]+(?:\\.[a-zA-Z0-9-]+)*$': {},
|
53
|
+
// full/complex form
|
54
|
+
'^[a-zA-Z0-9.!#$%&\'*+\\/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$': {}*/
|
55
|
+
};
|
56
|
+
|
57
|
+
for (const str in tests) {
|
58
|
+
console.log(str, util.inspect(parse(str), false, null, true));
|
59
|
+
}
|
package/runner/index.js
CHANGED
@@ -1,41 +1,55 @@
|
|
1
|
-
#!/usr/bin/env node
|
2
|
-
|
3
|
-
import compile from '../compiler/wrap.js';
|
4
|
-
import fs from 'node:fs';
|
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
|
-
if (
|
40
|
-
|
1
|
+
#!/usr/bin/env node
|
2
|
+
|
3
|
+
import compile from '../compiler/wrap.js';
|
4
|
+
import fs from 'node:fs';
|
5
|
+
|
6
|
+
if (process.argv.includes('-compile-hints')) {
|
7
|
+
const v8 = await import('node:v8');
|
8
|
+
v8.setFlagsFromString(`--experimental-wasm-compilation-hints`);
|
9
|
+
|
10
|
+
// see also these flags:
|
11
|
+
// --experimental-wasm-branch-hinting
|
12
|
+
// --experimental-wasm-extended-const
|
13
|
+
// --experimental-wasm-inlining (?)
|
14
|
+
// --experimental-wasm-js-inlining (?)
|
15
|
+
// --experimental-wasm-return-call (on by default)
|
16
|
+
}
|
17
|
+
|
18
|
+
const file = process.argv.slice(2).find(x => x[0] !== '-');
|
19
|
+
if (!file) {
|
20
|
+
if (process.argv.includes('-v')) {
|
21
|
+
// just print version
|
22
|
+
console.log((await import('./version.js')).default);
|
23
|
+
process.exit(0);
|
24
|
+
}
|
25
|
+
|
26
|
+
// run repl if no file given
|
27
|
+
await import('./repl.js');
|
28
|
+
|
29
|
+
// do nothing for the rest of this file
|
30
|
+
await new Promise(() => {});
|
31
|
+
}
|
32
|
+
|
33
|
+
const source = fs.readFileSync(file, 'utf8');
|
34
|
+
|
35
|
+
let cache = '';
|
36
|
+
const print = str => {
|
37
|
+
/* cache += str;
|
38
|
+
|
39
|
+
if (str === '\n') {
|
40
|
+
process.stdout.write(cache);
|
41
|
+
cache = '';
|
42
|
+
} */
|
43
|
+
|
44
|
+
process.stdout.write(str);
|
45
|
+
};
|
46
|
+
|
47
|
+
try {
|
48
|
+
const { exports } = await compile(source, process.argv.includes('--module') ? [ 'module' ] : [], {}, print);
|
49
|
+
|
50
|
+
exports.main();
|
51
|
+
if (cache) process.stdout.write(cache);
|
52
|
+
} catch (e) {
|
53
|
+
if (cache) process.stdout.write(cache);
|
54
|
+
console.error(process.argv.includes('-i') ? e : `${e.constructor.name}: ${e.message}`);
|
41
55
|
}
|
package/runner/transform.js
CHANGED
@@ -8,7 +8,8 @@ const source = fs.readFileSync(file, 'utf8');
|
|
8
8
|
const { wasm } = await compile(source);
|
9
9
|
|
10
10
|
// const out = `(async () => { const print = str => process.stdout.write(str); (await WebAssembly.instantiate(Uint8Array.from([${wasm.toString()}]), {'': { p: i => print(i.toString()), c: i => print(String.fromCharCode(i))}})).instance.exports.m()})()`;
|
11
|
-
const out = `new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([${wasm.toString()}])),{'':{p:i=>process.stdout.write(i.toString())}}).exports.m()`;
|
11
|
+
// const out = `new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([${wasm.toString()}])),{'':{p:i=>process.stdout.write(i.toString())}}).exports.m()`;
|
12
|
+
const out = `const a=new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([${wasm.toString()}])));const b=a.exports.m();console.log(Array.from(new Uint16Array(a.exports.$.buffer,b+4,new Int32Array(a.exports.$.buffer,b,1))).map(x=>String.fromCharCode(x)).join(''))`;
|
12
13
|
|
13
14
|
console.log(out);
|
14
15
|
eval(out);
|
package/tmp.c
ADDED
@@ -0,0 +1,58 @@
|
|
1
|
+
#ifdef _WIN32
|
2
|
+
#include <windows.h>
|
3
|
+
#else
|
4
|
+
#include <time.h>
|
5
|
+
#endif
|
6
|
+
|
7
|
+
#include <stdio.h>
|
8
|
+
|
9
|
+
double aux(double n, double acc1, double acc2) {
|
10
|
+
if (n == 0e+0) {
|
11
|
+
return acc1;
|
12
|
+
}
|
13
|
+
if (n == 1e+0) {
|
14
|
+
return acc2;
|
15
|
+
}
|
16
|
+
return aux(n - 1e+0, acc2, acc1 + acc2);
|
17
|
+
}
|
18
|
+
|
19
|
+
double fib(double n) {
|
20
|
+
return aux(n, 0e+0, 1e+0);
|
21
|
+
}
|
22
|
+
|
23
|
+
double test(double n, double count) {
|
24
|
+
double res = 0;
|
25
|
+
double i = 0;
|
26
|
+
|
27
|
+
i = 0e+0;
|
28
|
+
while (i < count) {
|
29
|
+
res = fib(n);
|
30
|
+
i = i + 1e+0;
|
31
|
+
}
|
32
|
+
return res;
|
33
|
+
}
|
34
|
+
|
35
|
+
double inline __performance_now() {
|
36
|
+
double _time_out;
|
37
|
+
#ifdef _WIN32
|
38
|
+
LARGE_INTEGER _time_freq, _time_t;
|
39
|
+
QueryPerformanceFrequency(&_time_freq);
|
40
|
+
QueryPerformanceCounter(&_time_t);
|
41
|
+
_time_out = ((double)_time_t.QuadPart / _time_freq.QuadPart) * 1000.;
|
42
|
+
#else
|
43
|
+
struct timespec _time;
|
44
|
+
clock_gettime(CLOCK_MONOTONIC, &_time);
|
45
|
+
_time_out = _time.tv_nsec / 1000000.;
|
46
|
+
#endif
|
47
|
+
return _time_out;
|
48
|
+
}
|
49
|
+
|
50
|
+
int main() {
|
51
|
+
double t = 0;
|
52
|
+
|
53
|
+
t = __performance_now();
|
54
|
+
// Sleep(1000);
|
55
|
+
printf("%f\n", test(4.6e+1, 1e+7));
|
56
|
+
printf("%f\n", (__performance_now() - t));
|
57
|
+
}
|
58
|
+
|