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
(** Copyright 2025-2026, Victoria Ostrovskaya & Danil Usoltsev *)
(** SPDX-License-Identifier: LGPL-3.0-or-later *)
open Ast
open Base
open Angstrom
let is_keyword = function
| "let"
| "match"
| "in"
| "if"
| "then"
| "else"
| "fun"
| "rec"
| "true"
| "false"
| "Some"
| "and"
| "function"
| "None"
| "with" -> true
| _ -> false
;;
let is_lowercase = function
| 'a' .. 'z' -> true
| _ -> false
;;
let is_uppercase = function
| 'A' .. 'Z' -> true
| _ -> false
;;
let is_digit = function
| '0' .. '9' -> true
| _ -> false
;;
let is_operator_char = function
| '!'
| '$'
| '%'
| '&'
| '*'
| '+'
| '-'
| '.'
| '/'
| ':'
| '<'
| '='
| '>'
| '?'
| '@'
| '^'
| '|'
| '~' -> true
| _ -> false
;;
let is_operator_char_infix = function
| '!'
| '$'
| '%'
| '&'
| '*'
| '+'
| '-'
| '.'
| '/'
| '<'
| '='
| '>'
| '?'
| '@'
| '^'
| '~' -> true
| '|' | ':' | _ -> false
;;
let is_custom_power_op op =
String.length op >= 2 && String.equal (String.sub op ~pos:0 ~len:2) "**"
;;
let first_char op = String.get op 0
let is_custom_mul_op op =
(not (is_custom_power_op op))
&&
match first_char op with
| '*' | '/' | '%' -> true
| _ -> false
;;
let is_custom_add_op op =
match first_char op with
| '+' | '-' -> true
| _ -> false
;;
let is_custom_concat_op op =
match first_char op with
| '@' | '^' -> true
| _ -> false
;;
let is_custom_cmp_op op =
match first_char op with
| '=' | '<' | '>' | '|' | '&' | '$' -> true
| _ -> false
;;
let is_custom_lowest_op op =
match first_char op with
| '!' | '?' | '~' | '.' -> true
| _ -> false
;;
let white_space = take_while Char.is_whitespace
let token s = white_space *> string s
let token1 s = white_space *> s
let parse_parens p = token "(" *> p <* token ")"
let is_separator = function
| ')'
| '('
| '<'
| '>'
| '@'
| ','
| ';'
| ':'
| '\\'
| '"'
| '/'
| '['
| ']'
| '?'
| '='
| '{'
| '}'
| ' '
| '\r'
| '\t'
| '\n'
| '*'
| '-' -> true
| _ -> false
;;
let token2 str =
token str *> peek_char
>>= function
| Some c when is_separator c -> return str <* white_space
| None -> return str <* white_space
| _ -> fail (Printf.sprintf "There is no separator after %S." str)
;;
let parse_const_int =
let sign = choice [ token "" ] in
let num = take_while1 Char.is_digit in
lift2 (fun s n -> ConstInt (Int.of_string (s ^ n))) sign num
;;
let parse_const_char =
string "\'" *> any_char <* string "\'" >>| fun char_value -> ConstChar char_value
;;
let parse_const_bool =
choice
[ token "true" *> return (ConstBool true); token "false" *> return (ConstBool false) ]
;;
let parse_const_string =
token "\"" *> take_till (Char.equal '\"') <* token "\"" >>| fun s -> ConstString s
;;
let parse_const =
white_space
*> choice [ parse_const_int; parse_const_char; parse_const_string; parse_const_bool ]
;;
let parse_unar_oper = choice [ token "-" *> return Negative; token "not" *> return Not ]
let parse_ident =
let parse_first_char =
satisfy (fun ch -> is_lowercase ch || is_uppercase ch || Char.equal ch '_')
>>| Char.escaped
in
let parse_other_chars =
take_while (fun ch ->
is_lowercase ch || is_uppercase ch || is_digit ch || Char.equal ch '_')
in
let parse_regular_ident =
token1 @@ lift2 ( ^ ) parse_first_char parse_other_chars
>>= fun s -> if is_keyword s then fail "It is not identifier" else return s
in
let parse_op_ident =
white_space *> char '(' *> white_space *> take_while1 is_operator_char
<* white_space
<* char ')'
in
parse_regular_ident <|> parse_op_ident
;;
let parse_base_type =
choice
[ token "int" *> return (TyPrim "int")
; token "bool" *> return (TyPrim "bool")
; token "string" *> return (TyPrim "string")
; token "unit" *> return (TyPrim "unit")
; token "char" *> return (TyPrim "char")
]
;;
let rec parse_type_list t =
let* base = t in
white_space
*> token "list"
*> (parse_type_list (return (TyList base)) <|> return (TyList base))
;;
let parse_tuple_type parse_type =
let* fst_type = parse_type in
let* snd_type = token "*" *> parse_type in
let* type_list = many (token "*" *> parse_type) in
return (TyTuple (fst_type :: snd_type :: type_list))
;;
let rec parse_arrow_type parse_type =
let* type1 = parse_type in
let* type2 = token "->" *> (parse_arrow_type parse_type <|> parse_type) in
return (TyArrow (type1, type2))
;;
let parse_type =
let base_type = parse_base_type in
let list_type = parse_type_list base_type <|> base_type in
let tuple_type = parse_tuple_type list_type <|> list_type in
parse_arrow_type tuple_type <|> tuple_type
;;
let parse_pattern_with_type parse_pattern =
let* pat = white_space *> token "(" *> parse_pattern in
let* constr =
white_space *> token ":" *> white_space *> parse_type <* white_space <* token ")"
in
return (PatType (pat, constr))
;;
let parse_pattern_var = parse_ident >>| fun id -> PatVariable id
let parse_pattern_const = parse_const >>| fun c -> PatConst c
let parse_pattern_any = token2 "_" *> return PatAny
let parse_pattern_tuple parse_pattern =
let parse_unparenthesized =
lift3
(fun p1 p2 rest -> PatTuple (p1, p2, rest))
parse_pattern
(token "," *> parse_pattern)
(many (token "," *> parse_pattern))
<* white_space
in
parse_parens parse_unparenthesized <|> parse_unparenthesized
;;
let parse_keyword = choice [ token "true"; token "false"; token "None"; token "()" ]
let parse_option parse =
let* tag = token2 "Some" in
let* opt = parse >>| Option.some in
return (tag, opt)
;;
let parse_construct parse construct func =
token "[" *> sep_by (token ";") parse
<* token "]"
>>| List.fold_right ~init:(construct ("[]", None)) ~f:func
;;
let parse_list parse construct tuple =
let rec go acc =
token "::" *> parse
>>= (fun elem ->
go elem >>| fun rest -> construct ("::", Some (tuple (acc, rest, []))))
<|> return acc
in
parse >>= go
;;
let parse_pattern_construct parse_elem parse_pat =
choice
[ (parse_option (parse_elem <|> parse_parens parse_pat)
>>| fun (t, p) -> PatConstruct (t, p))
; parse_construct
parse_elem
(fun (t, p) -> PatConstruct (t, p))
(fun p acc -> PatConstruct ("::", Some (PatTuple (p, acc, []))))
; parse_list
parse_elem
(fun (t, p) -> PatConstruct (t, p))
(fun (a, b, c) -> PatTuple (a, b, c))
]
;;
let parse_base_pat =
choice
[ parse_pattern_any
; parse_pattern_var
; parse_pattern_const
; (parse_keyword >>| fun tag -> PatConstruct (tag, None))
]
;;
let parse_pattern =
white_space
*> fix (fun pat ->
let atom =
choice
[ parse_base_pat
; parse_pattern_construct parse_base_pat pat
; parse_pattern_with_type pat
; parse_parens pat
]
in
let tuple = parse_pattern_construct atom pat <|> atom in
let lst = parse_pattern_construct tuple pat <|> tuple in
parse_pattern_tuple lst <|> lst)
;;
let parse_left_associative expr oper right_expr =
let rec go acc = lift2 (fun f x -> f acc x) oper right_expr >>= go <|> return acc in
expr >>= go
;;
let parse_expr_bin_oper parse_bin_op tkn =
token tkn *> return (fun e1 e2 -> ExpBinOper (parse_bin_op, e1, e2))
;;
let parse_right_associative expr oper =
let rec parse () =
expr
>>= fun left ->
oper >>= (fun combine -> parse () >>| fun right -> combine left right) <|> return left
in
parse ()
;;
let multiply = parse_expr_bin_oper Multiply "*"
let division = parse_expr_bin_oper Division "/"
let plus = parse_expr_bin_oper Plus "+"
let minus = parse_expr_bin_oper Minus "-"
let compare =
choice
[ parse_expr_bin_oper Equal "="
; parse_expr_bin_oper NotEqual "<>"
; parse_expr_bin_oper LowestEqual "<="
; parse_expr_bin_oper LowerThan "<"
; parse_expr_bin_oper GreatestEqual ">="
; parse_expr_bin_oper GreaterThan ">"
]
;;
let and_op = parse_expr_bin_oper And "&&"
let or_op = parse_expr_bin_oper Or "||"
let parse_custom_infix_when pred =
white_space *> take_while1 is_operator_char_infix
>>= fun op ->
if Option.is_some (builtin_op_of_string op)
then fail "builtin"
else if pred op
then return (fun e1 e2 -> ExpBinOper (Custom op, e1, e2))
else fail "custom_op_mismatch"
;;
let parse_expr_ident = parse_ident >>| fun x -> ExpIdent x
let parse_expr_const = parse_const >>| fun c -> ExpConst c
let parse_expr_with_type parse_expr =
let parse_annotated_type = token ":" *> parse_type in
lift2 (fun expr t -> ExpTypeAnnotation (expr, t)) parse_expr parse_annotated_type
;;
let parse_expr_branch parse_expr =
lift3
(fun cond t f -> ExpBranch (cond, t, f))
(token "if" *> parse_expr)
(token "then" *> parse_expr)
(option None (token "else" *> parse_expr >>| Option.some))
;;
let parse_expr_unar_oper parse_expr =
parse_unar_oper >>= fun op -> parse_expr >>= fun expr -> return (ExpUnarOper (op, expr))
;;
let parse_expr_list parse_expr =
parse_list
parse_expr
(fun (tag, exp_opt) -> ExpConstruct (tag, exp_opt))
(fun (fst_exp, snd_exp, exp_list) -> ExpTuple (fst_exp, snd_exp, exp_list))
;;
let parse_expr_apply e right =
parse_left_associative e (return (fun e1 e2 -> ExpApply (e1, e2))) right
;;
let parse_expr_lambda parse_expr =
token2 "fun" *> sep_by1 white_space parse_pattern
<* token "->"
>>= fun params ->
parse_expr
>>| fun body ->
match params with
| pat :: pats -> ExpLambda (pat, pats, body)
| [] -> body
;;
let parse_case parse_expr =
white_space
*> option () (token "|" *> return ())
*> lift2 (fun pat exp -> pat, exp) parse_pattern (token "->" *> parse_expr)
;;
let parse_expr_function parse_expr =
token2 "function"
*>
let* case_list = sep_by1 (token "|") (parse_case parse_expr) in
return (ExpFunction (List.hd_exn case_list, List.drop case_list 1))
;;
let parse_expr_match parse_expr =
let* exp = token2 "match" *> parse_expr <* token2 "with" in
let* case_list = sep_by1 (token "|") (parse_case parse_expr) in
return (ExpMatch (exp, List.hd_exn case_list, List.drop case_list 1))
;;
let parse_expr_tuple parse_expr =
let commas = token "," in
let tuple =
lift3
(fun e1 e2 rest -> ExpTuple (e1, e2, rest))
(parse_expr <* commas)
parse_expr
(many (commas *> parse_expr))
<* white_space
in
parse_parens tuple <|> tuple
;;
let parse_body parse_expr =
many1 parse_pattern
>>= fun patterns ->
token "=" *> parse_expr
>>| fun body ->
match patterns with
| pat :: pats -> ExpLambda (pat, pats, body)
| [] -> body
;;
let parse_expr_sequence parse_expr =
parse_left_associative
parse_expr
(token ";" *> return (fun exp1 exp2 -> ExpLet (NonRec, (PatUnit, exp1), [], exp2)))
parse_expr
;;
let parse_expr_construct parse_expr =
let cons_one exp acc = ExpConstruct ("::", Some (ExpTuple (exp, acc, []))) in
let rec unfold_sequence = function
| ExpLet (NonRec, (PatUnit, e1), [], e2) ->
let rest, last = unfold_sequence e2 in
e1 :: rest, last
| e -> [], e
in
let rec fold_elem (from_parens, exp) acc =
if from_parens
then cons_one exp acc
else (
match exp with
| ExpLet (NonRec, (PatUnit, e1), [], e2) ->
let rest, last = unfold_sequence e2 in
let acc' = fold_elem (false, last) acc in
let acc'' =
List.fold_right rest ~init:acc' ~f:(fun e a -> fold_elem (false, e) a)
in
fold_elem (false, e1) acc''
| _ -> cons_one exp acc)
in
let elem_parser =
parse_parens (parse_expr_sequence parse_expr)
>>| (fun exp -> true, exp)
<|> (parse_expr >>| fun exp -> false, exp)
in
parse_construct elem_parser (fun (t, e) -> ExpConstruct (t, e)) fold_elem
;;
let parse_annotated_rhs parse_expr opr =
token ":" *> parse_type
>>= fun t -> token opr *> parse_expr >>| fun expr -> ExpTypeAnnotation (expr, t)
;;
let parse_fun_binding parse_expr =
let* id = parse_pattern_var in
let* params = many1 parse_pattern in
let pat = List.hd_exn params
and pats = List.drop params 1 in
let mk_body body = ExpLambda (pat, pats, body) in
choice
[ (parse_annotated_rhs parse_expr "="
>>= function
| ExpTypeAnnotation (expr, t) -> return (PatType (id, t), mk_body expr)
| _ -> fail "expected type annotation")
; (token "=" *> parse_expr >>| fun expr -> id, mk_body expr)
]
;;
let parse_simple_binding parse_expr =
let* pat = parse_pattern in
choice
[ (parse_annotated_rhs parse_expr "="
>>= function
| ExpTypeAnnotation (expr, t) -> return (PatType (pat, t), expr)
| _ -> fail "expected type annotation")
; (token "=" *> parse_expr >>| fun expr -> pat, expr)
]
;;
let parse_value_binding_list parse_expr =
let parse_binding = parse_fun_binding parse_expr <|> parse_simple_binding parse_expr in
sep_by1 (token2 "and") (white_space *> parse_binding)
;;
let parse_base_expr =
choice
[ parse_expr_ident
; parse_expr_const
; (parse_keyword >>| fun tag -> ExpConstruct (tag, None))
]
;;
let parse_expr_construct_keyword_some parse_expr =
parse_option (parse_base_expr <|> parse_parens parse_expr)
>>| fun (tag, exp_opt) -> ExpConstruct (tag, exp_opt)
;;
let parse_expr_let parse_expr =
token "let"
*> lift4
(fun rec_flag value_bindings and_bindings body ->
ExpLet (rec_flag, value_bindings, and_bindings, body))
(token "rec" *> (take_while1 Char.is_whitespace *> return Rec) <|> return NonRec)
(lift2
(fun pat expr -> pat, expr)
parse_pattern
(token "=" *> parse_expr <|> parse_body parse_expr))
(many
(token "and"
*> lift2
(fun pat expr -> pat, expr)
parse_pattern
(token "=" *> parse_expr <|> parse_body parse_expr)))
(token "in" *> parse_expr)
;;
let parse_top_expr parse_expr =
choice
[ parse_expr_let parse_expr
; parse_expr_function parse_expr
; parse_expr_lambda parse_expr
; parse_expr_match parse_expr
; parse_expr_branch parse_expr
]
;;
let parse_exp_apply e right =
let app = parse_expr_apply e right in
let app = parse_expr_unar_oper app <|> app in
let power = parse_right_associative app (parse_custom_infix_when is_custom_power_op) in
let ops1 =
parse_left_associative
power
(parse_custom_infix_when is_custom_mul_op <|> multiply <|> division)
power
in
let ops2 =
parse_left_associative
ops1
(parse_custom_infix_when is_custom_add_op <|> plus <|> minus)
ops1
in
let concat =
parse_right_associative ops2 (parse_custom_infix_when is_custom_concat_op)
in
let cmp =
parse_left_associative
concat
(parse_custom_infix_when is_custom_cmp_op
<|> parse_custom_infix_when is_custom_lowest_op
<|> compare)
concat
in
let bool_and = parse_right_associative cmp and_op in
parse_right_associative bool_and or_op
;;
let parse_expr =
white_space
*> fix (fun expr ->
let term =
choice
[ parse_base_expr
; parse_expr_construct_keyword_some expr
; parse_parens (parse_expr_with_type expr)
; parse_expr_construct expr
; parse_top_expr expr
; parse_parens expr
]
in
let func = parse_exp_apply term term <|> term in
let lst = parse_expr_list func <|> func in
let tuple = parse_expr_tuple lst <|> lst in
let seq = parse_expr_sequence tuple <|> tuple in
let lambda = parse_expr_lambda expr <|> seq in
choice
[ parse_expr_let expr
; parse_expr_function expr
; parse_expr_lambda expr
; parse_expr_match expr
; parse_expr_branch expr
; lambda
])
;;
let parse_structure =
let parse_eval = parse_expr >>| fun e -> SEval e in
let parse_value =
token "let"
*> lift2
(fun r id_list -> SValue (r, List.hd_exn id_list, List.drop id_list 1))
(token "rec" *> (take_while1 Char.is_whitespace *> return Rec) <|> return NonRec)
(parse_value_binding_list parse_expr)
in
let parse_structure_item = choice [ parse_eval; parse_value ] in
parse_structure_item <* option () (token ";;" >>| ignore)
;;
let parse_program =
let definitions_or_exprs =
white_space *> many parse_structure <* option () (token ";;" >>| ignore)
in
definitions_or_exprs <* white_space
;;
let parse input = parse_string ~consume:All parse_program input