package GT
Generic programming with extensible transformations
Install
Dune Dependency
Authors
Maintainers
Sources
0.5.1.tar.gz
sha256=fe0aa1e40afd36f7c1fcd992c408261d0b5645cea080ea98bc5dbf0b8682187f
sha512=8db0f2d8db4d7c11cf55835ba2b6c4f5ee1e8c09a4bdc2a9c57d50958ff8654688d4c8596079dfd1027d8b9e878f6e1b0d14341bcdf5f63cf96a45b2a571f3cb
doc/src/GT.syntax/extension.ml.html
Source file extension.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
(************************************************************************** * Copyright (C) 2012-2020 * Dmitri Boulytchev (dboulytchev@math.spbu.ru), St.Petersburg State University * Universitetskii pr., 28, St.Petersburg, 198504, RUSSIA * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with this library; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * * See the GNU Lesser General Public License version 2.1 for more details * (enclosed in the file COPYING). **************************************************************************) [@@@ocaml.warning "-27"] open Pcaml open GTCommon let hdtl loc xs = (List.hd xs, List.tl xs) let trait_proto_t typ trait = Printf.sprintf "%s_proto_%s" trait typ EXTEND GLOBAL: sig_item str_item class_expr class_sig_item expr ctyp type_decl class_expr_simple extended_longident; class_sig_item: [[ "inherit"; cs = class_signature -> <:class_sig_item< inherit $cs$ >> ]]; class_signature: [ [ ci = class_type_longident -> let last, pfx = Camlp5Helpers.sep_last ci in assert (not (Camlp5Helpers.capitalized last)) ; match pfx with [] -> <:class_type< $lid:last$ >> | h::t -> let rec lirec li = function h::t -> lirec <:extended_longident< $longid:li$ . $uid:h$ >> t | [] -> li in let li = lirec <:extended_longident< $uid:h$ >> t in <:class_type< $longid:li$ . $lid:last$ >> ] ] ; class_type_longident: [[ "@"; ci=qname; t=OPT trait -> let n, q = hdtl loc (List.rev ci) in let classname = match t with | None -> Naming.class_name_for_typ n | Some t -> Naming.trait_class_name_for_typ ~trait:t n in List.rev (classname::q) | "+"; ci=qname; t=trait -> let n, q = hdtl loc (List.rev ci) in List.rev ((trait_proto_t t n) :: q) ]] ; class_expr_simple: BEFORE "simple" [[ "["; ct = ctyp; ","; ctcl = LIST1 ctyp SEP ","; "]"; ci = class_longident -> <:class_expr< [ $list:(ct :: ctcl)$ ] $lilongid:ci$ >> | "["; ct = ctyp; "]"; ci = class_longident -> <:class_expr< [ $ct$ ] $lilongid:ci$ >> | ci = class_longident -> <:class_expr< $lilongid:ci$ >> ]]; expr: BEFORE "simple" [ LEFTA [ "new"; i = V class_longident "list" -> <:expr< new $_lilongid:i$ >> ] ]; ctyp: BEFORE "simple" [[ "#"; id = V class_longident "list" -> <:ctyp< # $_lilongid:id$ >> ]]; class_longident: [[ "@"; ci=qname; t=OPT trait -> let n, q = hdtl loc (List.rev ci) in let classname = match t with | None -> Naming.class_name_for_typ n | Some t -> Naming.trait_class_name_for_typ ~trait:t n in Asttools.longident_lident_of_string_list loc (List.rev (classname::q)) | "+"; ci=qname; t=trait -> let n, q = hdtl loc (List.rev ci) in Asttools.longident_lident_of_string_list loc (List.rev ((trait_proto_t n t) :: q)) | ci=qname -> Asttools.longident_lident_of_string_list loc ci ]]; qname: [[ n=LIDENT -> [n] | m=UIDENT; "."; q=SELF -> m :: q ]]; trait: [[ "["; id=LIDENT; "]" -> id ]]; nonrec_: [[ "nonrec" -> () ]]; str_item: LEVEL "top" [[ "@"; "type"; nonrec_=(OPT nonrec_); t=LIST1 t_decl SEP "and" -> Core2.generate_str (Option.is_some nonrec_) t loc ]]; sig_item: LEVEL "top" [[ "@"; "type"; nonrec_=(OPT nonrec_); t=LIST1 t_decl SEP "and" -> Core2.generate_sig (Option.is_some nonrec_) t loc ]]; t_decl: [[ "["; t=type_decl; "]" -> t, [] | t=type_decl; d=OPT deriving -> (* t, [tdecl_to_descr loc t, match d with None -> [] | Some d -> d] *) t, (match d with None -> [] | Some d -> d) ]]; deriving: [["with"; s=LIST1 LIDENT SEP "," -> s]]; END;
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>