-
Notifications
You must be signed in to change notification settings - Fork 50
/
SexpConversion.re
155 lines (148 loc) · 5.12 KB
/
SexpConversion.re
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
open Haz3lcore;
open Sexplib;
let rec go: Term.UExp.t => Sexp.t =
term => {
switch (term.term) {
| Invalid(string) => Atom(string)
| EmptyHole => Atom("?")
| MultiHole(_) => Atom("Not implemented")
| Triv => List([])
| Bool(bool) => Atom(string_of_bool(bool))
| Int(int) => Atom(string_of_int(int))
| Float(float) => Atom(string_of_float(float))
| String(string) => Atom("\"" ++ string ++ "\"")
| ListLit(list) => List([Sexp.Atom("list")] @ List.map(go, list))
| Parens(exp) => go(exp)
| Constructor(string) => Atom(string)
| Fun(pat, exp) => List([Atom("fun"), goUPat(pat), go(exp)])
| Tuple(list) => List([Sexp.Atom("tuple")] @ List.map(go, list))
| Var(t) => Atom(t)
| Let(pat, exp1, exp2) =>
List([Atom("let"), List([go(exp1), go(exp2)]), goUPat(pat)])
| TyAlias(pat, typ, exp) =>
List([Atom("type"), goUTPat(pat), goTyp(typ), go(exp)])
| Ap(func, arg) => List([go(func), go(arg)])
| If(cond, thenBranch, elseBranch) =>
List([Atom("if"), go(cond), go(thenBranch), go(elseBranch)])
| Seq(exp1, exp2) => List([Atom("seq"), go(exp1), go(exp2)])
| Test(t) => List([Atom("test"), go(t)])
| Cons(head, tail) => List([Atom("cons"), go(head), go(tail)])
| ListConcat(list1, list2) => List([Atom("@"), go(list1), go(list2)])
| UnOp(op_un, a) =>
List([Atom(TermBase.UExp.un_op_to_string(op_un)), go(a)])
| BinOp(op_bin, a, b) =>
List([Atom(TermBase.UExp.bin_op_to_string(op_bin)), go(a), go(b)])
| Match(exp, cases) =>
List([Atom("case"), go(exp), List(List.map(goRule, cases))])
};
}
and goRule: ((Term.UPat.t, Term.UExp.t)) => Sexp.t = {
((pat, exp)) => List([goUPat(pat), go(exp)]);
}
and goUPat: Term.UPat.t => Sexp.t =
pat => {
switch (pat.term) {
| EmptyHole => Atom("?")
| Triv => List([])
| MultiHole(_) => Atom("Not implemented")
| Int(x) => Atom(string_of_int(x))
| Float(x) => Atom(string_of_float(x))
| Bool(x) => Atom(string_of_bool(x))
| String(x) => Atom("\"" ++ x ++ "\"")
| ListLit(list) => List([Sexp.Atom("list")] @ List.map(goUPat, list))
| Cons(head, tail) =>
List([Sexp.Atom("cons"), goUPat(head), goUPat(tail)])
| Parens(pat) => goUPat(pat)
| Ap(pat1, pat2) => List([goUPat(pat1), goUPat(pat2)])
| Invalid(string) => Atom(string)
| Var(t) => Atom(t)
| Constructor(string) => Atom(string)
| Tuple(list) => List([Sexp.Atom("tuple")] @ List.map(goUPat, list))
| Wild => Atom("_")
| TypeAnn(pat, typ) => List([goUPat(pat), goTyp(typ)])
};
}
// Only for type declarations!
and goUTPat: Term.UTPat.t => Sexp.t =
pat => {
switch (pat.term) {
| EmptyHole => Atom("?")
| MultiHole(_) => Atom("Not implemented")
| Invalid(string) => Atom(string)
| Var(string) => Atom(string)
};
}
and goTyp: Term.UTyp.t => Sexp.t =
typ => {
switch (typ.term) {
| EmptyHole => Atom("EmptyHole")
| MultiHole(_) => Atom("MultiHole")
| Int => Atom("Int")
| Float => Atom("Float")
| Bool => Atom("Bool")
| String => Atom("String")
| List(t) => List([Sexp.Atom("list"), goTyp(t)])
//Atom("[" ++ Sexp.to_string_mach(goTyp(t)) ++ "]")
| Tuple(list) => List([Sexp.Atom("tuple")] @ List.map(goTyp, list))
| Var(string) => Atom(string)
| Constructor(string) => Atom(string)
| Invalid(string) => Atom(string)
| Sum(_list) => Atom("list") //List([Sexp.Atom("sum")] @ List.map(goTyp, list))
| Arrow(_, _) => Atom("Arrow")
| Parens(_) => Atom("Parens")
| Ap(_, _) => Atom("Ap")
};
};
// Inverse of go
let rec sexp_of_uexp: Sexplib.Sexp.t => string =
sexp => {
switch (sexp) {
| Atom(string) => string
| List([Atom("fun"), pat, exp]) =>
"fun " ++ sexp_of_uexp(pat) ++ " -> " ++ sexp_of_uexp(exp)
| List([Atom("case"), exp, List(cases)]) =>
"case "
++ sexp_of_uexp(exp)
++ "\n"
++ String.concat("\n", List.map(rule_to_string, cases))
++ "\nend"
| List([Atom("let"), List([exp1, exp2]), pat]) =>
"let "
++ sexp_of_uexp(pat)
++ " = "
++ sexp_of_uexp(exp1)
++ " in "
++ sexp_of_uexp(exp2)
| List([Atom("type"), pat, typ, exp]) =>
"type "
++ sexp_of_uexp(pat)
++ " = "
++ sexp_of_uexp(typ)
++ " in "
++ sexp_of_uexp(exp)
| List([Atom("if"), cond, thenBranch, elseBranch]) =>
"if "
++ sexp_of_uexp(cond)
++ " then "
++ sexp_of_uexp(thenBranch)
++ " else "
++ sexp_of_uexp(elseBranch)
| List([Atom("seq"), exp1, exp2]) =>
sexp_of_uexp(exp1) ++ "; " ++ sexp_of_uexp(exp2)
| List([Atom("test"), t]) => "test " ++ sexp_of_uexp(t)
| List([Atom("cons"), head, tail]) =>
sexp_of_uexp(head) ++ " :: " ++ sexp_of_uexp(tail)
| List([Atom("@"), list1, list2]) =>
sexp_of_uexp(list1) ++ " @ " ++ sexp_of_uexp(list2)
| List(list) =>
"(" ++ String.concat(" ", List.map(sexp_of_uexp, list)) ++ ")"
};
}
and rule_to_string: Sexplib.Sexp.t => string =
sexp => {
switch (sexp) {
| List([pat, exp]) =>
" | " ++ sexp_of_uexp(pat) ++ " => " ++ sexp_of_uexp(exp)
| _ => failwith("expected rule")
};
};