package diffast-langs-python

  1. Overview
  2. Docs

Source file py_tree.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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
(*
   Copyright 2012-2025 Codinuum Software Lab <https://codinuum.com>

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*)
(*
 * AST for the Python programming language
 *
 * py_tree.ml
 *
 *)

[%%prepare_logger]

module Xset = Diffast_misc.Xset
module Loc = Diffast_misc.Loc
module Binding = Diffast_misc.Binding
module Sourcecode = Diffast_core.Sourcecode
module Spec = Diffast_core.Spec
module Astloc = Langs_common.Astloc
module Ast = Python_parsing.Ast

module L = Py_label
module BID = Binding.ID

let sprintf = Printf.sprintf

let first l =
  try List.hd l with _ -> assert false

let last l =
  try List.hd (List.rev l) with _ -> assert false

let conv_loc = L.conv_loc

let set_loc nd loc = nd#data#set_loc (conv_loc loc)

let of_opt of_x = function
  | None -> []
  | Some x -> [of_x x]

let loc_of_name (loc, _) = loc

let opt_length = function
  | Some _ -> 1
  | None -> 0

let getlab = Py_unparsing.getlab


module Tree = Sourcecode.Tree(L)
open Tree

class c options root is_whole = object
  inherit Tree.c options root is_whole

  method! private create root is_whole = new c options root is_whole

  method! unparse_subtree_ch ?(no_boxing=false) ?(no_header=false) ?(fail_on_error=true) =
    make_unparser (Py_unparsing.unparse ~no_boxing ~no_header ~fail_on_error)

end

let of_xnode options =
  Tree.of_xnode ~tree_creator:(fun options nd -> new c options nd true) options

[%%capture_path
let is_docstring nd =
  let b =
    match getlab nd with
    | L.Statement L.Statement.Simple when nd#nchildren = 1 -> begin
        let ss_ = nd#children.(0) in
        match getlab ss_ with
        | L.SimpleStatement L.SimpleStatement.Expr when ss_#nchildren = 1 -> begin
            let e_ = ss_#children.(0) in
            match getlab e_ with
            | L.Primary (L.Primary.Literal (L.Literal.String _)) -> true
            | _ -> false
        end
        | _ -> false
    end
    | L.Primary (L.Primary.Literal (L.Literal.String _)) -> true
    | _ -> false
  in
  [%debug_log "%s -> %B" nd#to_string b];
  b
]

let rec name_of_fpdef = function
  | Ast.Fname(_, n) -> n
  | Ast.Flist(_, l) -> String.concat ";" (List.map name_of_fpdef l)
  | Ast.Ftyped(_, (_, n), _) -> n


[%%capture_path
class visitor bid_gen tree = object (self)
  inherit Sourcecode.visitor tree

  val stack = new Sourcecode.stack

  method set_scope_node nd =
    try
      let n = stack#top.Sourcecode.f_scope_node in
      nd#data#set_scope_node n
    with
      Not_found -> ()

  method! scanner_body_before_subscan nd =
    let lab = getlab nd in
    if L.is_scope_creating lab then
      stack#push nd

  method! scanner_body_after_subscan nd =
    let lab = getlab nd in
    if L.is_scope_creating lab then
      stack#pop;

    let get_nl nd =
      let nl = ref [] in
      tree#fast_scan_whole_initial_subtree nd
        (fun n ->
          let lab = getlab n in
          if L.is_name lab then begin
            nl := n :: !nl
          end
        );
      !nl
    in

    let is_param, lhsl =
      if L.is_param lab then
        true, try get_nl nd#initial_children.(0) with _ -> []
      else if
        L._is_name lab && L.get_name lab <> "self" &&
        try
          match (getlab nd#initial_parent) with
          | L.Parameters | L.NamedParameters _ -> true
          | _ -> false
        with _ -> false
      then
        true, [nd]
      else
        false, []
    in
    if is_param then begin
      List.iter
        (fun n ->
          [%debug_log "n=%s" n#data#to_string];
          let name = L.get_name (getlab n) in
          let bid = bid_gen#gen in
          [%debug_log "DEF(param): %s (bid=%a) %s" name BID.ps bid n#to_string];
          n#data#set_binding (Binding.make_unknown_def bid true);
          self#set_scope_node n;
          stack#register name n;
        ) lhsl;
      (*let rhsl =
        try
          get_nl nd#initial_children.(1)
        with _ -> []
      in
      List.iter
        (fun n ->
          [%debug_log "n=%s" n#data#to_string];
          try
            let name = L.get_name (getlab n) in
            let binder_nd = stack#lookup name in
            let bid = Binding.get_bid binder_nd#data#binding in
            [%debug_log "    USE: %s (bid=%a) %s" name BID.ps bid n#to_string];
            n#data#set_binding (Binding.make_use bid)
          with
            Not_found -> ()
        ) rhsl*)
    end;

    if L.is_assign lab then begin
      List.iter
        (fun n ->
          [%debug_log "n=%s" n#data#to_string];
          let name = L.get_name (getlab n) in
          let bid = bid_gen#gen in
          [%debug_log "DEF(assign): %s (bid=%a) %s" name BID.ps bid n#to_string];
          n#data#set_binding (Binding.make_unknown_def bid true);
          self#set_scope_node n;
          stack#register name n
        ) (try get_nl nd#initial_children.(0) with _ -> [])
    end;

    if L.is_name lab then begin
      let name = L.get_name lab in
      try
        let binder_nd = stack#lookup name in
        let bid = Binding.get_bid binder_nd#data#binding in
        let loc_opt = Some (binder_nd#uid, binder_nd#data#src_loc) in
        nd#data#set_binding (Binding.make_use ~loc_opt bid);
        [%debug_log "    USE: %s (bid=%a) %s" name BID.ps bid nd#to_string];
      with
        Not_found -> ()
    end
  (* end of method scanner_body_after_subscan *)

end (* of class Tree.visitor *)
]

[%%capture_path
class translator options comment_tbl =
  let bid_gen = new BID.generator in
  object (self)
  inherit node_maker options as super

  val mutable ignored_regions = []

  val comment_node_cand_tbl = Hashtbl.create 0
  val unchecked_comment_line_nums = Xset.create 0

  initializer
    Hashtbl.iter (fun ln _ -> Xset.add unchecked_comment_line_nums ln) comment_tbl

  method set_bindings (tree : Spec.tree_t) =
    let visitor = new visitor bid_gen tree in
    visitor#visit_all

  method comment_node_cand_tbl = comment_node_cand_tbl

  method ignored_regions = ignored_regions
  method add_ignored_region loc = ignored_regions <- (Loc.to_offsets loc) :: ignored_regions

  method mknd ?(annot=L.null_annotation) ?(pvec=[]) lab nodes =
  let ordinal_tbl_opt =
    match pvec with
    | [] -> None
    | l -> Some (new ordinal_tbl l)
  in
  super#mknode ~annot ~ordinal_tbl_opt lab nodes

  method _set_loc nd loc =
    [%debug_log "%s(%d) [%s]" nd#data#label nd#nchildren (Loc.to_string loc)];
    let sl = loc.Loc.start_line in
    let el = loc.Loc.end_line in
    if sl = el then begin
      [%debug_log "sl=el=%d" sl];
      Xset.remove unchecked_comment_line_nums sl;
      try
        let c = Hashtbl.find comment_tbl sl in
        [%debug_log "-> %s" c.Ast.c_comment];
        let csc = c.Ast.c_loc.Astloc.start_char in
        if nd#data#src_loc.Loc.end_char < csc then begin
          try
            let n0, _ = Hashtbl.find comment_node_cand_tbl sl in
            let ec0 = n0#data#src_loc.Loc.end_char in
            if loc.Loc.end_char > ec0 then
              Hashtbl.replace comment_node_cand_tbl sl (nd, None)
          with
            Not_found -> Hashtbl.add comment_node_cand_tbl sl (nd, None)
        end
      with
        _ -> ()
    end
    else begin
      [%debug_log "sl=%d el=%d" sl el];
      for ln = sl to el do
        if Xset.mem unchecked_comment_line_nums ln then begin
          [%debug_log "ln=%d" ln];
          begin
            try
              let c = Hashtbl.find comment_tbl ln in
              [%debug_log "-> %s" c.Ast.c_comment];
              let _ = c in
              let pos_opt =
                if L.is_sequence (getlab nd) then begin
                  [%debug_log "@"];
                  let pos = ref 0 in
                  begin
                    let has_child_flag = ref false in
                    try
                      Array.iteri
                        (fun i cnd ->
                          has_child_flag := true;
                          [%debug_log "[%d] %s" i cnd#data#to_string];
                          let csl = cnd#data#src_loc.Loc.start_line in
                          pos := i;
                          if csl > ln then begin
                            [%debug_log "%s -> %d" nd#data#to_string i];
                            raise Exit
                          end
                        ) nd#children;
                      if !has_child_flag then
                        incr pos
                    with
                      Exit -> ()
                  end;
                  Some !pos
                end
                else
                  None
              in
              Hashtbl.add comment_node_cand_tbl ln (nd, pos_opt);
            with
              Not_found -> ()
          end;
          Xset.remove unchecked_comment_line_nums ln
        end
      done
    end;
    nd#data#set_loc loc

  method set_loc nd astloc = self#_set_loc nd (conv_loc astloc)

  method of_opt_lab : 'a . L.t -> ('a -> node_t) -> 'a option -> node_t list =
    fun lab of_x ->
      function
        | None -> []
        | Some x ->
            let xnd = of_x x in
            let nd = self#mknd lab [xnd] in
            self#_set_loc nd xnd#data#src_loc;
            [nd]
(*
  method of_opt_lab_l : 'a . L.t -> ('a -> node_t list) -> 'a option -> node_t list =
    fun lab of_x ->
      function
        | None -> []
        | Some x ->
            let xnds = of_x x in
            let nd = self#mknd lab xnds in
            let loc =
              match xnds with
              | [n] -> n#data#src_loc
              | [] -> assert false
              | n::_ ->
                  let last = Xlist.last xnds in
                  Loc.merge n#data#src_loc last#data#src_loc
            in
            self#_set_loc nd loc;
            [nd]
*)
  method of_name (loc, name) =
    let nd = self#mkleaf (L.Name name) in
    self#set_loc nd loc;
    nd

  method of_dottedname dname =
    let loc =
      match dname with
      | [] -> assert false
      | [l, _] -> l
      | (l, _)::_ -> Ast.Loc.merge l (loc_of_name (last dname))
    in
    (*let nd = self#mkleaf (L.DottedName (L.dottedname_to_string dname)) in*)
    let nd =
      self#mknd (L.DottedName (L.dottedname_to_string dname))
        (List.map self#of_name dname)
    in
    self#set_loc nd loc;
    nd


  method of_expr_suite lab (expr, suite) =
    let children = [self#of_expr expr; self#of_suite suite] in
    let nd = self#mknd ~pvec:[1; 1] lab children in
    nd

  method of_elif (loc, expr, suite) =
    let tid = L.tid_of_expr expr in
    let nd = self#of_expr_suite (L.Elif tid) (expr, suite) in
    self#set_loc nd loc;
    nd

  method of_elifs elifs = List.map self#of_elif elifs

  method of_else (loc, suite) =
    let nd = self#mknd L.Else [self#of_suite suite] in
    self#set_loc nd loc;
    nd

  method of_finally (loc, suite) =
    let nd = self#mknd L.Finally [self#of_suite suite] in
    self#set_loc nd loc;
    nd

  method of_statement stmt =
    [%debug_log "@ %s" (Ast.Loc.to_string stmt.Ast.stmt_loc)];
    let stmtd = stmt.Ast.stmt_desc in
    let mkstmtnode ?(pvec=[]) = self#mknd ~pvec (L.of_statement stmtd) in
    let nd =
      match stmtd with
      | Ast.Ssimple sstmts -> begin
          (match sstmts with
          | [sstmt] -> self#of_simplestmt sstmt
          | _ -> mkstmtnode (List.map self#of_simplestmt sstmts))
      end
      | Ast.Sif(expr, suite, elifs, else_opt) -> begin
          mkstmtnode ~pvec:[1; 1; List.length elifs; opt_length else_opt]
            ([self#of_expr expr; self#of_suite suite]
             @ (self#of_elifs elifs) @ (of_opt self#of_else else_opt))
      end
      | Ast.Swhile(expr, suite, else_opt) -> begin
          mkstmtnode ~pvec:[1; 1; opt_length else_opt]
            ([self#of_expr expr; self#of_suite suite] @ (of_opt self#of_else else_opt))
      end
      | Ast.Sfor(targs, exprs, suite, else_opt) -> begin
          mkstmtnode ~pvec:[1; List.length exprs; 1; opt_length else_opt ]
            (
             (self#of_targs L.Targets targs)::(self#of_exprs L.In exprs)::
             (self#of_suite suite)::(of_opt self#of_else else_opt)
            )
      end
      | Ast.Stry(suite, excepts, else_opt, fin_opt) -> begin
          mkstmtnode ~pvec:[1; List.length excepts; opt_length else_opt; opt_length fin_opt]
            (((self#of_suite suite)::(self#of_excepts excepts))
             @ (of_opt self#of_else else_opt) @ (of_opt self#of_finally fin_opt))
      end
      | Ast.Stryfin(suite1, fin) -> begin
          mkstmtnode ~pvec:[1; 0; 0; 1] [self#of_suite suite1; self#of_finally fin]
      end
      | Ast.Swith(withitems, suite) -> begin
          mkstmtnode ~pvec:[List.length withitems; 1]
            ((List.map self#of_withitem withitems) @ [self#of_suite suite])
      end
      | Ast.Sasync_funcdef(decos, name, params, retann_opt, suite) -> begin
          let ndecos = if decos = [] then 0 else 1 in
          let psnds = self#of_named_parameters (L.conv_name name) params in
          let check_docstring_flag = options#python_ignore_docstring_flag in
          mkstmtnode ~pvec:[ndecos; 1; List.length psnds; opt_length retann_opt; 1]
            ((self#of_decorators name decos) @ [self#of_name name] @ psnds @
             (self#of_opt_lab L.ReturnAnnotation self#of_expr retann_opt) @
             [self#of_named_suite ~check_docstring_flag name suite])
      end
      | Ast.Sfuncdef(decos, name, params, retann_opt, suite) -> begin
          let ndecos = if decos = [] then 0 else 1 in
          let psnds = self#of_named_parameters (L.conv_name name) params in
          let check_docstring_flag = options#python_ignore_docstring_flag in
          mkstmtnode ~pvec:[ndecos; 1; List.length psnds; opt_length retann_opt; 1]
            ((self#of_decorators name decos) @ [self#of_name name] @ psnds @
             (self#of_opt_lab L.ReturnAnnotation self#of_expr retann_opt) @
             [self#of_named_suite ~check_docstring_flag name suite])
      end
      | Ast.Sclassdef(decos, name, arglist, suite) -> begin
          let ndecos = if decos = [] then 0 else 1 in
          let check_docstring_flag = options#python_ignore_docstring_flag in
          let c = [self#of_named_suite ~check_docstring_flag name suite] in
          let c, na =
            match arglist with
            | loc, [] when loc = Ast.Loc.dummy -> c, 0
            | loc, [] -> begin
                let nd = self#mkleaf L.Inheritance in
                self#set_loc nd loc;
                nd::c, 1
            end
            | loc, _ -> begin
                let nd =
                  self#mknd L.Inheritance (self#of_named_arglist (L.conv_name name) arglist)
                in
                self#set_loc nd loc;
                nd::c, 1
            end
          in
          let c = (self#of_decorators name decos) @ ((self#of_name name)::c) in
          mkstmtnode ~pvec:[ndecos; 1; na; 1] c
      end
      | Ast.Sasync stmt -> begin
          mkstmtnode [self#of_statement stmt]
      end
      | Ast.Smatch _ -> begin
          failwith "not yet"
      end

      | Ast.Serror -> mkstmtnode []
      | Ast.Smarker _ -> mkstmtnode []
    in
    self#set_loc nd stmt.Ast.stmt_loc;
    nd

  method of_withitem (expr, targ_opt) =
    let expr_nd = self#of_expr expr in
    match targ_opt with
    | Some targ -> begin
        let targ_nd = self#of_targ targ in
        let nd = self#mknd ~pvec:[1; 1] L.WithItem[expr_nd; targ_nd] in
        let loc = Loc.merge expr_nd#data#src_loc targ_nd#data#src_loc in
        self#_set_loc nd loc;
        nd
    end
    | None -> expr_nd

  method _of_targs lab = self#_of_exprs lab

  method of_targs lab = self#of_exprs lab

  method _of_exprs ?(pvec=[]) lab exprs =
    if exprs = [] then
      self#mkleaf lab
    else
      let children = exprs in
      let nd = self#mknd ~pvec lab children in
      let loc =
        Loc._merge (first children)#data#src_loc (last children)#data#src_loc
      in
      self#_set_loc nd loc;
      nd

  method of_exprs ?(pvec=[]) lab exprs =
    if exprs = [] then
      self#mkleaf lab
    else
      let children = List.map self#of_expr exprs in
      let nd = self#mknd ~pvec lab children in
      let loc =
        Loc._merge (first children)#data#src_loc (last children)#data#src_loc
      in
      self#_set_loc nd loc;
      nd

  method of_except (except_clause, suite) =
    let lc, ecnds = self#of_except_clause except_clause in
    let snd = self#of_suite suite in
    let loc = Loc._merge lc snd#data#src_loc in
    let children = ecnds @ [snd] in
    let pvec =
      match ecnds with
      | [] -> [0; 0; 1]
      | [_] -> [1; 0; 1]
      | _ -> [1; 1; 1]
    in
    let nd = self#mknd ~pvec L.Except children in
    self#_set_loc nd loc;
    nd

  method of_excepts es = List.map self#of_except es

  method of_decorators name decos =
    if decos = [] then []
    else
      let children = List.map self#of_decorator decos in
      let loc =
        Loc._merge (first children)#data#src_loc (last children)#data#src_loc
      in
      let nd = self#mknd (L.Decorators (L.conv_name name)) children in
      self#_set_loc nd loc;
      [nd]

  method of_simplestmt sstmt =
    [%debug_log "@ %s" (Ast.Loc.to_string sstmt.Ast.sstmt_loc)];
    let sstmtd = sstmt.Ast.sstmt_desc in
    let lab = L.of_simplestmt sstmtd in
    let mksstmtnode ?(pvec=[]) = self#mknd ~pvec lab in
    let nd =
      match sstmtd with
      | Ast.SSexpr exprs -> begin
          (match exprs with
          | [expr] -> self#of_expr expr
          | _ -> self#of_exprs (L.of_simplestmt sstmtd) exprs)
      end
      | Ast.SSassign(testlist_list, testlist) -> begin
          let targs_list =
            List.map
              (fun tl ->
                if tl.Ast.yield then
                  self#of_exprs L.Yield tl.Ast.list
                else
                  match tl.Ast.list with
                  | [x] -> self#of_expr x
                  | xl -> self#of_exprs (L.Primary L.Primary.Tuple) xl
              ) testlist_list
          in
          let lhs_nds =
            match targs_list with
            | [] -> []
            | [x] -> [x]
            | xl -> [self#_of_exprs L.LHS xl]
          in
          let exprs =
            if testlist.Ast.yield then
              [self#of_exprs L.Yield testlist.Ast.list]
            else
              List.map self#of_expr testlist.Ast.list
          in
          let rhs_nds =
            match exprs with
            | [] -> []
            | [x] -> [x]
            | _ -> [self#_of_exprs (L.Primary L.Primary.Tuple) exprs]
          in
          let pvec = [List.length lhs_nds; 0; List.length rhs_nds] in
          mksstmtnode ~pvec (lhs_nds @ rhs_nds)
      end
      | Ast.SSaugassign(targs, _, testlist) -> begin
          let lhs_nds =
            match targs with
            | [] -> []
            | [x] -> [self#of_expr x]
            | _ -> [self#of_targs (L.Primary L.Primary.Tuple) targs]
          in
          let rhs_nds =
            if testlist.Ast.yield then
              [self#of_exprs L.Yield testlist.Ast.list]
            else
              [self#of_exprs (L.Primary L.Primary.Tuple) testlist.Ast.list]
          in
          let pvec = [List.length lhs_nds; 0; List.length rhs_nds] in
          mksstmtnode ~pvec (lhs_nds @ rhs_nds)
      end
      | Ast.SSannassign(targs, (aloc, expr), testlist_opt) -> begin
          let lhs_nds =
            match targs with
            | [] -> []
            | [x] -> [self#of_expr x]
            | _ -> [self#of_targs (L.Primary L.Primary.Tuple) targs]
          in
          let exprs =
            match testlist_opt with
            | Some testlist when testlist.Ast.yield -> [self#of_exprs L.Yield testlist.Ast.list]
            | Some testlist -> List.map self#of_expr testlist.Ast.list
            | None -> []
          in
          let rhs_nds =
            match exprs with
            | [] -> []
            | [x] -> [x]
            | _ -> [self#_of_exprs (L.Primary L.Primary.Tuple) exprs]
          in
          let pvec = [List.length lhs_nds; 1; List.length rhs_nds] in
          let ann_nd = self#mknd L.Annotation [self#of_expr expr] in
          let _ = set_loc ann_nd aloc in
          mksstmtnode ~pvec (lhs_nds @ [ann_nd] @ rhs_nds)
      end
      | Ast.SSprint exprs -> self#of_exprs lab exprs
      | Ast.SSprintchevron(expr, exprs) -> begin
          mksstmtnode
            ([self#mknd L.Chevron [self#of_expr expr]] @ (List.map self#of_expr exprs))
      end
      | Ast.SSdel targs                   -> self#of_targs lab targs
      | Ast.SSpass                        -> self#mkleaf lab
      | Ast.SSbreak                       -> self#mkleaf lab
      | Ast.SScontinue                    -> self#mkleaf lab
      | Ast.SSreturn exprs                -> self#of_exprs lab exprs
      | Ast.SSraise                       -> self#mkleaf lab
      | Ast.SSraise1 expr                 -> self#of_exprs lab [expr]
      | Ast.SSraise2(expr1, expr2)        -> self#of_exprs lab [expr1; expr2]
      | Ast.SSraisefrom(expr1, expr2)     -> self#of_exprs lab [expr1; expr2]
      | Ast.SSraise3(expr1, expr2, expr3) -> self#of_exprs lab [expr1; expr2; expr3]
      | Ast.SSyield exprs                 -> self#of_exprs lab exprs
      | Ast.SSimport dottedname_as_names -> begin
          mksstmtnode (List.map self#of_dottedname_as_name dottedname_as_names)
      end
      | Ast.SSfrom(dots_opt, dottedname_opt, name_as_names) -> begin
          let nds = List.map self#of_name_as_name name_as_names in
          let children, nfrom =
            match dots_opt, dottedname_opt with
            | None,      Some dottedname -> begin
                let dnnd = self#of_dottedname dottedname in
                dnnd::nds, 1
            end
            | Some dots, Some dottedname -> begin
                let dnd = self#of_dots dots in
                let dnnd = self#of_dottedname dottedname in
                dnd::dnnd::nds, 2
            end
            | Some dots, None -> begin
                let dnd = self#of_dots dots in
                dnd::nds, 1
            end
            | _ -> assert false
          in
          mksstmtnode ~pvec:[nfrom; List.length nds] children
      end
      | Ast.SSglobal names -> begin
          mksstmtnode
            (List.map
               (fun name ->
                 let n = self#mkleaf (L.Name (L.conv_name name)) in
                 self#set_loc n (L.loc_of_name name);
                 n
               )
               names)
      end
      | Ast.SSnonlocal names -> begin
          mksstmtnode
            (List.map
               (fun name ->
                 let n = self#mkleaf (L.Name (L.conv_name name)) in
                 self#set_loc n (L.loc_of_name name);
                 n
               )
               names)
      end
      | Ast.SSexec expr -> self#of_exprs ~pvec:[1; 0; 0] lab [expr]
      | Ast.SSexec2(expr1, expr2) -> self#of_exprs ~pvec:[1; 1; 0] lab [expr1; expr2]
      | Ast.SSexec3(expr1, expr2, expr3) -> self#of_exprs ~pvec:[1; 1; 1] lab [expr1; expr2; expr3]
      | Ast.SSassert expr -> self#of_exprs lab [expr]
      | Ast.SSassert2(expr1, expr2) -> self#of_exprs lab [expr1; expr2]
      | Ast.SSerror -> mksstmtnode []
    in
    self#set_loc nd sstmt.Ast.sstmt_loc;
    nd

  method of_dots (loc, ndots) =
    let nd = self#mkleaf (L.Dots ndots) in
    self#set_loc nd loc;
    nd

  method of_dottedname_as_name (dname, name_opt) =
    let dname_nd = self#of_dottedname dname in
    match name_opt with
    | None -> dname_nd
    | Some name ->
        self#mknd L.As [dname_nd; self#mkleaf (L.Name (L.conv_name name))]

  method of_name_as_name (name, name_opt) =
    let name_nd = self#of_name name in
    match name_opt with
    | None -> name_nd
    | Some name ->
        self#mknd L.As [name_nd; self#mkleaf (L.Name (L.conv_name name))]

  method of_except_clause = function
    | Ast.EX loc -> conv_loc loc, []
    | Ast.EX1(loc, expr) -> conv_loc loc, [self#of_expr expr]
    | Ast.EX2(loc, expr, targ) -> conv_loc loc, [self#of_expr expr; self#of_targ targ]

  method of_suite ?(check_docstring_flag=false) (loc, stmts) =
    let nl = List.map self#of_statement stmts in
    let children =
      if check_docstring_flag then
        match nl with
        | n :: tl when is_docstring n -> self#add_ignored_region n#data#src_loc; tl
        | _ -> nl
      else
        nl
    in
    let nd = self#mknd L.Suite children in
    self#set_loc nd loc;
    nd

  method of_named_suite ?(check_docstring_flag=false) name (loc, stmts) =
    let nl = List.map self#of_statement stmts in
    let children =
      if check_docstring_flag then
        match nl with
        | n :: tl when is_docstring n -> self#add_ignored_region n#data#src_loc; tl
        | _ -> nl
      else
        nl
    in
    let nd = self#mknd (L.NamedSuite (L.conv_name name)) children in
    self#set_loc nd loc;
    nd

  method of_parameters (loc, dparams) =
    match dparams with
    | [] when loc = Ast.Loc.dummy -> []
    | [] -> begin
        let nd = self#mkleaf L.Parameters in
        self#set_loc nd loc;
        [nd]
    end
    | _ -> begin
        let children = List.map self#of_vararg dparams in
        let nd = self#mknd L.Parameters children in
        self#set_loc nd loc;
        [nd]
    end

  method of_vararg = function
    | Ast.VAarg(fpdef, expr_opt) -> begin
        match expr_opt with
        | Some expr -> begin
            let children = [self#of_fpdef fpdef; self#of_expr expr] in
            let loc = Loc._merge (first children)#data#src_loc (last children)#data#src_loc in
            let nd =
              self#mknd ~pvec:[1; 1] (L.ParamDef (name_of_fpdef fpdef)) children
            in
            self#_set_loc nd loc;
            nd
        end
        | None -> self#of_fpdef fpdef
    end
    | Ast.VAargs(loc, None, None) -> begin
        let nd = self#mknd ~pvec:[0] L.Star [] in
        self#set_loc nd loc;
        nd
    end
    | Ast.VAargs(_, None, _) -> assert false
    | Ast.VAargs(loc, Some name, None) -> begin
        let nd = self#mknd ~pvec:[1] L.Star [self#of_name name] in
        self#set_loc nd loc;
        nd
    end
    | Ast.VAargs(loc, Some name, Some expr) -> begin
        let tpd =
          self#mknd (L.TypedParamDef (snd name)) [self#of_name name; self#of_expr expr]
        in
        let nd = self#mknd ~pvec:[1] L.Star [tpd] in
        self#set_loc nd loc;
        nd
    end
    | Ast.VAkwargs(loc, name, None) -> begin
        let nd = self#mknd L.StarStar [self#of_name name] in
        self#set_loc nd loc;
        nd
    end
    | Ast.VAkwargs(loc, name, Some expr) -> begin
        let tpd =
          self#mknd (L.TypedParamDef (snd name)) [self#of_name name; self#of_expr expr]
        in
        let nd = self#mknd L.StarStar [tpd] in
        self#set_loc nd loc;
        nd
    end
    | Ast.VAsep loc -> begin
        let nd = self#mkleaf L.Slash in
        self#set_loc nd loc;
        nd
    end

  method of_named_parameters name (loc, dparams) =
    match dparams with
    | [] when loc = Ast.Loc.dummy -> []
    | [] -> begin
        let nd = self#mkleaf (L.NamedParameters name) in
        self#set_loc nd loc;
        [nd]
    end
    | _ -> begin
        let children = List.map self#of_vararg dparams in
        let nd = self#mknd (L.NamedParameters name) children in
        self#set_loc nd loc;
        [nd]
    end

  method of_fpdef = function
    | Ast.Fname name -> self#of_name name
    | Ast.Ftyped(loc, name, expr) -> begin
        let nd =
          self#mknd (L.TypedParamDef (snd name)) [self#of_name name; self#of_expr expr]
        in
        self#set_loc nd loc;
        nd
    end
    | Ast.Flist(loc, fpdefs) -> begin
        let children = List.map self#of_fpdef fpdefs in
        let nd = self#mknd L.ListParamDef children in
        self#set_loc nd loc;
        nd
    end

  method of_decorator (loc, dname, arglist) =
    let dname_str = L.dottedname_to_string dname in
    let children = self#of_named_arglist dname_str arglist in
    let nd = self#mknd ~pvec:[List.length children] (L.Decorator dname_str) children in
    self#set_loc nd loc;
    nd


  method of_expr expr =
    let nd =
      match expr.Ast.expr_desc with
      | Ast.Eprimary prim           -> self#of_primary prim
      | Ast.Epower(prim, expr)      -> self#mknd L.Power [self#of_primary prim; self#of_expr expr]
      | Ast.Ebop(expr1, bop, expr2) -> self#of_exprs (L.of_bop bop) [expr1; expr2]
      | Ast.Euop(uop, expr)         -> self#of_exprs (L.of_uop uop) [expr]
      | Ast.Elambda(params, expr) -> begin
          let pnds = self#of_parameters params in
          self#mknd ~pvec:[List.length pnds; 1] L.Lambda (pnds @ [self#of_expr expr])
      end
      | Ast.Econd(expr1, expr2, expr3) -> self#of_exprs L.Test [expr1; expr2; expr3]
      | Ast.Estar expr                 -> self#of_exprs ~pvec:[1] L.Star [expr]
      | Ast.Enamed(expr1, expr2)       -> self#of_exprs L.Named [expr1; expr2]
      | Ast.Efrom expr                 -> self#of_exprs L.From [expr]
      | Ast.Earg(expr1, expr2)         -> self#of_exprs L.Argument [expr1; expr2]
      | Ast.Eerror                     -> self#of_exprs L.ERROR []
    in
    self#set_loc nd expr.Ast.expr_loc;
    nd


  method of_primary_desc primd =
    let lab = L.of_primary primd in
    let mkprimnode ?(pvec=[]) = self#mknd ~pvec lab in
    let nd =
      match primd with
      | Ast.Pname _ -> self#mkleaf lab

      | Ast.Pliteral lit -> begin
          let pystr_to_node = function
            | Ast.PSshort(lc, s) | Ast.PSlong(lc, s) ->
                let n = self#mkleaf (L.Primary (L.Primary.Literal (L.Literal.String s))) in
                self#set_loc n lc;
                n
          in
          match lit with
          | Ast.Lstring ([]|[_]) -> self#mkleaf lab
          | Ast.Lstring pystrs   -> mkprimnode (List.map pystr_to_node pystrs)
          | _                    -> self#mkleaf lab
      end
      | Ast.Pexpr expr                -> self#of_expr expr
      | Ast.Pparen expr               -> self#of_exprs lab [expr]
      | Ast.Ptuple exprs              -> self#of_exprs lab exprs
      | Ast.Pyield exprs              -> self#of_exprs lab exprs
      | Ast.PcompT(expr, compfor)     -> mkprimnode [self#of_expr expr; self#of_compfor compfor]
      | Ast.PcompL(expr, compfor)     -> mkprimnode [self#of_expr expr; self#of_compfor compfor]
      | Ast.Plist exprs               -> self#of_exprs lab exprs
      | Ast.Plistnull                 -> self#mkleaf lab
      | Ast.Pdictorset dictorsetmaker -> begin
          let pvec, children = self#of_dictorsetmaker dictorsetmaker in
          mkprimnode ~pvec children
      end
      | Ast.Pdictnull                 -> self#mkleaf lab
      | Ast.Pstrconv exprs            -> self#of_exprs lab exprs
      | Ast.Pattrref(prim, name)      -> self#mknd lab [self#of_primary prim; self#of_name name]
      | Ast.Psubscript(prim, exprs) -> begin
          let pvec = [1; List.length exprs] in
          mkprimnode ~pvec ((self#of_primary prim)::(List.map self#of_expr exprs))
      end
      | Ast.Pslice(prim, sliceitems) -> begin
          let pvec = [1; List.length sliceitems] in
          mkprimnode ~pvec ((self#of_primary prim)::(List.map self#of_sliceitem sliceitems))
      end
      | Ast.Pcall(prim, arglist) -> begin
          let tid = L.tid_of_primary prim in
          let lab = L.Primary (L.Primary.Call tid) in
          let ans = self#of_arglist tid arglist in
          let pvec = [1; List.length ans] in
          self#mknd ~pvec lab ((self#of_primary prim)::ans)
      end
      | Ast.Pawait prim -> mkprimnode [self#of_primary prim]
      | Ast.Pellipsis -> self#mkleaf lab
    in
    nd

  method of_primary prim =
    let primd = prim.Ast.prim_desc in
    let nd = self#of_primary_desc primd in
    self#set_loc nd prim.Ast.prim_loc;
    nd

  method of_targ t = self#of_expr t

  method of_listfor (loc, exprs1, exprs2, listiter_opt) =
    let children =
      let tgnd = self#of_exprs L.Target exprs1 in
      let innd = self#of_exprs L.In exprs2 in
      [tgnd; innd] @ (of_opt self#of_listiter listiter_opt)
    in
    let pvec = [1; 1; opt_length listiter_opt] in
    let nd = self#mknd ~pvec (L.Primary L.Primary.ListFor) children in
    self#set_loc nd loc;
    nd

  method of_listif (loc, expr, listiter_opt) =
    let children = (self#of_expr expr)::(of_opt self#of_listiter listiter_opt) in
    let nd = self#mknd ~pvec:[1; opt_length listiter_opt] L.ListIf children in
    self#set_loc nd loc;
    nd

  method of_listiter = function
    | Ast.LIfor listfor -> self#of_listfor listfor
    | Ast.LIif listif -> self#of_listif listif

  method of_dictelem delem =
    let nd =
      match delem.Ast.delem_desc with
      | DEkeyValue(e1, e2) -> self#of_exprs L.KeyDatum [e1; e2]
      | DEstarStar e -> self#of_exprs L.StarStar [e]
    in
    self#set_loc nd delem.Ast.delem_loc;
    nd

  method of_dictorsetmaker = function
    | Ast.DSMdict delems           -> [List.length delems; 0], List.map self#of_dictelem delems
    | Ast.DSMdictC(delem, compfor) -> [1; 1], [self#of_dictelem delem; self#of_compfor compfor]
    | Ast.DSMset es                -> [List.length es; 0], List.map self#of_expr es
    | Ast.DSMsetC(e, compfor)      -> [1; 1], [self#of_expr e; self#of_compfor compfor]

  method of_sliceitem = function
    | Ast.SIexpr expr -> self#of_expr expr

    | Ast.SI2(loc, expr1_opt, expr2_opt) -> begin
        let children =
          (of_opt self#of_expr expr1_opt) @
          (of_opt self#of_expr expr2_opt)
        in
        let pvec = [opt_length expr1_opt; opt_length expr2_opt; 0] in
        let nd = self#mknd ~pvec L.SliceItem children in
        self#set_loc nd loc;
        nd
    end
    | Ast.SI3(loc, expr1_opt, expr2_opt, expr3_opt) -> begin
        let children =
          (of_opt self#of_expr expr1_opt) @
          (of_opt self#of_expr expr2_opt) @
          [self#mknd ~pvec:[opt_length expr3_opt] L.Stride (of_opt self#of_expr expr3_opt)]
        in
        let pvec = [opt_length expr1_opt; opt_length expr2_opt; 1] in
        let nd = self#mknd ~pvec L.SliceItem children in
        self#set_loc nd loc;
        nd
    end
    (*| Ast.SIellipsis loc ->
        let nd = self#mkleaf L.Ellipsis in
        self#set_loc nd loc;
        nd*)

  method of_arglist tid (loc, args) =
    match args with
    | [] when loc = Ast.Loc.dummy -> []
    | [] -> begin
        let nd = self#mkleaf (L.Arguments tid) in
        self#set_loc nd loc;
        [nd]
    end
    | _ -> begin
        let children = List.map self#of_argument args in
        let nd = self#mknd (L.Arguments tid) children in
        self#set_loc nd loc;
        [nd]
    end

  method of_named_arglist name (loc, args) =
    match args with
    | [] when loc = Ast.Loc.dummy -> []
    | [] -> begin
        let nd = self#mkleaf (L.NamedArguments name) in
        self#set_loc nd loc;
        [nd]
    end
    | _ -> begin
        let children = List.map self#of_argument args in
        let nd = self#mknd (L.NamedArguments name) children in
        self#set_loc nd loc;
        [nd]
    end

  method of_argument = function
    | Aarg(loc, expr, expr_opt) -> begin
        match expr_opt with
        | Some e -> begin
            let nd = self#mknd ~pvec:[1; 1] L.Argument [self#of_expr expr; self#of_expr e] in
            self#set_loc nd loc;
            nd
        end
        | None -> self#of_expr expr
    end
    | Acomp(loc, expr, compfor) -> begin
        let nd = self#mknd L.CompArgument [self#of_expr expr; self#of_compfor compfor] in
        self#set_loc nd loc;
        nd
    end
    | Aassign(loc, expr1, expr2) -> begin
        let nd = self#mknd L.AssignArgument [self#of_expr expr1; self#of_expr expr2] in
        self#set_loc nd loc;
        nd
    end
    | Aargs(loc, expr) -> begin
        let nd = self#mknd ~pvec:[1] L.Star [self#of_expr expr] in
        self#set_loc nd loc;
        nd
    end
    | Akwargs(loc, expr) -> begin
        let nd = self#mknd L.StarStar [self#of_expr expr] in
        self#set_loc nd loc;
        nd
    end

  method of_compiter = function
    | Ast.Cfor compfor -> self#of_compfor compfor
    | Ast.Cif compif -> self#of_compif compif

  method of_compif (loc, expr, compiter_opt) =
    let children = (self#of_expr expr)::(of_opt self#of_compiter compiter_opt) in
    let nd = self#mknd L.GenIf children in
    self#set_loc nd loc;
    nd

  method of_compfor (loc, (exprs, expr, compiter_opt), async) =
    let children =
      (self#of_exprs L.Target exprs)::(self#of_exprs L.In [expr])::
      (of_opt self#of_compiter compiter_opt)
    in
    let lab =
      if async then
        L.AsyncGenFor
      else
        L.GenFor
    in
    let nd = self#mknd ~pvec:[1; 1; opt_length compiter_opt] lab children in
    self#set_loc nd loc;
    nd

end (* of class Python.Tree.translator *)
]


[%%capture_path
let of_fileinput options comment_tbl (*fname*)_ =
  let trans = new translator options comment_tbl in function (* toplevel convert function *)
    | Ast.Fileinput(loc, stmts) ->
        let nl = List.map trans#of_statement stmts in
        let children =
          if options#python_ignore_docstring_flag then
            match nl with
            | n :: tl when is_docstring n -> trans#add_ignored_region n#data#src_loc; tl
            | _ -> nl
          else
            nl
        in
        let nd = mknode options (L.FileInput "") children in
        trans#set_loc nd loc;

        if not options#python_ignore_comment_flag then begin
          let lnl =
            List.fast_sort Stdlib.compare (Hashtbl.fold (fun ln _ l -> ln::l) comment_tbl [])
          in
          begin %debug_block
            [%debug_log "comments:"];
            List.iter
              (fun ln ->
                let c = Hashtbl.find comment_tbl ln in
                [%debug_log "%d: [%s]" ln c.Ast.c_comment]
              ) lnl;
            [%debug_log "comment node candidates:"];
          end;
          List.iter
            (fun ln ->
              try
                let cand, pos_opt = Hashtbl.find trans#comment_node_cand_tbl ln in
                match pos_opt with
                | Some pos -> begin
                    try
                      let c = Hashtbl.find comment_tbl ln in
                      let comment = c.Ast.c_comment in
                      [%debug_log "%d -> %s pos=%d [%s]" ln cand#data#to_string pos comment];
                      let cn = mkleaf options (L.Comment comment) in
                      set_loc cn c.Ast.c_loc;
                      cand#add_child pos cn
                    with
                      Not_found -> [%debug_log "%d -> %s pos=%d" ln cand#data#to_string pos];
                end
                | None -> begin
                    try
                      let c = Hashtbl.find comment_tbl ln in
                      let comment = c.Ast.c_comment in
                      [%debug_log "%d -> %s [%s]" ln cand#data#to_string comment];
                      let cn = mkleaf options (L.Comment comment) in
                      set_loc cn c.Ast.c_loc;
                      cand#add_child_rightmost cn
                    with
                      Not_found -> [%debug_log "%d -> %s" ln cand#data#to_string];
                end
              with
                Not_found -> [%debug_log "%d ->" ln]
            ) (List.rev lnl)
        end;

        let tree = new c options nd true in
        [%debug_log "\n%s" tree#to_string];
        tree#collapse;
        trans#set_bindings tree;
        tree#init;
        tree, trans#ignored_regions
]

let of_ast options fname ast =
  let tree, ignored_regions =
    of_fileinput options ast#comment_tbl fname ast#fileinput
  in
  tree#set_misparsed_regions ast#missed_regions;
  tree#set_misparsed_LOC ast#missed_LOC;
  tree#set_total_LOC ast#lines_read;
  let ignored_regions =
    ignored_regions @ ast#blank_regions @ ast#ignored_regions @ ast#comment_regions
  in
  tree#set_ignored_regions ignored_regions;
  tree
OCaml

Innovation. Community. Security.