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
|
// Copyright (c) 2024, Marvin Borner <dev@marvinborner.de>
// SPDX-License-Identifier: MIT
#include <log.h>
#include <impl.h>
static void encode(Term *term, FILE *fp)
{
switch (term->type) {
case ABS:
fprintf(fp, "01");
encode(term->u.abs.body, fp);
break;
case APP:
fprintf(fp, "0");
Term *stack[128] = { 0 }; // TODO: HEAP!
int stacked = 0;
while (1) {
fprintf(fp, "0");
stack[stacked++] = term->u.app.rhs;
term = term->u.app.lhs;
if (term->type != APP)
break;
}
fprintf(fp, "1");
encode(term, fp);
for (int i = stacked - 1; i >= 0; i--)
encode(stack[i], fp);
break;
case IDX:
for (size_t i = 0; i <= term->u.index; i++)
fprintf(fp, "1");
fprintf(fp, "0");
break;
default:
fatal("invalid type %d\n", term->type);
}
}
static Term *decode(FILE *fp)
{
Term *res = 0;
char a = getc(fp);
if (a == '0') {
size_t count = 0;
while (getc(fp) == '0')
count++;
if (count == 0) {
res = term_new(ABS);
res->u.abs.body = decode(fp);
} else { // foldl1
res = term_new(APP);
res->u.app.lhs = decode(fp);
res->u.app.rhs = decode(fp);
for (size_t i = 0; i < count - 1; i++) {
Term *prev = res;
res = term_new(APP);
res->u.app.lhs = prev;
res->u.app.rhs = decode(fp);
}
}
} else if (a == '1') {
res = term_new(IDX);
res->u.index = 0;
while (getc(fp) == '1')
res->u.index++;
}
if (!res)
fatal("invalid parsing state!\n");
return res;
}
Impl impl_app_left(void)
{
return (Impl){
.name = "app_left",
.encode = encode,
.decode = decode,
};
}
|
