package tip-parser
Parser for https://tip-org.github.io/format.html
Install
Dune Dependency
Authors
Maintainers
Sources
0.6.tar.gz
md5=67037b4d8b95c661cab061a5686be2d1
sha512=696154e0b1ab5f28b39889dec1f877b48087652be2f5706010a9b9645f577f7a5f58b61e241e29837923fb691d7963a7487bce1331b973f03ba0785464b60175
doc/src/tip-parser/Tip_ast.ml.html
Source file Tip_ast.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
(* This file is free software. See file "license" for more details. *) (** {1 Trivial AST for parsing} *) let pp_to_string pp x = Format.asprintf "%a@?" pp x module Loc = Tip_loc type var = string type ty_var = string (** Polymorphic types *) type ty = | Ty_bool | Ty_app of ty_var * ty list | Ty_arrow of ty list * ty type typed_var = var * ty (** {2 AST: S-expressions with locations} *) type term = | True | False | Const of string | App of string * term list | HO_app of term * term (* higher-order application *) | Match of term * match_branch list | If of term * term * term | Let of (var * term) list * term | Is_a of string * term (* tester: is-constructor(term) *) | Fun of typed_var * term | Eq of term * term | Imply of term * term | And of term list | Or of term list | Not of term | Distinct of term list | Cast of term * ty (* type cast *) | Forall of (var * ty) list * term | Exists of (var * ty) list * term and match_branch = | Match_default of term | Match_case of string * var list * term type cstor = { cstor_name: string; cstor_args: (string * ty) list; (* selector+type *) } type 'arg fun_decl = { fun_ty_vars: ty_var list; fun_name: string; fun_args: 'arg list; fun_ret: ty; } type fun_def = { fr_decl: typed_var fun_decl; fr_body: term; } type funs_rec_def = { fsr_decls: typed_var fun_decl list; fsr_bodies: term list; } type statement = { stmt: stmt; loc: Loc.t option; } and stmt = | Stmt_set_logic of string | Stmt_set_info of string * string | Stmt_decl_sort of string * int (* arity *) | Stmt_decl of ty fun_decl | Stmt_fun_def of fun_def | Stmt_fun_rec of fun_def | Stmt_funs_rec of funs_rec_def | Stmt_data of ty_var list * (string * cstor list) list | Stmt_assert of term | Stmt_lemma of term | Stmt_assert_not of ty_var list * term | Stmt_prove of ty_var list * term | Stmt_check_sat | Stmt_exit let ty_bool = Ty_bool let ty_app s l = Ty_app (s,l) let ty_const s = ty_app s [] let ty_arrow_l args ret = if args=[] then ret else Ty_arrow (args, ret) let ty_arrow a b = ty_arrow_l [a] b let true_ = True let false_ = False let const s = Const s let app f l = App (f,l) let ho_app a b = HO_app (a,b) let ho_app_l a l = List.fold_left ho_app a l let match_ u l = Match (u,l) let if_ a b c = If(a,b,c) let fun_ v t = Fun (v,t) let fun_l = List.fold_right fun_ let let_ l t = Let (l,t) let eq a b = Eq (a,b) let imply a b = Imply(a,b) let is_a c t = Is_a (c,t) let and_ l = And l let or_ l = Or l let distinct l = Distinct l let cast t ~ty = Cast (t, ty) let forall vars f = match vars with [] -> f | _ -> Forall (vars, f) let exists vars f = match vars with [] -> f | _ -> Exists (vars, f) let rec not_ t = match t with | Forall (vars,u) -> exists vars (not_ u) | Exists (vars,u) -> forall vars (not_ u) | _ -> Not t let _mk ?loc stmt = { loc; stmt } let mk_cstor name l : cstor = { cstor_name=name; cstor_args=l } let mk_fun_decl ~ty_vars f args ret = { fun_ty_vars=ty_vars; fun_name=f; fun_args=args; fun_ret=ret; } let mk_fun_rec ~ty_vars f args ret body = { fr_decl=mk_fun_decl ~ty_vars f args ret; fr_body=body; } let decl_sort ?loc s ~arity = _mk ?loc (Stmt_decl_sort (s, arity)) let decl_fun ?loc ~tyvars f ty_args ty_ret = let d = {fun_ty_vars=tyvars; fun_name=f; fun_args=ty_args; fun_ret=ty_ret} in _mk ?loc (Stmt_decl d) let fun_def ?loc fr = _mk ?loc (Stmt_fun_def fr) let fun_rec ?loc fr = _mk ?loc (Stmt_fun_rec fr) let funs_rec ?loc decls bodies = _mk ?loc (Stmt_funs_rec {fsr_decls=decls; fsr_bodies=bodies}) let data ?loc tyvars l = _mk ?loc (Stmt_data (tyvars,l)) let assert_ ?loc t = _mk ?loc (Stmt_assert t) let lemma ?loc t = _mk ?loc (Stmt_lemma t) let assert_not ?loc ~ty_vars t = _mk ?loc (Stmt_assert_not (ty_vars, t)) let prove ?loc ~ty_vars t = _mk ?loc (Stmt_prove (ty_vars, t)) let check_sat ?loc () = _mk ?loc Stmt_check_sat let exit ?loc () = _mk ?loc Stmt_exit let set_logic ?loc l = _mk ?loc @@ Stmt_set_logic l let set_info ?loc a b = _mk ?loc @@ Stmt_set_info (a,b) let loc t = t.loc let view t = t.stmt let fpf = Format.fprintf let pp_list pp out l = let rec aux l = match l with | x::((_::_) as l) -> pp out x; Format.fprintf out "@ "; aux l | x::[] -> pp out x | [] -> () in aux l let pp_str out s = Format.pp_print_string out s let pp_tyvar = pp_str let rec pp_ty out (ty:ty) = match ty with | Ty_bool -> pp_str out "Bool" | Ty_app (s,[]) -> pp_str out s | Ty_app (s,l) -> Format.fprintf out "(@[<hv1>%s@ %a@])" s (pp_list pp_ty) l | Ty_arrow (args,ret) -> fpf out "(@[=>@ %a@ %a@])" (pp_list pp_ty) args pp_ty ret let lvl_top = 0 let lvl_q = 10 let lvl_let = 20 let lvl_match = 25 let lvl_and = 30 let lvl_or = 31 let lvl_not = 32 let lvl_app = 50 let rec pp_term lvl out (t:term) = let self = pp_term lvl in let self' lvl' = pp_term lvl' in let self_a = self' lvl_app in let pp_binding out (v,t) = fpf out "(@[%s@ %a@])" v (self' lvl_let) t in let fpf' lvl' out fmt = if lvl <> lvl' then ( fpf out "(@[" ) else ( fpf out "(" ); Format.kfprintf (fun out -> if lvl <> lvl' then fpf out "@])" else fpf out ")") out fmt in match t with | True -> pp_str out "true" | False -> pp_str out "false" | Const s -> pp_str out s | App (f,l) -> fpf' lvl_app out "%s@ %a" f (pp_list self_a) l | HO_app (a,b) -> fpf' lvl_app out "@@@ %a@ %a" (self' lvl_app) a (self' lvl_app) b | Match (lhs,cases) -> let pp_case out = function | Match_default rhs -> fpf out "(@[<1>default@ %a@])" (self' lvl_match) rhs | Match_case (c,[],rhs) -> fpf out "(@[<1>case %s@ %a@])" c (self' lvl_match) rhs | Match_case (c,vars,rhs) -> fpf out "(@[<1>case@ (@[%s@ %a@])@ %a@])" c (pp_list pp_str) vars (self' lvl_match) rhs in fpf' lvl_match out "match@ %a@ @[<v>%a@]" (self' lvl_top) lhs (pp_list pp_case) cases | If (a,b,c) -> fpf' lvl_app out "ite %a@ %a@ %a" self_a a self_a b self_a c | Fun (v,body) -> fpf' lvl_q out "lambda @ (%a)@ %a" pp_typed_var v (self' lvl_q) body | Let (l,t) -> fpf' lvl_let out "let@ (@[%a@])@ %a" (pp_list pp_binding) l (self' lvl_let) t | Is_a (c,t) -> fpf out "(@[is-%s@ %a@])" c self t | Eq (a,b) -> fpf out "(@[=@ %a@ %a@])" self a self b | Imply (a,b) -> fpf' lvl_or out "=>@ %a@ %a" (self' lvl_or) a (self' lvl_or) b | And l -> fpf' lvl_and out "and@ %a" (pp_list @@ self' lvl_and) l | Or l -> fpf' lvl_or out "or@ %a" (pp_list @@ self' lvl_or) l | Not t -> fpf' lvl_not out "not@ %a" (self' lvl_not) t | Distinct l -> fpf out "(@[distinct@ %a@])" (pp_list self) l | Cast (t, ty) -> fpf out "(@[<hv>as@ @[%a@]@ @[%a@]@])" self t pp_ty ty | Forall (vars,f) -> fpf' lvl_q out "forall@ (@[%a@])@ %a" (pp_list pp_typed_var) vars (self' lvl_q) f | Exists (vars,f) -> fpf' lvl_q out "exists@ (@[%a@])@ %a" (pp_list pp_typed_var) vars (self' lvl_q) f and pp_typed_var out (v,ty) = fpf out "(@[%s@ %a@])" v pp_ty ty let pp_term out t = pp_term lvl_top out t let pp_par pp_x out (ty_vars,x) = match ty_vars with | [] -> pp_x out x | _ -> fpf out "(@[par (@[%a@])@ (%a)@])" (pp_list pp_tyvar) ty_vars pp_x x let pp_fun_decl pp_arg out fd = fpf out "%s@ (@[%a@])@ %a" fd.fun_name (pp_list pp_arg) fd.fun_args pp_ty fd.fun_ret let pp_fr out fr = fpf out "@[<2>%a@ %a@]" (pp_fun_decl pp_typed_var) fr.fr_decl pp_term fr.fr_body let pp_stmt out (st:statement) = match view st with | Stmt_exit -> fpf out "(exit)" | Stmt_set_info (a,b) -> fpf out "(@[set-info@ %a@ %a@])" pp_str a pp_str b | Stmt_set_logic s -> fpf out "(@[set-logic@ %a@])" pp_str s | Stmt_decl_sort (s,n) -> fpf out "(@[declare-sort@ %s %d@])" s n | Stmt_assert t -> fpf out "(@[assert@ %a@])" pp_term t | Stmt_lemma t -> fpf out "(@[lemma@ %a@])" pp_term t | Stmt_assert_not (ty_vars,t) -> fpf out "(@[assert-not@ %a@])" (pp_par pp_term) (ty_vars,t) | Stmt_prove (ty_vars,t) -> fpf out "(@[prove@ %a@])" (pp_par pp_term) (ty_vars,t) | Stmt_decl d -> fpf out "(@[declare-fun@ %a@])" (pp_par (pp_fun_decl pp_ty)) (d.fun_ty_vars,d) | Stmt_fun_def fr -> fpf out "(@[<2>define-fun@ %a@])" (pp_par pp_fr) (fr.fr_decl.fun_ty_vars, fr) | Stmt_fun_rec fr -> fpf out "(@[<2>define-fun-rec@ %a@])" (pp_par pp_fr) (fr.fr_decl.fun_ty_vars, fr) | Stmt_funs_rec fsr -> let pp_decl' out d = fpf out "(@[<2>%a@])" (pp_fun_decl pp_typed_var) d in fpf out "(@[<hv2>define-funs-rec@ (@[<v>%a@])@ (@[<v>%a@])@])" (pp_list pp_decl') fsr.fsr_decls (pp_list pp_term) fsr.fsr_bodies | Stmt_data (tyvars,l) -> let pp_cstor_arg out (sel,ty) = fpf out "(@[%s %a@])" sel pp_ty ty in let pp_cstor out c = if c.cstor_args = [] then fpf out "(%s)" c.cstor_name else fpf out "(@[<1>%s@ %a@])" c.cstor_name (pp_list pp_cstor_arg) c.cstor_args in let pp_data out (s,cstors) = fpf out "(@[<2>%s@ @[<v>%a@]@])" s (pp_list pp_cstor) cstors in fpf out "(@[<hv2>declare-datatypes@ (@[%a@])@ (@[<v>%a@])@])" (pp_list pp_tyvar) tyvars (pp_list pp_data) l | Stmt_check_sat -> fpf out "(check-sat)" (** {2 Errors} *) exception Parse_error of Loc.t option * string let () = Printexc.register_printer (function | Parse_error (loc, msg) -> let pp out () = Format.fprintf out "parse error at %a:@ %s" Loc.pp_opt loc msg in Some (pp_to_string pp ()) | _ -> None) let parse_error ?loc msg = raise (Parse_error (loc, msg)) let parse_errorf ?loc msg = Format.ksprintf (parse_error ?loc) msg
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>