forked from HaxeFoundation/haxe
-
Notifications
You must be signed in to change notification settings - Fork 0
/
parser.ml
executable file
·1528 lines (1423 loc) · 49.6 KB
/
parser.ml
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
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
(*
* Copyright (C)2005-2013 Haxe Foundation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*)
open Ast
type error_msg =
| Unexpected of token
| Duplicate_default
| Missing_semicolon
| Unclosed_macro
| Unimplemented
| Missing_type
| Custom of string
exception Error of error_msg * pos
exception TypePath of string list * (string * bool) option
exception Display of expr
let error_msg = function
| Unexpected t -> "Unexpected "^(s_token t)
| Duplicate_default -> "Duplicate default"
| Missing_semicolon -> "Missing ;"
| Unclosed_macro -> "Unclosed macro"
| Unimplemented -> "Not implemented for current platform"
| Missing_type -> "Missing type declaration"
| Custom s -> s
let error m p = raise (Error (m,p))
let display_error : (error_msg -> pos -> unit) ref = ref (fun _ _ -> assert false)
let quoted_ident_prefix = "@$__hx__"
let quote_ident s =
try
for i = 0 to String.length s - 1 do
match String.unsafe_get s i with
| 'a'..'z' | 'A'..'Z' | '_' -> ()
| '0'..'9' when i > 0 -> ()
| _ -> raise Exit
done;
if Hashtbl.mem Lexer.keywords s then raise Exit;
s
with Exit ->
quoted_ident_prefix ^ s
let unquote_ident f =
let pf = quoted_ident_prefix in
let pflen = String.length pf in
if String.length f >= pflen && String.sub f 0 pflen = pf then String.sub f pflen (String.length f - pflen), false else f, true
let cache = ref (DynArray.create())
let last_doc = ref None
let use_doc = ref false
let resume_display = ref null_pos
let in_macro = ref false
let last_token s =
let n = Stream.count s in
DynArray.get (!cache) (if n = 0 then 0 else n - 1)
let serror() = raise (Stream.Error "")
let do_resume() = !resume_display <> null_pos
let display e = raise (Display e)
let is_resuming p =
let p2 = !resume_display in
p.pmax = p2.pmin && Common.unique_full_path p.pfile = p2.pfile
let set_resume p =
resume_display := { p with pfile = Common.unique_full_path p.pfile }
let is_dollar_ident e = match fst e with
| EConst (Ident n) when n.[0] = '$' ->
true
| _ ->
false
let precedence op =
let left = true and right = false in
match op with
| OpMod -> 0, left
| OpMult | OpDiv -> 1, left
| OpAdd | OpSub -> 2, left
| OpShl | OpShr | OpUShr -> 3, left
| OpOr | OpAnd | OpXor -> 4, left
| OpEq | OpNotEq | OpGt | OpLt | OpGte | OpLte -> 5, left
| OpInterval -> 6, left
| OpBoolAnd -> 7, left
| OpBoolOr -> 8, left
| OpArrow -> 9, right
| OpAssign | OpAssignOp _ -> 10, right
let is_not_assign = function
| OpAssign | OpAssignOp _ -> false
| _ -> true
let swap op1 op2 =
let p1, left1 = precedence op1 in
let p2, _ = precedence op2 in
left1 && p1 <= p2
let rec make_binop op e ((v,p2) as e2) =
match v with
| EBinop (_op,_e,_e2) when swap op _op ->
let _e = make_binop op e _e in
EBinop (_op,_e,_e2) , punion (pos _e) (pos _e2)
| ETernary (e1,e2,e3) when is_not_assign op ->
let e = make_binop op e e1 in
ETernary (e,e2,e3) , punion (pos e) (pos e3)
| _ ->
EBinop (op,e,e2) , punion (pos e) (pos e2)
let rec make_unop op ((v,p2) as e) p1 =
match v with
| EBinop (bop,e,e2) -> EBinop (bop, make_unop op e p1 , e2) , (punion p1 p2)
| ETernary (e1,e2,e3) -> ETernary (make_unop op e1 p1 , e2, e3), punion p1 p2
| _ ->
EUnop (op,Prefix,e), punion p1 p2
let rec make_meta name params ((v,p2) as e) p1 =
match v with
| EBinop (bop,e,e2) -> EBinop (bop, make_meta name params e p1 , e2) , (punion p1 p2)
| ETernary (e1,e2,e3) -> ETernary (make_meta name params e1 p1 , e2, e3), punion p1 p2
| _ ->
EMeta((name,params,p1),e),punion p1 p2
let reify in_macro =
let cur_pos = ref None in
let mk_enum ename n vl p =
let constr = (EConst (Ident n),p) in
match vl with
| [] -> constr
| _ -> (ECall (constr,vl),p)
in
let to_const c p =
let cst n v = mk_enum "Constant" n [EConst (String v),p] p in
match c with
| Int i -> cst "CInt" i
| String s -> cst "CString" s
| Float s -> cst "CFloat" s
| Ident s -> cst "CIdent" s
| Regexp (r,o) -> mk_enum "Constant" "CRegexp" [(EConst (String r),p);(EConst (String o),p)] p
in
let rec to_binop o p =
let op n = mk_enum "Binop" n [] p in
match o with
| OpAdd -> op "OpAdd"
| OpMult -> op "OpMult"
| OpDiv -> op "OpDiv"
| OpSub -> op "OpSub"
| OpAssign -> op "OpAssign"
| OpEq -> op "OpEq"
| OpNotEq -> op "OpNotEq"
| OpGt -> op "OpGt"
| OpGte -> op "OpGte"
| OpLt -> op "OpLt"
| OpLte -> op "OpLte"
| OpAnd -> op "OpAnd"
| OpOr -> op "OpOr"
| OpXor -> op "OpXor"
| OpBoolAnd -> op "OpBoolAnd"
| OpBoolOr -> op "OpBoolOr"
| OpShl -> op "OpShl"
| OpShr -> op "OpShr"
| OpUShr -> op "OpUShr"
| OpMod -> op "OpMod"
| OpAssignOp o -> mk_enum "Binop" "OpAssignOp" [to_binop o p] p
| OpInterval -> op "OpInterval"
| OpArrow -> op "OpArrow"
in
let to_string s p =
let len = String.length s in
if len > 1 && s.[0] = '$' then
(EConst (Ident (String.sub s 1 (len - 1))),p)
else
(EConst (String s),p)
in
let to_array f a p =
(EArrayDecl (List.map (fun s -> f s p) a),p)
in
let to_null p =
(EConst (Ident "null"),p)
in
let to_opt f v p =
match v with
| None -> to_null p
| Some v -> f v p
in
let to_bool o p =
(EConst (Ident (if o then "true" else "false")),p)
in
let to_obj fields p =
(EObjectDecl fields,p)
in
let rec to_tparam t p =
let n, v = (match t with
| TPType t -> "TPType", to_ctype t p
| TPExpr e -> "TPExpr", to_expr e p
) in
mk_enum "TypeParam" n [v] p
and to_tpath t p =
let len = String.length t.tname in
if t.tpackage = [] && len > 1 && t.tname.[0] = '$' then
(EConst (Ident (String.sub t.tname 1 (len - 1))),p)
else begin
let fields = [
("pack", to_array to_string t.tpackage p);
("name", to_string t.tname p);
("params", to_array to_tparam t.tparams p);
] in
to_obj (match t.tsub with None -> fields | Some s -> fields @ ["sub",to_string s p]) p
end
and to_ctype t p =
let ct n vl = mk_enum "ComplexType" n vl p in
match t with
| CTPath { tpackage = []; tparams = []; tsub = None; tname = n } when n.[0] = '$' ->
to_string n p
| CTPath t -> ct "TPath" [to_tpath t p]
| CTFunction (args,ret) -> ct "TFunction" [to_array to_ctype args p; to_ctype ret p]
| CTAnonymous fields -> ct "TAnonymous" [to_array to_cfield fields p]
| CTParent t -> ct "TParent" [to_ctype t p]
| CTExtend (tl,fields) -> ct "TExtend" [to_array to_tpath tl p; to_array to_cfield fields p]
| CTOptional t -> ct "TOptional" [to_ctype t p]
and to_fun f p =
let farg (n,o,t,e) p =
let fields = [
"name", to_string n p;
"opt", to_bool o p;
"type", to_opt to_ctype t p;
] in
to_obj (match e with None -> fields | Some e -> fields @ ["value",to_expr e p]) p
in
let rec fparam t p =
let fields = [
"name", to_string t.tp_name p;
"constraints", to_array to_ctype t.tp_constraints p;
"params", to_array fparam t.tp_params p;
] in
to_obj fields p
in
let fields = [
("args",to_array farg f.f_args p);
("ret",to_opt to_ctype f.f_type p);
("expr",to_opt to_expr f.f_expr p);
("params",to_array fparam f.f_params p);
] in
to_obj fields p
and to_cfield f p =
let p = f.cff_pos in
let to_access a p =
let n = (match a with
| APublic -> "APublic"
| APrivate -> "APrivate"
| AStatic -> "AStatic"
| AOverride -> "AOverride"
| ADynamic -> "ADynamic"
| AInline -> "AInline"
| AMacro -> "AMacro"
) in
mk_enum "Access" n [] p
in
let to_kind k =
let n, vl = (match k with
| FVar (ct,e) -> "FVar", [to_opt to_ctype ct p;to_opt to_expr e p]
| FFun f -> "FFun", [to_fun f p]
| FProp (get,set,t,e) -> "FProp", [to_string get p; to_string set p; to_opt to_ctype t p; to_opt to_expr e p]
) in
mk_enum "FieldType" n vl p
in
let fields = [
Some ("name", to_string f.cff_name p);
(match f.cff_doc with None -> None | Some s -> Some ("doc", to_string s p));
(match f.cff_access with [] -> None | l -> Some ("access", to_array to_access l p));
Some ("kind", to_kind f.cff_kind);
Some ("pos", to_pos f.cff_pos);
(match f.cff_meta with [] -> None | l -> Some ("meta", to_meta f.cff_meta p));
] in
let fields = List.rev (List.fold_left (fun acc v -> match v with None -> acc | Some e -> e :: acc) [] fields) in
to_obj fields p
and to_meta m p =
to_array (fun (m,el,p) _ ->
let fields = [
"name", to_string (fst (Common.MetaInfo.to_string m)) p;
"params", to_expr_array el p;
"pos", to_pos p;
] in
to_obj fields p
) m p
and to_pos p =
match !cur_pos with
| Some p ->
p
| None ->
let file = (EConst (String p.pfile),p) in
let pmin = (EConst (Int (string_of_int p.pmin)),p) in
let pmax = (EConst (Int (string_of_int p.pmax)),p) in
if in_macro then
(EUntyped (ECall ((EConst (Ident "__dollar__mk_pos"),p),[file;pmin;pmax]),p),p)
else
to_obj [("file",file);("min",pmin);("max",pmax)] p
and to_expr_array a p = match a with
| [EMeta ((Meta.Dollar "a",[],_),e1),_] -> (match fst e1 with EArrayDecl el -> to_expr_array el p | _ -> e1)
| _ -> to_array to_expr a p
and to_expr e _ =
let p = snd e in
let expr n vl =
let e = mk_enum "ExprDef" n vl p in
to_obj [("expr",e);("pos",to_pos p)] p
in
let loop e = to_expr e (snd e) in
match fst e with
| EConst (Ident n) when n.[0] = '$' && String.length n > 1 ->
to_string n p
| EConst c ->
expr "EConst" [to_const c p]
| EArray (e1,e2) ->
expr "EArray" [loop e1;loop e2]
| EBinop (op,e1,e2) ->
expr "EBinop" [to_binop op p; loop e1; loop e2]
| EField (e,s) ->
expr "EField" [loop e; to_string s p]
| EParenthesis e ->
expr "EParenthesis" [loop e]
| EObjectDecl fl ->
expr "EObjectDecl" [to_array (fun (f,e) -> to_obj [("field",to_string f p);("expr",loop e)]) fl p]
| EArrayDecl el ->
expr "EArrayDecl" [to_expr_array el p]
| ECall (e,el) ->
expr "ECall" [loop e;to_expr_array el p]
| ENew (t,el) ->
expr "ENew" [to_tpath t p;to_expr_array el p]
| EUnop (op,flag,e) ->
let op = mk_enum "Unop" (match op with
| Increment -> "OpIncrement"
| Decrement -> "OpDecrement"
| Not -> "OpNot"
| Neg -> "OpNeg"
| NegBits -> "OpNegBits"
) [] p in
expr "EUnop" [op;to_bool (flag = Postfix) p;loop e]
| EVars vl ->
expr "EVars" [to_array (fun (v,t,e) p ->
let fields = [
"name", to_string v p;
"type", to_opt to_ctype t p;
"expr", to_opt to_expr e p;
] in
to_obj fields p
) vl p]
| EFunction (name,f) ->
expr "EFunction" [to_opt to_string name p; to_fun f p]
| EBlock el ->
expr "EBlock" [to_expr_array el p]
| EFor (e1,e2) ->
expr "EFor" [loop e1;loop e2]
| EIn (e1,e2) ->
expr "EIn" [loop e1;loop e2]
| EIf (e1,e2,eelse) ->
expr "EIf" [loop e1;loop e2;to_opt to_expr eelse p]
| EWhile (e1,e2,flag) ->
expr "EWhile" [loop e1;loop e2;to_bool (flag = NormalWhile) p]
| ESwitch (e1,cases,def) ->
let scase (el,eg,e) p =
to_obj [("values",to_expr_array el p);"guard",to_opt to_expr eg p;"expr",to_opt to_expr e p] p
in
expr "ESwitch" [loop e1;to_array scase cases p;to_opt (to_opt to_expr) def p]
| ETry (e1,catches) ->
let scatch (n,t,e) p =
to_obj [("name",to_string n p);("type",to_ctype t p);("expr",loop e)] p
in
expr "ETry" [loop e1;to_array scatch catches p]
| EReturn eo ->
expr "EReturn" [to_opt to_expr eo p]
| EBreak ->
expr "EBreak" []
| EContinue ->
expr "EContinue" []
| EUntyped e ->
expr "EUntyped" [loop e]
| EThrow e ->
expr "EThrow" [loop e]
| ECast (e,ct) ->
expr "ECast" [loop e; to_opt to_ctype ct p]
| EDisplay (e,flag) ->
expr "EDisplay" [loop e; to_bool flag p]
| EDisplayNew t ->
expr "EDisplayNew" [to_tpath t p]
| ETernary (e1,e2,e3) ->
expr "ETernary" [loop e1;loop e2;loop e3]
| ECheckType (e1,ct) ->
expr "ECheckType" [loop e1; to_ctype ct p]
| EMeta ((m,ml,p),e1) ->
match m, ml with
| Meta.Dollar ("" | "e"), _ ->
e1
| Meta.Dollar "a", _ ->
expr "EArrayDecl" (match fst e1 with EArrayDecl el -> [to_expr_array el p] | _ -> [e1])
| Meta.Dollar "b", _ ->
expr "EBlock" [e1]
(* TODO: can $v and $i be implemented better? *)
| Meta.Dollar "v", _ ->
begin match fst e1 with
| EParenthesis (ECheckType (e2, CTPath{tname="String";tpackage=[]}),_) -> expr "EConst" [mk_enum "Constant" "CString" [e2] (pos e2)]
| EParenthesis (ECheckType (e2, CTPath{tname="Int";tpackage=[]}),_) -> expr "EConst" [mk_enum "Constant" "CInt" [e2] (pos e2)]
| EParenthesis (ECheckType (e2, CTPath{tname="Float";tpackage=[]}),_) -> expr "EConst" [mk_enum "Constant" "CFloat" [e2] (pos e2)]
| _ -> (ECall ((EField ((EField ((EField ((EConst (Ident "haxe"),p),"macro"),p),"Context"),p),"makeExpr"),p),[e; to_pos (pos e)]),p)
end
| Meta.Dollar "i", _ ->
expr "EConst" [mk_enum "Constant" "CIdent" [e1] (pos e1)]
| Meta.Dollar "p", _ ->
(ECall ((EField ((EField ((EField ((EConst (Ident "haxe"),p),"macro"),p),"MacroStringTools"),p),"toFieldExpr"),p),[e]),p)
| Meta.Custom ":pos", [pexpr] ->
let old = !cur_pos in
cur_pos := Some pexpr;
let e = loop e1 in
cur_pos := old;
e
| _ ->
expr "EMeta" [to_obj [("name",to_string (fst (Common.MetaInfo.to_string m)) p);("params",to_expr_array ml p);("pos",to_pos p)] p;loop e1]
and to_tparam_decl p t =
to_obj [
"name", to_string t.tp_name p;
"params", (EArrayDecl (List.map (to_tparam_decl p) t.tp_params),p);
"constraints", (EArrayDecl (List.map (fun t -> to_ctype t p) t.tp_constraints),p)
] p
and to_type_def (t,p) =
match t with
| EClass d ->
let ext = ref None and impl = ref [] and interf = ref false in
List.iter (function
| HExtern | HPrivate -> ()
| HInterface -> interf := true;
| HExtends t -> ext := Some (to_tpath t p)
| HImplements i -> impl := (to_tpath i p) :: !impl
) d.d_flags;
to_obj [
"pack", (EArrayDecl [],p);
"name", to_string d.d_name p;
"pos", to_pos p;
"meta", to_meta d.d_meta p;
"params", (EArrayDecl (List.map (to_tparam_decl p) d.d_params),p);
"isExtern", to_bool (List.mem HExtern d.d_flags) p;
"kind", mk_enum "TypeDefKind" "TDClass" [(match !ext with None -> (EConst (Ident "null"),p) | Some t -> t);(EArrayDecl (List.rev !impl),p);to_bool !interf p] p;
"fields", (EArrayDecl (List.map (fun f -> to_cfield f p) d.d_data),p)
] p
| _ -> assert false
in
(fun e -> to_expr e (snd e)), to_ctype, to_type_def
let popt f = parser
| [< v = f >] -> Some v
| [< >] -> None
let rec plist f = parser
| [< v = f; l = plist f >] -> v :: l
| [< >] -> []
let rec psep sep f = parser
| [< v = f; s >] ->
let rec loop = parser
| [< '(sep2,_) when sep2 = sep; v = f; l = loop >] -> v :: l
| [< >] -> []
in
v :: loop s
| [< >] -> []
let ident = parser
| [< '(Const (Ident i),p) >] -> i,p
let dollar_ident = parser
| [< '(Const (Ident i),p) >] -> i,p
| [< '(Dollar i,p) >] -> ("$" ^ i),p
let dollar_ident_macro pack = parser
| [< '(Const (Ident i),p) >] -> i,p
| [< '(Dollar i,p) >] -> ("$" ^ i),p
| [< '(Kwd Macro,p) when pack <> [] >] -> "macro", p
let lower_ident_or_macro = parser
| [< '(Const (Ident i),p) when is_lower_ident i >] -> i
| [< '(Kwd Macro,_) >] -> "macro"
let any_enum_ident = parser
| [< i = ident >] -> i
| [< '(Kwd k,p) when Filename.basename p.pfile = "StdTypes.hx" >] -> s_keyword k, p
let property_ident = parser
| [< i, _ = ident >] -> i
| [< '(Kwd Dynamic,_) >] -> "dynamic"
| [< '(Kwd Default,_) >] -> "default"
| [< '(Kwd Null,_) >] -> "null"
let get_doc s =
(* do the peek first to make sure we fetch the doc *)
match Stream.peek s with
| None -> None
| Some (tk,p) ->
match !last_doc with
| None -> None
| Some (d,pos) ->
last_doc := None;
if pos = p.pmin then Some d else None
let comma = parser
| [< '(Comma,_) >] -> ()
let semicolon s =
if fst (last_token s) = BrClose then
match s with parser
| [< '(Semicolon,p) >] -> p
| [< >] -> snd (last_token s)
else
match s with parser
| [< '(Semicolon,p) >] -> p
| [< s >] ->
let pos = snd (last_token s) in
if do_resume() then pos else error Missing_semicolon pos
let rec parse_file s =
last_doc := None;
match s with parser
| [< '(Kwd Package,_); pack = parse_package; s >] ->
begin match s with parser
| [< '(Const(Ident _),p) when pack = [] >] -> error (Custom "Package name must start with a lowercase character") p
| [< _ = semicolon; l = parse_type_decls pack []; '(Eof,_) >] -> pack , l
end
| [< l = parse_type_decls [] []; '(Eof,_) >] -> [] , l
and parse_type_decls pack acc s =
try
match s with parser
| [< v = parse_type_decl; l = parse_type_decls pack (v :: acc) >] -> l
| [< >] -> List.rev acc
with TypePath ([],Some (name,false)) ->
(* resolve imports *)
List.iter (fun d ->
match fst d with
| EImport (t,_) ->
(match List.rev t with
| (n,_) :: path when n = name && List.for_all (fun (i,_) -> is_lower_ident i) path -> raise (TypePath (List.map fst (List.rev path),Some (name,false)))
| _ -> ())
| _ -> ()
) acc;
raise (TypePath (pack,Some(name,true)))
and parse_type_decl s =
match s with parser
| [< '(Kwd Import,p1) >] -> parse_import s p1
| [< '(Kwd Using,p1); t = parse_type_path; p2 = semicolon >] -> EUsing t, punion p1 p2
| [< doc = get_doc; meta = parse_meta; c = parse_common_flags; s >] ->
match s with parser
| [< n , p1 = parse_enum_flags; name = type_name; tl = parse_constraint_params; '(BrOpen,_); l = plist parse_enum; '(BrClose,p2) >] ->
(EEnum {
d_name = name;
d_doc = doc;
d_meta = meta;
d_params = tl;
d_flags = List.map snd c @ n;
d_data = l
}, punion p1 p2)
| [< n , p1 = parse_class_flags; name = type_name; tl = parse_constraint_params; hl = plist parse_class_herit; '(BrOpen,_); fl, p2 = parse_class_fields false p1 >] ->
(EClass {
d_name = name;
d_doc = doc;
d_meta = meta;
d_params = tl;
d_flags = List.map fst c @ n @ hl;
d_data = fl;
}, punion p1 p2)
| [< '(Kwd Typedef,p1); name = type_name; tl = parse_constraint_params; '(Binop OpAssign,p2); t = parse_complex_type; s >] ->
(match s with parser
| [< '(Semicolon,_) >] -> ()
| [< >] -> ());
(ETypedef {
d_name = name;
d_doc = doc;
d_meta = meta;
d_params = tl;
d_flags = List.map snd c;
d_data = t;
}, punion p1 p2)
| [< '(Kwd Abstract,p1); name = type_name; tl = parse_constraint_params; st = parse_abstract_subtype; sl = plist parse_abstract_relations; '(BrOpen,_); fl, p2 = parse_class_fields false p1 >] ->
let flags = List.map (fun (_,c) -> match c with EPrivate -> APrivAbstract | EExtern -> error (Custom "extern abstract not allowed") p1) c in
let flags = (match st with None -> flags | Some t -> AIsType t :: flags) in
(EAbstract {
d_name = name;
d_doc = doc;
d_meta = meta;
d_params = tl;
d_flags = flags @ sl;
d_data = fl;
},punion p1 p2)
and parse_class doc meta cflags need_name s =
let opt_name = if need_name then type_name else (fun s -> match popt type_name s with None -> "" | Some n -> n) in
match s with parser
| [< n , p1 = parse_class_flags; name = opt_name; tl = parse_constraint_params; hl = psep Comma parse_class_herit; '(BrOpen,_); fl, p2 = parse_class_fields (not need_name) p1 >] ->
(EClass {
d_name = name;
d_doc = doc;
d_meta = meta;
d_params = tl;
d_flags = List.map fst cflags @ n @ hl;
d_data = fl;
}, punion p1 p2)
and parse_import s p1 =
let rec loop acc =
match s with parser
| [< '(Dot,p) >] ->
if is_resuming p then raise (TypePath (List.rev (List.map fst acc),None));
(match s with parser
| [< '(Const (Ident k),p) >] ->
loop ((k,p) :: acc)
| [< '(Kwd Macro,p) >] ->
loop (("macro",p) :: acc)
| [< '(Binop OpMult,_); '(Semicolon,p2) >] ->
p2, List.rev acc, IAll
| [< '(Binop OpOr,_) when do_resume() >] ->
set_resume p;
raise (TypePath (List.rev (List.map fst acc),None))
| [< >] ->
serror());
| [< '(Semicolon,p2) >] ->
p2, List.rev acc, INormal
| [< '(Kwd In,_); '(Const (Ident name),_); '(Semicolon,p2) >] ->
p2, List.rev acc, IAsName name
| [< >] ->
serror()
in
let p2, path, mode = (match s with parser
| [< '(Const (Ident name),p) >] -> loop [name,p]
| [< >] -> serror()
) in
(EImport (path,mode),punion p1 p2)
and parse_abstract_relations s =
match s with parser
| [< '(Const (Ident "to"),_); t = parse_complex_type >] -> AToType t
| [< '(Const (Ident "from"),_); t = parse_complex_type >] -> AFromType t
and parse_abstract_subtype s =
match s with parser
| [< '(POpen, _); t = parse_complex_type; '(PClose,_) >] -> Some t
| [< >] -> None
and parse_package s = psep Dot lower_ident_or_macro s
and parse_class_fields tdecl p1 s =
let l = parse_class_field_resume tdecl s in
let p2 = (match s with parser
| [< '(BrClose,p2) >] -> p2
| [< >] -> if do_resume() then p1 else serror()
) in
l, p2
and parse_class_field_resume tdecl s =
if not (do_resume()) then
plist parse_class_field s
else try
let c = parse_class_field s in
c :: parse_class_field_resume tdecl s
with Stream.Error _ | Stream.Failure ->
(* look for next variable/function or next type declaration *)
let rec junk k =
if k <= 0 then () else begin
Stream.junk s;
junk (k - 1);
end
in
(*
walk back tokens which are prefixing a type/field declaration
*)
let rec junk_tokens k =
if k = 0 then
()
else match List.rev_map fst (Stream.npeek k s) with
| Kwd Private :: _ -> junk_tokens (k - 1)
| (Const (Ident _) | Kwd _) :: DblDot :: At :: l
| (Const (Ident _) | Kwd _) :: At :: l ->
junk_tokens (List.length l)
| PClose :: l ->
(* count matching parenthesises for metadata call *)
let rec loop n = function
| [] -> []
| POpen :: l -> if n = 0 then l else loop (n - 1) l
| PClose :: l -> loop (n + 1) l
| _ :: l -> loop n l
in
(match loop 0 l with
| (Const (Ident _) | Kwd _) :: At :: l
| (Const (Ident _) | Kwd _) :: DblDot :: At :: l -> junk_tokens (List.length l)
| _ ->
junk k)
| _ ->
junk k
in
let rec loop k =
match List.rev_map fst (Stream.npeek k s) with
(* metadata *)
| Kwd _ :: At :: _ | Kwd _ :: DblDot :: At :: _ ->
loop (k + 1)
(* field declaration *)
| Const _ :: Kwd Function :: _
| Kwd New :: Kwd Function :: _ ->
junk_tokens (k - 2);
parse_class_field_resume tdecl s
| Kwd Macro :: _ | Kwd Public :: _ | Kwd Static :: _ | Kwd Var :: _ | Kwd Override :: _ | Kwd Dynamic :: _ | Kwd Inline :: _ ->
junk_tokens (k - 1);
parse_class_field_resume tdecl s
| BrClose :: _ when tdecl ->
junk_tokens (k - 1);
[]
(* type declaration *)
| Eof :: _ | Kwd Import :: _ | Kwd Using :: _ | Kwd Extern :: _ | Kwd Class :: _ | Kwd Interface :: _ | Kwd Enum :: _ | Kwd Typedef :: _ | Kwd Abstract :: _->
junk_tokens (k - 1);
[]
| [] ->
[]
| _ ->
loop (k + 1)
in
loop 1
and parse_common_flags = parser
| [< '(Kwd Private,_); l = parse_common_flags >] -> (HPrivate, EPrivate) :: l
| [< '(Kwd Extern,_); l = parse_common_flags >] -> (HExtern, EExtern) :: l
| [< >] -> []
and parse_meta_params pname s = match s with parser
| [< '(POpen,p) when p.pmin = pname.pmax; params = psep Comma expr; '(PClose,_); >] -> params
| [< >] -> []
and parse_meta_entry = parser
[< '(At,_); name,p = meta_name; params = parse_meta_params p; s >] -> (name,params,p)
and parse_meta = parser
| [< entry = parse_meta_entry; s >] ->
entry :: parse_meta s
| [< >] -> []
and meta_name = parser
| [< '(Const (Ident i),p) >] -> (Meta.Custom i), p
| [< '(Kwd k,p) >] -> (Meta.Custom (s_keyword k)),p
| [< '(DblDot,_); s >] -> match s with parser
| [< '(Const (Ident i),p) >] -> (Common.MetaInfo.parse i), p
| [< '(Kwd k,p) >] -> (Common.MetaInfo.parse (s_keyword k)),p
and parse_enum_flags = parser
| [< '(Kwd Enum,p) >] -> [] , p
and parse_class_flags = parser
| [< '(Kwd Class,p) >] -> [] , p
| [< '(Kwd Interface,p) >] -> [HInterface] , p
and parse_type_opt = parser
| [< '(DblDot,_); t = parse_complex_type >] -> Some t
| [< >] -> None
and parse_complex_type s =
let t = parse_complex_type_inner s in
parse_complex_type_next t s
and parse_structural_extension = parser
| [< '(Binop OpGt,_); t = parse_type_path; '(Comma,_); s >] ->
t
and parse_complex_type_inner = parser
| [< '(POpen,_); t = parse_complex_type; '(PClose,_) >] -> CTParent t
| [< '(BrOpen,p1); s >] ->
(match s with parser
| [< l = parse_type_anonymous false >] -> CTAnonymous l
| [< t = parse_structural_extension; s>] ->
let tl = t :: plist parse_structural_extension s in
(match s with parser
| [< l = parse_type_anonymous false >] -> CTExtend (tl,l)
| [< l, _ = parse_class_fields true p1 >] -> CTExtend (tl,l))
| [< l, _ = parse_class_fields true p1 >] -> CTAnonymous l
| [< >] -> serror())
| [< '(Question,_); t = parse_complex_type_inner >] ->
CTOptional t
| [< t = parse_type_path >] ->
CTPath t
and parse_type_path s = parse_type_path1 [] s
and parse_type_path1 pack = parser
| [< name, p = dollar_ident_macro pack; s >] ->
if is_lower_ident name then
(match s with parser
| [< '(Dot,p) >] ->
if is_resuming p then
raise (TypePath (List.rev (name :: pack),None))
else
parse_type_path1 (name :: pack) s
| [< '(Semicolon,_) >] ->
error (Custom "Type name should start with an uppercase letter") p
| [< >] -> serror())
else
let sub = (match s with parser
| [< '(Dot,p); s >] ->
(if is_resuming p then
raise (TypePath (List.rev pack,Some (name,false)))
else match s with parser
| [< '(Const (Ident name),_) when not (is_lower_ident name) >] -> Some name
| [< '(Binop OpOr,_) when do_resume() >] ->
set_resume p;
raise (TypePath (List.rev pack,Some (name,false)))
| [< >] -> serror())
| [< >] -> None
) in
let params = (match s with parser
| [< '(Binop OpLt,_); l = psep Comma parse_type_path_or_const; '(Binop OpGt,_) >] -> l
| [< >] -> []
) in
{
tpackage = List.rev pack;
tname = name;
tparams = params;
tsub = sub;
}
| [< '(Binop OpOr,_) when do_resume() >] ->
raise (TypePath (List.rev pack,None))
and type_name = parser
| [< '(Const (Ident name),p) >] ->
if is_lower_ident name then
error (Custom "Type name should start with an uppercase letter") p
else
name
and parse_type_path_or_const = parser
(* we can't allow (expr) here *)
| [< '(BkOpen,p1); l = parse_array_decl; '(BkClose,p2); s >] -> TPExpr (EArrayDecl l, punion p1 p2)
| [< t = parse_complex_type >] -> TPType t
| [< '(Const c,p) >] -> TPExpr (EConst c,p)
| [< e = expr >] -> TPExpr e
| [< >] -> serror()
and parse_complex_type_next t = parser
| [< '(Arrow,_); t2 = parse_complex_type >] ->
(match t2 with
| CTFunction (args,r) ->
CTFunction (t :: args,r)
| _ ->
CTFunction ([t] , t2))
| [< >] -> t
and parse_type_anonymous opt = parser
| [< '(Question,_) when not opt; s >] -> parse_type_anonymous true s
| [< name, p1 = ident; '(DblDot,_); t = parse_complex_type; s >] ->
let next p2 acc =
{
cff_name = name;
cff_meta = if opt then [Meta.Optional,[],p1] else [];
cff_access = [];
cff_doc = None;
cff_kind = FVar (Some t,None);
cff_pos = punion p1 p2;
} :: acc
in
match s with parser
| [< '(BrClose,p2) >] -> next p2 []
| [< '(Comma,p2) >] ->
(match s with parser
| [< '(BrClose,_) >] -> next p2 []
| [< l = parse_type_anonymous false >] -> next p2 l
| [< >] -> serror());
| [< >] -> serror()
and parse_enum s =
let doc = get_doc s in
let meta = parse_meta s in
match s with parser
| [< name, p1 = any_enum_ident; params = parse_constraint_params; s >] ->
let args = (match s with parser
| [< '(POpen,_); l = psep Comma parse_enum_param; '(PClose,_) >] -> l
| [< >] -> []
) in
let t = (match s with parser
| [< '(DblDot,_); t = parse_complex_type >] -> Some t
| [< >] -> None
) in
let p2 = (match s with parser
| [< p = semicolon >] -> p
| [< >] -> serror()
) in
{
ec_name = name;
ec_doc = doc;
ec_meta = meta;
ec_args = args;
ec_params = params;
ec_type = t;
ec_pos = punion p1 p2;
}
and parse_enum_param = parser
| [< '(Question,_); name, _ = ident; '(DblDot,_); t = parse_complex_type >] -> (name,true,t)
| [< name, _ = ident; '(DblDot,_); t = parse_complex_type >] -> (name,false,t)
and parse_class_field s =
let doc = get_doc s in
match s with parser
| [< meta = parse_meta; al = parse_cf_rights true []; s >] ->
let name, pos, k = (match s with parser
| [< '(Kwd Var,p1); name, _ = dollar_ident; s >] ->
(match s with parser
| [< '(POpen,_); i1 = property_ident; '(Comma,_); i2 = property_ident; '(PClose,_) >] ->
let t = (match s with parser
| [< '(DblDot,_); t = parse_complex_type >] -> Some t
| [< >] -> None
) in
let e , p2 = (match s with parser
| [< '(Binop OpAssign,_); e = toplevel_expr; p2 = semicolon >] -> Some e , p2
| [< '(Semicolon,p2) >] -> None , p2
| [< >] -> serror()
) in
name, punion p1 p2, FProp (i1,i2,t, e)
| [< t = parse_type_opt; s >] ->
let e , p2 = (match s with parser
| [< '(Binop OpAssign,_); e = toplevel_expr; p2 = semicolon >] -> Some e , p2
| [< '(Semicolon,p2) >] -> None , p2
| [< >] -> serror()
) in
name, punion p1 p2, FVar (t,e))
| [< '(Kwd Function,p1); name = parse_fun_name; pl = parse_constraint_params; '(POpen,_); al = psep Comma parse_fun_param; '(PClose,_); t = parse_type_opt; s >] ->
let e, p2 = (match s with parser
| [< e = toplevel_expr; s >] ->
(try ignore(semicolon s) with Error (Missing_semicolon,p) -> !display_error Missing_semicolon p);
Some e, pos e
| [< '(Semicolon,p) >] -> None, p
| [< >] -> serror()
) in
let f = {
f_params = pl;
f_args = al;
f_type = t;
f_expr = e;
} in
name, punion p1 p2, FFun f
| [< >] ->
if al = [] then raise Stream.Failure else serror()
) in
{
cff_name = name;
cff_doc = doc;
cff_meta = meta;
cff_access = al;
cff_pos = pos;
cff_kind = k;
}
and parse_cf_rights allow_static l = parser
| [< '(Kwd Static,_) when allow_static; l = parse_cf_rights false (AStatic :: l) >] -> l
| [< '(Kwd Macro,_) when not(List.mem AMacro l); l = parse_cf_rights allow_static (AMacro :: l) >] -> l
| [< '(Kwd Public,_) when not(List.mem APublic l || List.mem APrivate l); l = parse_cf_rights allow_static (APublic :: l) >] -> l
| [< '(Kwd Private,_) when not(List.mem APublic l || List.mem APrivate l); l = parse_cf_rights allow_static (APrivate :: l) >] -> l
| [< '(Kwd Override,_) when not (List.mem AOverride l); l = parse_cf_rights false (AOverride :: l) >] -> l
| [< '(Kwd Dynamic,_) when not (List.mem ADynamic l); l = parse_cf_rights allow_static (ADynamic :: l) >] -> l
| [< '(Kwd Inline,_); l = parse_cf_rights allow_static (AInline :: l) >] -> l
| [< >] -> l
and parse_fun_name = parser
| [< name,_ = dollar_ident >] -> name
| [< '(Kwd New,_) >] -> "new"
and parse_fun_param = parser
| [< '(Question,_); name, _ = dollar_ident; t = parse_type_opt; c = parse_fun_param_value >] -> (name,true,t,c)
| [< name, _ = dollar_ident; t = parse_type_opt; c = parse_fun_param_value >] -> (name,false,t,c)
and parse_fun_param_value = parser
| [< '(Binop OpAssign,_); e = toplevel_expr >] -> Some e
| [< >] -> None
and parse_fun_param_type = parser
| [< '(Question,_); name = ident; '(DblDot,_); t = parse_complex_type >] -> (name,true,t)
| [< name = ident; '(DblDot,_); t = parse_complex_type >] -> (name,false,t)