package comby-kernel
A match engine for structural code search and replace that supports ~every language
Install
Dune Dependency
Authors
Maintainers
Sources
comby-kernel.1.7.0.tar.gz
md5=ee6556d8bd9b25ed0445ebe23862e48a
sha512=e6386c8ce5ef14bbcab2b0ead5b1edc39375438f56330d5f02e81e467afe6623a7e299f97f26008d77bbc62850c6dc63a7cbe5b81671b5183ff3adeee5946bb3
doc/src/comby-kernel.matchers/omega.ml.html
Source file omega.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
open Core_kernel open Vangstrom open Omega_parser_helper type omega_match_production = { offset : int ; identifier : string ; text : string } [@@deriving yojson] type production = | Unit | String of string | Template_string of string | Hole of Types.hole | Match of omega_match_production let configuration_ref = ref (Configuration.create ()) let implicit_equals_match_satisfied : bool ref = ref true let current_environment_ref : Match.Environment.t ref = ref (Match.Environment.create ()) let matches_ref : Match.t list ref = ref [] let source_ref : string ref = ref "" let push_implicit_equals_match_satisfied : bool ref = ref true let push_environment_ref : Match.Environment.t ref = ref (Match.Environment.create ()) let push_matches_ref : Match.t list ref = ref [] let push_source_ref : string ref = ref "" let filepath_ref : string option ref = ref None let debug = match Sys.getenv "DEBUG_COMBY" with | exception Not_found -> false | _ -> true let rewrite = match Sys.getenv "REWRITE" with | exception Not_found -> false | _ -> true let actual = Buffer.create 10 let rewrite_template = ref "" module Make (Language : Types.Language.S) (Meta : Metasyntax.S) (Ext : External.S) = struct module rec Matcher : Types.Matcher.S = struct include Language.Info module Template = Template.Make(Meta)(Ext) let wildcard = "_" (* This is the init we will pass in with a functor later *) let acc = "" (* This is the function we will pass in with a functor later *) let f acc (production : production) = match production with | String s -> (* unmatched, append when we rewrite *) if rewrite then Buffer.add_string actual s; acc | Template_string _ -> acc (* matched. if a constant string in the template is matched, don't append it *) | Unit -> if debug then Format.printf "Unit@."; acc | Hole _ -> if debug then Format.printf "Hole@."; acc | Match _ -> if debug then Format.printf "Match@."; acc let create v = Types.Ast.Template [Hole { variable = v; pattern = v; offset = 0; kind = Value }] let implicit_equals_satisfied environment identifier range matched = let open Match in if debug then Format.printf "Looking up %s@." identifier; match Environment.lookup environment identifier with | None -> Some (Environment.add ~range environment identifier matched) | Some _ when String.(identifier = wildcard) -> Some environment | Some existing_value -> let Range.{ match_start = { offset; _ }; _ } = Option.value_exn (Environment.lookup_range environment identifier) in if offset = range.match_start.offset then (* case when already present from rest parser *) Some environment else if String.(existing_value = matched) then (* equals existing. record a witness *) let identifier' = Format.sprintf "%s_equal_%s" identifier (!configuration_ref.fresh ()) in let environment' = Environment.add ~range environment identifier' matched in Some environment' else (* exists and not equal *) None let r acc production : (production * 'a) t = let open Match in let open Location in let open Range in let acc = f acc production in match production with | String _ -> return (Unit, acc) | Match { offset = pos_begin; identifier; text = content } -> (* Inefficiency: a Match production happens even for hole parsers in 'rest'. It's difficult to tease out the right time to record, or manipulate the parsers here. Instead, we check whether the environment already contains this hole (to avoid adding a _equal_ entry) by looking at whether the variable at that offset is already recorded, which uniquely identifies whether we've already seen it *) begin if debug then Format.printf "Match: %S @@ %d for %s@." content pos_begin identifier; (* line/col values are placeholders and not accurate until processed in pipeline.ml *) let before = { offset = pos_begin; line = 1; column = pos_begin + 1 } in let pos_after_offset = pos_begin + String.length content in let after = { offset = pos_after_offset; line = 1; column = pos_after_offset + 1 } in let range = { match_start = before; match_end = after } in if debug then Format.printf "record@."; match implicit_equals_satisfied !current_environment_ref identifier range content with | None -> implicit_equals_match_satisfied := false; return (Unit, acc) (* don't record, unsat *) | Some environment -> let environment = Environment.add ~range environment identifier content in current_environment_ref := environment; return (Unit, acc) end | _ -> return (Unit, acc) (* previous r cannot affect control flow match_context to ignore adding a match if a equivalence was refuted *) let record_match_context pos_before pos_after rule = let open Match.Location in if debug then Format.printf "match context start pos: %d@." pos_before; if debug then Format.printf "match context end pos %d@." pos_after; let extract_matched_text source { offset = match_start; _ } { offset = match_end; _ } = if debug then Format.printf "Attempt slice start %d end %d on %S@." match_start match_end source; if match_start = 0 && match_end = 0 then (* Special case: slice will return the whole string if match_start is 0 and match_end is 0. It needs to be empty string *) "" else String.slice source match_start match_end in let match_context = let match_start = { offset = pos_before; line = 1; column = pos_before + 1 } in let match_end = { offset = pos_after; line = 1; column = pos_after + 1 } in let text = extract_matched_text !source_ref match_start match_end in Match. { range = { match_start; match_end } ; environment = !current_environment_ref ; matched = text } in (* substitute now *) if debug then Format.printf "Curr env: %s@." @@ Match.Environment.to_string !current_environment_ref; match rule with | None -> if rewrite then begin let result, _ = Template.substitute ?filepath:!filepath_ref (Template.parse !rewrite_template) !current_environment_ref in (* Don't just append, but replace the match context including constant strings. I.e., somewhere where we are appending the parth that matched, it shouldn't, and instead just ignore. *) Buffer.add_string actual result; end; matches_ref := match_context :: !matches_ref | Some rule -> push_environment_ref := !current_environment_ref; push_implicit_equals_match_satisfied := !implicit_equals_match_satisfied; (* FIXME we should not have to convert here. Pass module, but after fixing this functor's signature. *) let metasyntax = Metasyntax. { syntax = Meta.syntax ; identifier = Meta.identifier ; aliases = Meta.aliases } in let external_handler = Ext.handler in let sat, env = Program.apply ~metasyntax ~external_handler ~substitute_in_place:(!configuration_ref.substitute_in_place) ?filepath:!filepath_ref rule !current_environment_ref in current_environment_ref := !push_environment_ref; implicit_equals_match_satisfied := !push_implicit_equals_match_satisfied; let new_env = if sat then env else None in match new_env with | None -> if debug then Format.printf "No new_env@."; if rewrite then Buffer.add_string actual match_context.matched | Some env -> if debug then Format.printf "Some new env %s@." @@ Match.Environment.to_string env; current_environment_ref := env; begin let result, _ = Template.substitute ?filepath:!filepath_ref (Template.parse !rewrite_template) !current_environment_ref in (* Don't just append, but replace the match context including constant strings. I.e., somewhere where we are appending the parth that matched, it shouldn't, and instead just ignore. *) Buffer.add_string actual result; end; matches_ref := { match_context with environment = !current_environment_ref } :: !matches_ref let multiline left right = let open Parsers.Comments.Omega.Multiline in let module M = Make(struct let left = left let right = right end) in M.comment let until_newline start = let open Parsers.Comments.Omega.Until_newline in let module M = Make(struct let start = start end) in M.comment let comment_parser = match Language.Syntax.comments with | [] -> zero | syntax -> let parsers = List.map syntax ~f:(function | Multiline (left, right) -> multiline left right | Until_newline start -> until_newline start | Nested_multiline (_, _) -> zero) (* FIXME: unimplemented nested multiline comments *) in choice parsers type 'a literal_parser_callback = contents:string -> left_delimiter:string -> right_delimiter:string -> 'a let escapable delimiter escape_character = let open Parsers.String_literals.Omega.Escapable in let module M = Make(struct let delimiter = delimiter let escape = escape_character end) in M.base_string_literal let raw left_delimiter right_delimiter = let open Parsers.String_literals.Omega.Raw in let module M = Make(struct let left_delimiter = left_delimiter let right_delimiter = right_delimiter end) in M.base_string_literal let escapable_string_literal_parser (f : 'a literal_parser_callback) = choice @@ match Language.Syntax.escapable_string_literals with | None -> [] | Some { delimiters; escape_character } -> List.map delimiters ~f:(fun delimiter -> escapable delimiter escape_character >>= fun contents -> return (f ~contents ~left_delimiter:delimiter ~right_delimiter:delimiter)) let raw_string_literal_parser (f : 'a literal_parser_callback) = choice @@ List.map Language.Syntax.raw_string_literals ~f:(fun (left_delimiter, right_delimiter) -> raw left_delimiter right_delimiter >>= fun contents -> return (f ~contents ~left_delimiter ~right_delimiter)) let until_of_from from = Language.Syntax.user_defined_delimiters |> List.find_map ~f:(fun (from', until) -> if String.equal from from' then Some until else None) |> function | Some until -> until | None -> assert false let reserved_holes = List.map Template.Matching.hole_parsers ~f:(fun (_, parser) -> parser *> return "") let reserved_parsers = let user_defined_delimiters = List.concat_map Language.Syntax.user_defined_delimiters ~f:(fun (from, until) -> [string from; string until]) in let user_defined_escapable_strings = match Language.Syntax.escapable_string_literals with | Some { delimiters; _ } -> List.concat_map delimiters ~f:(fun delimiter -> [string delimiter]) | None -> [] in let user_defined_raw_strings = List.concat_map Language.Syntax.raw_string_literals ~f:(fun (from, until) -> [string from; string until]) in let user_defined_reserved_comments = List.concat_map Language.Syntax.comments ~f:(function | Multiline (left, right) -> [string left; string right] | Nested_multiline (left, right) -> [string left; string right] | Until_newline start -> [string start]) in let spaces1 = [ Omega_parser_helper.spaces1 ] in [ user_defined_delimiters ; reserved_holes ; user_defined_escapable_strings ; user_defined_raw_strings ; user_defined_reserved_comments ; spaces1 ] |> List.concat |> choice let generate_single_hole_parser () = (alphanum <|> char '_') >>| String.of_char let delimiters left right = match left, right with | Some left_delimiter, Some right_delimiter -> [ (left_delimiter, right_delimiter) ] | _ -> Language.Syntax.user_defined_delimiters let between_nested_delims p delimiters = let between_nested_delims p from = let until = until_of_from from in between (string from) (string until) p >>| fun result -> String.concat @@ [from] @ result @ [until] in delimiters |> List.map ~f:fst |> List.map ~f:(between_nested_delims p) |> choice let generate_everything_hole_parser ?priority_left_delimiter:left ?priority_right_delimiter:right () = let delimiters = delimiters left right in let reserved = List.concat_map delimiters ~f:(fun (from, until) -> [from; until]) in let other = not_followed_by (choice @@ List.map reserved ~f:string) *> any_char >>| String.of_char in fix (fun grammar -> let delims_over_holes = between_nested_delims (many grammar) delimiters in choice [ comment_parser ; raw_string_literal_parser (fun ~contents ~left_delimiter:_ ~right_delimiter:_ -> contents) ; escapable_string_literal_parser (fun ~contents ~left_delimiter:_ ~right_delimiter:_ -> contents) ; spaces1 ; delims_over_holes ; other ]) let generate_delimited_hole_parser ?priority_left_delimiter:left ?priority_right_delimiter:right () = between_nested_delims (many @@ generate_everything_hole_parser ?priority_left_delimiter:left ?priority_right_delimiter:right ()) (delimiters left right) (* this thing is wrapped by a many. also rename it to 'string hole match syntax per char' *) let escapable_literal_grammar ~right_delimiter = match Language.Syntax.escapable_string_literals with | None -> zero | Some { escape_character; _ } -> choice [ (string (Format.sprintf "%c%s" escape_character right_delimiter)) ; (string (Format.sprintf "%c%c" escape_character escape_character)) ; (not_followed_by (string right_delimiter) *> any_char >>| String.of_char) ] let raw_literal_grammar ~right_delimiter = (not_followed_by (string right_delimiter) *> any_char >>| String.of_char) let seq p_list = List.fold p_list ~init:(return (Unit, "")) ~f:( *>) let convert ?left_delimiter ?right_delimiter (p_list : (production * 'a) t list) : (production * 'a) t list = let add_match user_state identifier p = pos >>= fun offset -> p >>= fun value -> let m = { offset ; identifier ; text = value } in if debug then Format.printf "add_match@."; r user_state (Match m) in List.fold (List.rev p_list) ~init:[] ~f:(fun acc p -> match parse_string ~consume:All p "_signal_hole" with | Error s -> if debug then Format.printf "Composing p with terminating parser, error %s@." s; p::acc | Ok (Hole { sort; identifier; dimension; _ }, user_state) -> begin match sort with | Regex -> let separator = List.find_map_exn Meta.syntax ~f:(function | Hole _ -> None | Regex (_, separator, _) -> Some separator) in let identifier, pattern = String.lsplit2_exn identifier ~on:separator in (* FIXME parse *) let identifier = if String.(identifier = "") then wildcard else identifier in if debug then Format.printf "Regex: Id: %s Pat: %s@." identifier pattern; let pattern, prefix = if String.is_prefix pattern ~prefix:"^" then (* FIXME: match beginning of input too *) String.drop_prefix pattern 1, Some ( (char '\n' *> return "") <|> (pos >>= fun p -> if p = 0 then return "" else fail "") ) else pattern, None in let pattern, suffix = if String.is_suffix pattern ~suffix:"$" then String.drop_suffix pattern 1, Some (char '\n' *> return "" <|> end_of_input *> return "") else pattern, None in let compiled_regexp = Regexp.PCRE.make_regexp pattern in let regexp_parser = Regexp.PCRE.regexp compiled_regexp in let regexp_parser = match prefix, suffix with | Some prefix, None -> prefix *> regexp_parser | None, Some suffix -> regexp_parser <* suffix | Some prefix, Some suffix -> prefix *> regexp_parser <* suffix | None, None -> regexp_parser in (* the eof matters here for that one tricky test case *) let base_parser = [ regexp_parser ; end_of_input >>= fun () -> return "" ] in let hole_semantics = choice base_parser in (add_match user_state identifier hole_semantics)::acc | Alphanum -> let allowed = choice [alphanum; char '_'] >>| String.of_char in let hole_semantics = many1 allowed >>| String.concat in (add_match user_state identifier hole_semantics)::acc | Non_space -> let non_space = ([ Omega_parser_helper.skip space1 ; Omega_parser_helper.skip reserved_parsers ] |> choice |> not_followed_by) *> any_char >>| Char.to_string in let rest = match acc with | [] -> end_of_input *> return (Unit, "") | _ -> return () >>= fun () -> seq acc >>= fun r -> return r in let hole_semantics = many1 (not_followed_by rest *> non_space) >>| String.concat in (add_match user_state identifier hole_semantics)::acc | Line -> let allowed = many (not_followed_by (string "\n" <|> string "\r\n") *> any_char ) >>| fun x -> [(String.of_char_list x)^"\n"] in let hole_semantics = allowed <* char '\n' >>| String.concat in (add_match user_state identifier hole_semantics)::acc | Blank -> let hole_semantics = many1 blank >>| String.of_char_list in (add_match user_state identifier hole_semantics)::acc | Expression -> let non_space = ([ Omega_parser_helper.skip space1 ; Omega_parser_helper.skip reserved_parsers ] |> choice |> not_followed_by) *> any_char >>| Char.to_string in let delimited = generate_delimited_hole_parser ?priority_left_delimiter:left_delimiter ?priority_right_delimiter:right_delimiter () in let matcher = non_space <|> delimited in let rest = match acc with | [] -> end_of_input *> return (Unit, "") | _ -> return () >>= fun () -> seq acc >>= fun r -> return r in let hole_semantics = many1 (not_followed_by rest *> matcher) >>| String.concat in (add_match user_state identifier hole_semantics)::acc | Everything -> let matcher = match dimension with | Code -> generate_everything_hole_parser ?priority_left_delimiter:left_delimiter ?priority_right_delimiter:right_delimiter () | Escapable_string_literal -> let right_delimiter = Option.value_exn right_delimiter in escapable_literal_grammar ~right_delimiter | Raw_string_literal -> let right_delimiter = Option.value_exn right_delimiter in raw_literal_grammar ~right_delimiter | Comment -> failwith "Unimplemented" in let rest = match acc with | [] -> end_of_input *> return (Unit, "") | _ -> seq acc in let hole_semantics = many (not_followed_by rest *> matcher) >>| String.concat in (add_match user_state identifier hole_semantics)::acc end | _ -> failwith "unreachable: _signal_hole parsed but not handled by Hole variant") let sequence_chain' ?left_delimiter ?right_delimiter p_list = convert ?left_delimiter ?right_delimiter p_list |> seq let sequence_chain_unused ?left_delimiter ?right_delimiter (p_list : (production * 'a) t list) = if debug then Format.printf "Sequence chain p_list size: %d@." @@ List.length p_list; let i = ref 0 in List.fold_right p_list ~init:(return (Unit, acc)) ~f:(fun p acc -> let result = if debug then Format.printf "iterate fold_right %d@." !i; match parse_string ~consume:All p "_signal_hole" with | Error s -> if debug then Format.printf "Composing p with terminating parser, error %s@." s; p *> acc | Ok (Hole { sort; identifier; dimension; _ }, user_state) -> begin match sort with | Regex -> let identifier, pattern = String.lsplit2_exn identifier ~on:'~' in let identifier = if String.(identifier = "") then "_" else identifier in if debug then Format.printf "Regex: Id: %s Pat: %s@." identifier pattern; let pattern, prefix = if String.is_prefix pattern ~prefix:"^" then (* FIXME: match beginning of input too *) String.drop_prefix pattern 1, Some ( (char '\n' *> return "") <|> (pos >>= fun p -> if p = 0 then return "" else fail "") ) else pattern, None in let pattern, suffix = if String.is_suffix pattern ~suffix:"$" then String.drop_suffix pattern 1, Some (char '\n' *> return "" <|> end_of_input *> return "") else pattern, None in let compiled_regexp = Regexp.PCRE.make_regexp pattern in let regexp_parser = Regexp.PCRE.regexp compiled_regexp in let regexp_parser = match prefix, suffix with | Some prefix, None -> prefix *> regexp_parser | None, Some suffix -> regexp_parser <* suffix | Some prefix, Some suffix -> prefix *> regexp_parser <* suffix | None, None -> regexp_parser in (* the eof matters here for that one tricky test case *) let base_parser = [ regexp_parser ; end_of_input >>= fun () -> return "" ] in pos >>= fun offset -> choice base_parser >>= fun value -> if debug then Format.printf "Regex match @@ %d value %s@." offset value; acc >>= fun _ -> let m = { offset ; identifier ; text = value } in r user_state (Match m) | Alphanum -> pos >>= fun offset -> many1 (generate_single_hole_parser ()) >>= fun value -> (* acc must come after in order to sat. try mimic alpha to better express this. *) acc >>= fun _ -> let m = { offset ; identifier ; text = String.concat value } in r user_state (Match m) | Non_space -> if debug then Format.printf "Doing non_space@."; let first_pos = ref (-1) in let set_pos v = first_pos := v in let get_pos () = !first_pos in let rest = (* if this is the base case (the first time we go around the loop backwards, when the first parser is a hole), then it means there's a hole at the end without anything following it in the template. So it should always match to end_of_input, not empty string. If it matches to empty string it chops up the matches so that f,o,o are three matches of foo. *) if !i = 0 then (if debug then Format.printf "hole until: match to the end of this level@."; end_of_input) else (if debug then Format.printf "hole until: append suffix@."; Omega_parser_helper.skip acc) in ( pos >>= fun pos -> if get_pos () = (-1) then set_pos pos; let stop_at = choice [ rest; Omega_parser_helper.skip reserved_parsers ] in many1_till_stop any_char stop_at (* Beware of this use. *) ) >>= fun value -> acc >>= fun _ -> let offset = match get_pos () with | -1 -> failwith "Did not expect unset offset" | offset -> if debug then Format.printf "Offset: %d@." offset; set_pos (-1); offset in let m = { offset ; identifier ; text = String.of_char_list value } in r user_state (Match m) | Line -> pos >>= fun offset -> let allowed = many (not_followed_by (char '\n') *> any_char) >>| fun x -> [(String.of_char_list x)^"\n"] in allowed <* char '\n' >>= fun value -> acc >>= fun _ -> let m = { offset ; identifier ; text = String.concat value } in r user_state (Match m) | Expression -> let first_pos = ref (-1) in let set_pos v = first_pos := v in let get_pos () = !first_pos in let _non_space : string t = let rest = if !i = 0 then end_of_input else Omega_parser_helper.skip acc in ( pos >>= fun pos -> if get_pos () = (-1) then set_pos pos; let stop_at = choice [ rest; Omega_parser_helper.skip reserved_parsers ] in many1_till_stop any_char stop_at (* Beware of this use. *) ) >>| String.of_char_list in let non_space = many1 (not_followed_by (Omega_parser_helper.skip (char ' ') <|> Omega_parser_helper.skip reserved_parsers) *> any_char) >>| String.of_char_list in let delimited = (* IDK why this rest works without end_of_input but it's needed for non_space. *) let rest = Omega_parser_helper.skip acc in (many1_till (pos >>= fun pos -> if debug then Format.printf "Pos is %d@." pos; if get_pos () = (-1) then set_pos pos; (match dimension with | Code -> generate_delimited_hole_parser ?priority_left_delimiter:left_delimiter ?priority_right_delimiter:right_delimiter () | Escapable_string_literal -> let right_delimiter = Option.value_exn right_delimiter in escapable_literal_grammar ~right_delimiter | Raw_string_literal -> let right_delimiter = Option.value_exn right_delimiter in escapable_literal_grammar ~right_delimiter | _ -> failwith "Unimplemented for comment" ) ) (pos >>= fun pos -> if get_pos () = (-1) then set_pos pos; if debug then Format.printf "Pos is %d@." pos; rest) (* it may be that the many till for the first parser succeeds on 'empty string', specifically in the :[1]:[2] case for :[1]. We won't capture the pos of :[1] in the first parser since it doesn't fire, so we have to set the pos right before the until parser below, if that happens. *) ) >>| String.concat in (many1 @@ choice [non_space; delimited]) >>= fun value -> acc >>= fun _ -> let offset = match get_pos () with | -1 -> failwith "Did not expect unset offset" | offset -> if debug then Format.printf "Offset: %d@." offset; set_pos (-1); offset in let m = { offset ; identifier ; text = String.concat value } in r user_state (Match m) | Blank -> pos >>= fun offset -> many1 blank >>= fun value -> acc >>= fun _ -> let m = { offset ; identifier ; text = String.of_char_list value } in r user_state (Match m) | Everything -> if debug then Format.printf "do hole %s@." identifier; (* change this so that rest is not consumed *) let rest = (* if this is the base case (the first time we go around the loop backwards, when the first parser is a hole), then it means there's a hole at the end without anything following it in the template. So it should always match to end_of_input (not empty string) *) if !i = 0 then (if debug then Format.printf "hole everything until: match to the end of this level@."; end_of_input) else (if debug then Format.printf "hole everything until: append suffix@."; Omega_parser_helper.skip acc) in let first_pos = ref (-1) in let set_pos v = first_pos := v in let get_pos () = !first_pos in let hole_matcher = (many_till (pos >>= fun pos -> if debug then Format.printf "Pos is %d@." pos; if get_pos () = (-1) then set_pos pos; (match dimension with | Code -> generate_everything_hole_parser () | Escapable_string_literal -> let right_delimiter = Option.value_exn right_delimiter in escapable_literal_grammar ~right_delimiter | Raw_string_literal -> let right_delimiter = Option.value_exn right_delimiter in escapable_literal_grammar ~right_delimiter | _ -> failwith "Unimplemented for comment" ) ) (pos >>= fun pos -> if get_pos () = (-1) then set_pos pos; if debug then Format.printf "Pos is %d@." pos; rest) (* it may be that the many till for the first parser succeeds on 'empty string', specifically in the :[1]:[2] case for :[1]. We won't capture the pos of :[1] in the first parser since it doesn't fire, so we have to set the pos right before the until parser below, if that happens. *) ) >>| String.concat in hole_matcher >>= fun text -> let offset = match get_pos () with | -1 -> failwith "Did not expect unset offset" | offset -> if debug then Format.printf "Offset: %d@." offset; set_pos (-1); offset in let m = { offset ; identifier ; text } in if debug then Format.printf "Recording!@."; r user_state (Match m) end | Ok (_, _user_state) -> failwith "unreachable: _signal_hole parsed but not handled by Hole variant" in i := !i + 1; result) let generate_pure_spaces_parser _ignored = spaces1 >>= fun s1 -> r acc (Template_string s1) (* XXX change ignore to unit once everything works. right now it's the string that was parsed by spaces1 *) let generate_spaces_parser _ignored = (* XXX still some parts ignored in the choice case in Alpha *) if debug then Format.printf "Template_spaces(%s)@." _ignored; many1 @@ choice [ comment_parser ; spaces1 ] >>= fun result -> r acc (Template_string (String.concat result)) (** All code can have comments interpolated *) let generate_string_token_parser str = if debug then Format.printf "Template_string(%s)@." str; many comment_parser >>= fun s1 -> string str >>= fun result -> r acc (Template_string (String.concat s1 ^ result)) let hole_parser sort dimension : (production * 'a) t t = let hole_parser = (* This must be fold, can't be find *) let open Polymorphic_compare in List.fold ~init:[] Template.Matching.hole_parsers ~f:(fun acc (sort', parser) -> if sort' = sort then parser::acc else acc) in let skip_signal hole = Omega_parser_helper.skip (string "_signal_hole") >>| fun () -> (Hole hole, acc) in match hole_parser with | [] -> fail "none" (* not defined *) | l -> choice l >>| function identifier -> skip_signal { sort; identifier; dimension; at_depth = None } let generate_hole_for_literal dimension ~contents ~left_delimiter ~right_delimiter () = let literal_holes = choice @@ List.map Template.Matching.hole_parsers ~f:(fun (kind, _) -> hole_parser kind dimension) in let reserved_holes = List.map reserved_holes ~f:Omega_parser_helper.skip in let other = Omega_parser_helper.( up_to @@ choice [ (spaces1 *> return ()) ; (choice reserved_holes *> return ()) ] >>| String.of_char_list) in let parser = many @@ choice [ literal_holes ; (spaces1 >>| generate_pure_spaces_parser) ; (other >>| generate_string_token_parser) ] in match parse_string ~consume:All parser contents with | Ok parsers -> sequence_chain' ~left_delimiter ~right_delimiter parsers | Error _ -> failwith "If this failure happens it is a bug: Converting a \ quoted string in the template to a parser list should \ not fail here" let general_parser_generator rule : (production * 'a) t t = let spaces : (production * 'a) t t = lift (fun result -> generate_spaces_parser (String.concat result)) (many1 (comment_parser <|> spaces1)) in let other = (many1 (not_followed_by reserved_parsers *> any_char) >>| String.of_char_list) >>| generate_string_token_parser in let code_holes = Template.Matching.hole_parsers |> List.map ~f:(fun (sort, _) -> hole_parser sort Code) |> choice in fix (fun (generator : (production * 'a) t list t) -> if debug then Format.printf "Descends@."; let nested = if debug then Format.printf "Nested@."; choice @@ List.map Language.Syntax.user_defined_delimiters ~f:(fun (left_delimiter, right_delimiter) -> (string left_delimiter *> generator <* string right_delimiter) >>= fun (g: (production * 'a) t list) -> if debug then Format.printf "G size: %d; delim %s@." (List.length g) left_delimiter; return @@ sequence_chain' @@ [string left_delimiter >>= fun result -> r acc (Template_string result)] @ g @ [ string right_delimiter >>= fun result -> r acc (Template_string result)]) in many @@ choice [ code_holes ; raw_string_literal_parser (generate_hole_for_literal Raw_string_literal ()) ; escapable_string_literal_parser (generate_hole_for_literal Escapable_string_literal ()) ; spaces ; nested ; other ] >>= fun x -> if debug then Format.printf "Produced %d parsers in main generator@." @@ List.length x; return x ) >>| fun p_list -> match p_list with | [] -> (* The template is the empty string and source is nonempty. We need to detect it here or we will always match successfully on empty string and never advance input below. *) r acc Unit | p_list -> p_list |> sequence_chain' |> fun matcher -> match !configuration_ref.match_kind with | Exact -> pos >>= fun start_pos -> if debug then Format.printf "Yes exact@."; matcher >>= fun _access_last_production_here -> pos >>= fun end_pos -> end_of_input >>= fun _ -> if !implicit_equals_match_satisfied then record_match_context start_pos end_pos rule; implicit_equals_match_satisfied := true; (* reset *) current_environment_ref := Match.Environment.create (); r acc Unit | Fuzzy -> let prefix = choice [ comment_parser ; (raw_string_literal_parser (fun ~contents ~left_delimiter:_ ~right_delimiter:_ -> contents)) ; (escapable_string_literal_parser (fun ~contents ~left_delimiter:_ ~right_delimiter:_ -> contents)) ; any_char >>| Char.to_string ] in let match_one = pos >>= fun start_pos -> current_environment_ref := Match.Environment.create (); consumed matcher >>= fun value -> if debug then Format.printf "Full match context result: %s@." value; pos >>= fun end_pos -> let start_pos = if String.length value = 0 then start_pos (*offset + 1 this may not matter, if we correct for the whole match conext *) else start_pos in (if String.length value = 0 then advance 1 else return ()) >>= fun () -> if debug then Format.printf "Calculated end_pos %d@." end_pos; if !implicit_equals_match_satisfied then record_match_context start_pos end_pos rule; implicit_equals_match_satisfied := true; (* reset *) current_environment_ref := Match.Environment.create (); return (Unit, "") in (* many1 may be appropriate *) let prefix = (prefix >>= fun s -> r acc (String s)) in let first_match_attempt = choice [match_one; prefix] in (* consumes a character in prefix if no match *) let matches = many first_match_attempt *> end_of_input in matches >>= fun _result -> r acc Unit let to_template template rule = match parse_string ~consume:All (general_parser_generator rule) template with | Ok p -> Ok p | _ -> Or_error.error_string "Template could not be parsed." let run_the_parser_for_first p source : Match.t Or_error.t = push_source_ref := !source_ref; source_ref := source; match parse_string ~consume:All p source with | Ok _ -> source_ref := !push_source_ref; if rewrite then Format.eprintf "Result string:@.---@.%s---@." @@ Buffer.contents actual; Ok (Match.create ()) (* Fake match result--currently using refs *) | _ -> source_ref := !push_source_ref; Or_error.error_string "No matches" let first_is_broken ?configuration:_ ?shift:_ template source rule : Match.t Or_error.t = match to_template template rule with | Error e -> Error e | Ok p -> begin match run_the_parser_for_first p source with | Ok _ -> (* May have matches, ok to access *) begin match !matches_ref with | [] -> Or_error.error_string "Empty matches" | hd::_ -> Ok hd end | Error e -> (* Matching failed *) Error e end let set_rewrite_template rewrite_template' = rewrite_template := rewrite_template' (** Hardcoded case when template and source are empty string. The parser logic is too tricky for this right now. *) let trivial = let open Match in let open Location in let open Range in let location = { offset = 0 ; line = 1 ; column = 1 } in let range = { match_start = location ; match_end = location } in Match.create ~range () let all ?configuration ?filepath ?(rule = [Types.Ast.True]) ~template ~source:original_source () : Match.t list = filepath_ref := filepath; push_matches_ref := !matches_ref; configuration_ref := Option.value configuration ~default:!configuration_ref; let Rule.{ nested } = Rule.options rule in let template, rule = Preprocess.map_aliases (module Meta) (module Ext) template (Some rule) in let rec aux_all ?configuration ?(nested = false) ~template ~source () = matches_ref := []; if String.is_empty template && String.is_empty source then [trivial] else match first_is_broken template source rule with | Ok _ | Error _ -> let matches = List.rev !matches_ref in if nested then (compute_nested_matches ?configuration ~nested template matches) @ matches else matches and compute_nested_matches ?configuration ?nested template matches = let open Match in let open Range in let rec aux acc matches = match (matches : Match.t list) with | [] -> acc | { environment; _ }::rest -> List.fold ~init:acc (Environment.vars environment) ~f:(fun acc v -> let source_opt = Environment.lookup environment v in match source_opt with | Some source -> let nested_matches = let matches = aux_all ?configuration ?nested ~template ~source () in let { match_start = ms; _ } = Option.value_exn (Environment.lookup_range environment v) in List.map matches ~f:(fun m -> let environment = List.fold (Environment.vars m.environment) ~init:m.environment ~f:(fun env var -> let open Option in let updated : environment option = Environment.lookup_range env var >>| fun r -> let range = { match_start = { r.match_start with offset = ms.offset + r.match_start.offset } ; match_end = { r.match_end with offset = ms.offset + r.match_end.offset } } in Environment.update_range env var range in match updated with | None -> env | Some env -> env) in let range = { match_start = { m.range.match_start with offset = ms.offset + m.range.match_start.offset } ; match_end = { m.range.match_end with offset = ms.offset + m.range.match_end.offset } } in { m with range; environment }) in acc @ nested_matches | _ -> acc) @ aux acc rest in aux [] matches in let result = if nested then let open Match in (* Use sort on offset for a top-down ordering. *) aux_all ?configuration ~nested ~template ~source:original_source () |> List.sort ~compare:(fun left right -> left.range.match_start.offset - right.range.match_start.offset) else (* Don't reverse the list for non-nested matches--it matters for rewriting. *) aux_all ?configuration ~nested ~template ~source:original_source () in matches_ref := !push_matches_ref; result let first ?configuration ?shift:_ ?filepath template source : Match.t Or_error.t = filepath_ref := filepath; configuration_ref := Option.value configuration ~default:!configuration_ref; matches_ref := []; match all ?filepath ?configuration ~template ~source () with | [] -> Or_error.error_string "No result" | (hd::_) -> Ok hd (* FIXME be efficient *) end and Program : sig val apply : ?substitute_in_place:bool -> ?metasyntax:Metasyntax.t -> ?external_handler:External.t -> ?filepath:string -> Rule.t -> Match.environment -> Evaluate.result end = struct let apply ?substitute_in_place ?metasyntax ?external_handler ?filepath rule env = let Rule.{ nested } = Rule.options rule in let subrule = if nested then [Types.Ast.True; Option "nested"] else [Types.Ast.True] in Evaluate.apply ?substitute_in_place ?metasyntax ?external_handler ?filepath ~match_all:(Matcher.all ~rule:subrule) rule env end include Matcher end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>