1 (* Copyright (C) 2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
30 module Ast = CicNotationPt
31 module Env = CicNotationEnv
33 exception Parse_error of string
34 exception Level_not_found of int
36 let level1_pattern_grammar =
37 Grammar.gcreate CicNotationLexer.level1_pattern_lexer
38 let level2_ast_grammar = Grammar.gcreate CicNotationLexer.level2_ast_lexer
39 let level2_meta_grammar = Grammar.gcreate CicNotationLexer.level2_meta_lexer
41 let min_precedence = 0
42 let max_precedence = 100
45 Grammar.Entry.create level1_pattern_grammar "level1_pattern"
46 let level2_ast = Grammar.Entry.create level2_ast_grammar "level2_ast"
47 let term = Grammar.Entry.create level2_ast_grammar "term"
48 let let_defs = Grammar.Entry.create level2_ast_grammar "let_defs"
49 let protected_binder_vars = Grammar.Entry.create level2_ast_grammar "protected_binder_vars"
50 let level2_meta = Grammar.Entry.create level2_meta_grammar "level2_meta"
54 Pervasives.int_of_string s
56 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
58 (** {2 Grammar extension} *)
60 let level_of precedence =
61 if precedence < min_precedence || precedence > max_precedence then
62 raise (Level_not_found precedence);
63 string_of_int precedence
65 let gram_symbol s = Gramext.Stoken ("SYMBOL", s)
66 let gram_ident s = Gramext.Stoken ("IDENT", s)
67 let gram_number s = Gramext.Stoken ("NUMBER", s)
68 let gram_keyword s = Gramext.Stoken ("", s)
69 let gram_term = function
70 | Ast.Self _ -> Gramext.Sself
71 | Ast.Level precedence ->
73 (Grammar.Entry.obj (term: 'a Grammar.Entry.e), level_of precedence)
78 | `Symbol s -> gram_symbol s
79 | `Keyword s -> gram_keyword s
80 | `Number s -> gram_number s
84 | Binding of string * Env.value_type
85 | Env of (string * Env.value_type) list
87 let make_action action bindings =
88 let rec aux (vl : CicNotationEnv.t) =
90 [] -> Gramext.action (fun (loc: Ast.location) -> action vl loc)
91 | NoBinding :: tl -> Gramext.action (fun _ -> aux vl tl)
92 (* LUCA: DEFCON 3 BEGIN *)
93 | Binding (name, Env.TermType l) :: tl ->
96 aux ((name, (Env.TermType l, Env.TermValue v))::vl) tl)
97 | Binding (name, Env.StringType) :: tl ->
100 aux ((name, (Env.StringType, Env.StringValue v)) :: vl) tl)
101 | Binding (name, Env.NumType) :: tl ->
104 aux ((name, (Env.NumType, Env.NumValue v)) :: vl) tl)
105 | Binding (name, Env.OptType t) :: tl ->
107 (fun (v:'a option) ->
108 aux ((name, (Env.OptType t, Env.OptValue v)) :: vl) tl)
109 | Binding (name, Env.ListType t) :: tl ->
112 aux ((name, (Env.ListType t, Env.ListValue v)) :: vl) tl)
114 Gramext.action (fun (v:CicNotationEnv.t) -> aux (v @ vl) tl)
115 (* LUCA: DEFCON 3 END *)
117 aux [] (List.rev bindings)
123 | NoBinding :: tl -> aux acc tl
124 | Env names :: tl -> aux (List.rev names @ acc) tl
125 | Binding (name, ty) :: tl -> aux ((name, ty) :: acc) tl
129 (* given a level 1 pattern computes the new RHS of "term" grammar entry *)
130 let extract_term_production pattern =
131 let rec aux = function
132 | Ast.AttributedTerm (_, t) -> aux t
133 | Ast.Literal l -> aux_literal l
134 | Ast.Layout l -> aux_layout l
135 | Ast.Magic m -> aux_magic m
136 | Ast.Variable v -> aux_variable v
138 prerr_endline (CicNotationPp.pp_term t);
142 | `Symbol s -> [NoBinding, gram_symbol s]
144 (* assumption: s will be registered as a keyword with the lexer *)
145 [NoBinding, gram_keyword s]
146 | `Number s -> [NoBinding, gram_number s]
147 and aux_layout = function
148 | Ast.Sub (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sub"] @ aux p2
149 | Ast.Sup (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sup"] @ aux p2
150 | Ast.Below (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\below"] @ aux p2
151 | Ast.Above (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\above"] @ aux p2
152 | Ast.Frac (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\frac"] @ aux p2
153 | Ast.Atop (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\atop"] @ aux p2
154 | Ast.Over (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\over"] @ aux p2
155 | Ast.Root (p1, p2) ->
156 [NoBinding, gram_symbol "\\root"] @ aux p2
157 @ [NoBinding, gram_symbol "\\of"] @ aux p1
158 | Ast.Sqrt p -> [NoBinding, gram_symbol "\\sqrt"] @ aux p
160 | Ast.Box (_, pl) -> List.flatten (List.map aux pl)
161 | Ast.Group pl -> List.flatten (List.map aux pl)
162 and aux_magic magic =
165 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
166 let action (env_opt : CicNotationEnv.t option) (loc : Ast.location) =
168 | Some env -> List.map Env.opt_binding_some env
169 | None -> List.map Env.opt_binding_of_name p_names
171 [ Env (List.map Env.opt_declaration p_names),
173 [ [ Gramext.Sopt (Gramext.srules [ p_atoms, p_action ]) ],
174 Gramext.action action ] ]
176 | Ast.List1 (p, _) ->
177 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
178 let action (env_list : CicNotationEnv.t list) (loc : Ast.location) =
179 CicNotationEnv.coalesce_env p_names env_list
183 | Ast.List0 (_, None) -> Gramext.Slist0 s
184 | Ast.List1 (_, None) -> Gramext.Slist1 s
185 | Ast.List0 (_, Some l) -> Gramext.Slist0sep (s, gram_of_literal l)
186 | Ast.List1 (_, Some l) -> Gramext.Slist1sep (s, gram_of_literal l)
189 [ Env (List.map Env.list_declaration p_names),
191 [ [ gram_of_list (Gramext.srules [ p_atoms, p_action ]) ],
192 Gramext.action action ] ]
196 | Ast.NumVar s -> [Binding (s, Env.NumType), gram_number ""]
197 | Ast.TermVar (s,(Ast.Self level|Ast.Level level as lv)) ->
198 [Binding (s, Env.TermType level), gram_term lv]
199 | Ast.IdentVar s -> [Binding (s, Env.StringType), gram_ident ""]
200 | Ast.Ascription (p, s) -> assert false (* TODO *)
201 | Ast.FreshVar _ -> assert false
202 and inner_pattern p =
203 let p_bindings, p_atoms = List.split (aux p) in
204 let p_names = flatten_opt p_bindings in
206 make_action (fun (env : CicNotationEnv.t) (loc : Ast.location) -> env)
209 p_bindings, p_atoms, p_names, action
213 type rule_id = Grammar.token Gramext.g_symbol list
215 (* mapping: rule_id -> owned keywords. (rule_id, string list) Hashtbl.t *)
216 let owned_keywords = Hashtbl.create 23
218 type checked_l1_pattern = CL1P of CicNotationPt.term * int
220 let check_l1_pattern level1_pattern level associativity =
221 let variables = ref 0 in
222 let symbols = ref 0 in
223 let rec aux = function
224 | Ast.AttributedTerm (att, t) -> Ast.AttributedTerm (att,aux t)
225 | Ast.Literal _ as l -> incr symbols; l
226 | Ast.Layout l -> Ast.Layout (aux_layout l)
227 | Ast.Magic m -> Ast.Magic (aux_magic m)
228 | Ast.Variable v -> (aux_variable v)
230 and aux_layout = function
231 | Ast.Sub (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sub (p1, p2)
232 | Ast.Sup (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sup (p1, p2)
233 | Ast.Below (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Below (p1, p2)
234 | Ast.Above (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Above (p1, p2)
235 | Ast.Frac (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Frac (p1, p2)
236 | Ast.Atop (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Atop (p1, p2)
237 | Ast.Over (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Over (p1, p2)
238 | Ast.Root (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Root (p1, p2)
239 | Ast.Sqrt p -> Ast.Sqrt (aux p)
240 | Ast.Break as t -> t
241 | Ast.Box (b, pl) -> Ast.Box(b, List.map aux pl)
242 | Ast.Group pl -> Ast.Group (List.map aux pl)
243 and aux_magic magic =
245 | Ast.Opt p -> Ast.Opt (aux p)
246 | Ast.List0 (p, x) -> Ast.List0 (aux p, x)
247 | Ast.List1 (p, x) -> Ast.List1 (aux p, x)
251 | Ast.NumVar _ as t -> Ast.Variable t
252 | Ast.TermVar (s,Ast.Self _) when associativity <> Gramext.NonA ->
254 if !variables > 2 then
255 raise (Parse_error ("Exactly 2 variables must be specified in an "^
256 "associative notation"));
257 (match !variables, associativity with
259 Ast.Variable (Ast.TermVar (s, Ast.Self level))
260 | 1,Gramext.RightA ->
261 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
263 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
264 | 2,Gramext.RightA ->
265 Ast.Variable (Ast.TermVar (s, Ast.Level (level-1)))
267 | Ast.TermVar (s,Ast.Level _) when associativity <> Gramext.NonA ->
268 raise (Parse_error ("Variables can not be declared with a " ^
269 "precedence in an associative notation"))
270 (*avoid camlp5 divergence due to non-Sself recursion at the same level *)
271 | Ast.TermVar (s,Ast.Level l) when l<=level && !variables=0 && !symbols=0->
272 raise(Parse_error("Left recursive rule with precedence not greater " ^
273 "than " ^ string_of_int level ^ " is not allowed to avoid divergence"))
274 | Ast.TermVar _ as t -> incr variables; Ast.Variable t
275 | Ast.IdentVar _ as t -> Ast.Variable t
276 | Ast.Ascription _ -> assert false (* TODO *)
277 | Ast.FreshVar _ -> assert false
279 if associativity <> Gramext.NonA && level = min_precedence then
280 raise (Parse_error ("You can not specify an associative notation " ^
281 "at level "^string_of_int min_precedence ^ "; increase it"));
282 let cp = aux level1_pattern in
283 (* prerr_endline ("checked_pattern: " ^ CicNotationPp.pp_term cp); *)
284 if !variables <> 2 && associativity <> Gramext.NonA then
285 raise (Parse_error ("Exactly 2 variables must be specified in an "^
286 "associative notation"));
290 let extend (CL1P (level1_pattern,precedence)) action =
291 let p_bindings, p_atoms =
292 List.split (extract_term_production level1_pattern)
294 let level = level_of precedence in
297 [ Grammar.Entry.obj (term: 'a Grammar.Entry.e),
298 Some (Gramext.Level level),
300 Some (*Gramext.NonA*) Gramext.NonA,
303 (fun (env: CicNotationEnv.t) (loc: Ast.location) ->
307 let keywords = CicNotationUtil.keywords_of_term level1_pattern in
308 let rule_id = p_atoms in
309 List.iter CicNotationLexer.add_level2_ast_keyword keywords;
310 Hashtbl.add owned_keywords rule_id keywords; (* keywords may be [] *)
314 let atoms = rule_id in
316 let keywords = Hashtbl.find owned_keywords rule_id in
317 List.iter CicNotationLexer.remove_level2_ast_keyword keywords
318 with Not_found -> assert false);
319 Grammar.delete_rule term atoms
323 let parse_level1_pattern_ref = ref (fun _ _ -> assert false)
324 let parse_level2_ast_ref = ref (fun _ -> assert false)
325 let parse_level2_meta_ref = ref (fun _ -> assert false)
327 let fold_cluster binder terms ty body =
329 (fun term body -> Ast.Binder (binder, (term, ty), body))
330 terms body (* terms are names: either Ident or FreshVar *)
332 let fold_exists terms ty body =
335 let lambda = Ast.Binder (`Lambda, (term, ty), body) in
336 Ast.Appl [ Ast.Symbol ("exists", 0); lambda ])
339 let fold_binder binder pt_names body =
341 (fun (names, ty) body -> fold_cluster binder names ty body)
344 let return_term loc term = Ast.AttributedTerm (`Loc loc, term)
345 let return_term_of_level loc term l =
346 Ast.AttributedTerm (`Loc loc, term l)
348 (* create empty precedence level for "term" *)
351 Gramext.action (fun _ ->
352 failwith "internal error, lexer generated a dummy token")
354 (* Needed since campl4 on "delete_rule" remove the precedence level if it gets
355 * empty after the deletion. The lexer never generate the Stoken below. *)
356 let dummy_prod = [ [ Gramext.Stoken ("DUMMY", "") ], dummy_action ] in
357 let mk_level_list first last =
358 let rec aux acc = function
359 | i when i < first -> acc
362 ((Some (level_of i), Some Gramext.NonA, dummy_prod)
369 [ Grammar.Entry.obj (term: 'a Grammar.Entry.e),
371 mk_level_list min_precedence max_precedence ]
373 (* {{{ Grammar for concrete syntax patterns, notation level 1 *)
375 GLOBAL: level1_pattern;
378 [ p = l1_pattern; EOI -> fun l -> CicNotationUtil.boxify (p l) ]
381 [ p = LIST1 l1_simple_pattern ->
382 fun l -> List.map (fun x -> x l) p ]
385 [ s = SYMBOL -> `Symbol s
386 | k = QKEYWORD -> `Keyword k
387 | n = NUMBER -> `Number n
390 sep: [ [ "sep"; sep = literal -> sep ] ];
392 [ "list0"; p = l1_simple_pattern; sep = OPT sep ->
393 fun l -> Ast.List0 (p l, sep)
394 | "list1"; p = l1_simple_pattern; sep = OPT sep ->
395 fun l -> Ast.List1 (p l, sep)
396 | "opt"; p = l1_simple_pattern -> fun l -> Ast.Opt (p l)
399 l1_pattern_variable: [
400 [ "term"; precedence = NUMBER; id = IDENT ->
401 Ast.TermVar (id, Ast.Level (int_of_string precedence))
402 | "number"; id = IDENT -> Ast.NumVar id
403 | "ident"; id = IDENT -> Ast.IdentVar id
408 [ p1 = SELF; SYMBOL "\\sub"; p2 = SELF ->
409 return_term_of_level loc
410 (fun l -> Ast.Layout (Ast.Sub (p1 l, p2 l)))
411 | p1 = SELF; SYMBOL "\\sup"; p2 = SELF ->
412 return_term_of_level loc
413 (fun l -> Ast.Layout (Ast.Sup (p1 l, p2 l)))
414 | p1 = SELF; SYMBOL "\\below"; p2 = SELF ->
415 return_term_of_level loc
416 (fun l -> Ast.Layout (Ast.Below (p1 l, p2 l)))
417 | p1 = SELF; SYMBOL "\\above"; p2 = SELF ->
418 return_term_of_level loc
419 (fun l -> Ast.Layout (Ast.Above (p1 l, p2 l)))
420 | p1 = SELF; SYMBOL "\\over"; p2 = SELF ->
421 return_term_of_level loc
422 (fun l -> Ast.Layout (Ast.Over (p1 l, p2 l)))
423 | p1 = SELF; SYMBOL "\\atop"; p2 = SELF ->
424 return_term_of_level loc
425 (fun l -> Ast.Layout (Ast.Atop (p1 l, p2 l)))
426 | SYMBOL "\\frac"; p1 = SELF; p2 = SELF ->
427 return_term_of_level loc
428 (fun l -> Ast.Layout (Ast.Frac (p1 l, p2 l)))
429 | SYMBOL "\\sqrt"; p = SELF ->
430 return_term_of_level loc (fun l -> Ast.Layout (Ast.Sqrt p l))
431 | SYMBOL "\\root"; index = SELF; SYMBOL "\\of"; arg = SELF ->
432 return_term_of_level loc
433 (fun l -> Ast.Layout (Ast.Root (arg l, index l)))
434 | "hbox"; LPAREN; p = l1_pattern; RPAREN ->
435 return_term_of_level loc
436 (fun l -> Ast.Layout (Ast.Box ((Ast.H, false, false), p l)))
437 | "vbox"; LPAREN; p = l1_pattern; RPAREN ->
438 return_term_of_level loc
439 (fun l -> Ast.Layout (Ast.Box ((Ast.V, false, false), p l)))
440 | "hvbox"; LPAREN; p = l1_pattern; RPAREN ->
441 return_term_of_level loc
442 (fun l -> Ast.Layout (Ast.Box ((Ast.HV, false, false), p l)))
443 | "hovbox"; LPAREN; p = l1_pattern; RPAREN ->
444 return_term_of_level loc
445 (fun l -> Ast.Layout (Ast.Box ((Ast.HOV, false, false), p l)))
446 | "break" -> return_term_of_level loc (fun _ -> Ast.Layout Ast.Break)
447 | LPAREN; p = l1_pattern; RPAREN ->
448 return_term_of_level loc (fun l -> CicNotationUtil.group (p l))
452 return_term_of_level loc
453 (fun l -> Ast.Variable (Ast.TermVar (i,Ast.Self l)))
454 | m = l1_magic_pattern ->
455 return_term_of_level loc (fun l -> Ast.Magic (m l))
456 | v = l1_pattern_variable ->
457 return_term_of_level loc (fun _ -> Ast.Variable v)
458 | l = literal -> return_term_of_level loc (fun _ -> Ast.Literal l)
464 (* {{{ Grammar for ast magics, notation level 2 *)
468 [ "term"; precedence = NUMBER; id = IDENT ->
469 Ast.TermVar (id,Ast.Level (int_of_string precedence))
470 | "number"; id = IDENT -> Ast.NumVar id
471 | "ident"; id = IDENT -> Ast.IdentVar id
472 | "fresh"; id = IDENT -> Ast.FreshVar id
473 | "anonymous" -> Ast.TermVar ("_",Ast.Self 0) (* is the level relevant?*)
474 | id = IDENT -> Ast.TermVar (id,Ast.Self 0)
478 [ "fold"; kind = [ "left" -> `Left | "right" -> `Right ];
479 base = level2_meta; "rec"; id = IDENT; recursive = level2_meta ->
480 Ast.Fold (kind, base, [id], recursive)
481 | "default"; some = level2_meta; none = level2_meta ->
482 Ast.Default (some, none)
483 | "if"; p_test = level2_meta;
484 "then"; p_true = level2_meta;
485 "else"; p_false = level2_meta ->
486 Ast.If (p_test, p_true, p_false)
491 [ magic = l2_magic -> Ast.Magic magic
492 | var = l2_variable -> Ast.Variable var
493 | blob = UNPARSED_AST ->
494 !parse_level2_ast_ref (Ulexing.from_utf8_string blob)
500 (* {{{ Grammar for ast patterns, notation level 2 *)
502 GLOBAL: level2_ast term let_defs protected_binder_vars;
503 level2_ast: [ [ p = term -> p ] ];
507 | "Type" -> `Type (CicUniv.fresh ())
508 | "CProp" -> `CProp (CicUniv.fresh ())
512 [ SYMBOL "\\subst"; (* to avoid catching frequent "a [1]" cases *)
515 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
522 [ s = SYMBOL "_" -> None
523 | p = term -> Some p ]
526 [ SYMBOL "["; substs = LIST0 meta_subst; SYMBOL "]" -> substs ]
528 possibly_typed_name: [
529 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
531 | arg = single_arg -> arg, None
532 | SYMBOL "_" -> Ast.Ident ("_", None), None
533 | LPAREN; SYMBOL "_"; SYMBOL ":"; typ = term; RPAREN ->
534 Ast.Ident ("_", None), Some typ
538 [ id = IDENT -> Ast.Pattern (id, None, [])
539 | LPAREN; id = IDENT; vars = LIST1 possibly_typed_name; RPAREN ->
540 Ast.Pattern (id, None, vars)
541 | id = IDENT; vars = LIST1 possibly_typed_name ->
542 Ast.Pattern (id, None, vars)
543 | SYMBOL "_" -> Ast.Wildcard
547 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
548 (* | SYMBOL <:unicode<exists>> |+ ∃ +| -> `Exists *)
549 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall
550 | SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda
554 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
555 SYMBOL ":"; ty = term; RPAREN ->
556 List.map (fun n -> Ast.Ident (n, None)) names, Some ty
557 | name = IDENT -> [Ast.Ident (name, None)], None
558 | blob = UNPARSED_META ->
559 let meta = !parse_level2_meta_ref (Ulexing.from_utf8_string blob) in
561 | Ast.Variable (Ast.FreshVar _) -> [meta], None
562 | Ast.Variable (Ast.TermVar ("_",_)) -> [Ast.Ident ("_", None)], None
563 | _ -> failwith "Invalid bound name."
567 [ name = IDENT -> Ast.Ident (name, None)
568 | blob = UNPARSED_META ->
569 let meta = !parse_level2_meta_ref (Ulexing.from_utf8_string blob) in
571 | Ast.Variable (Ast.FreshVar _)
572 | Ast.Variable (Ast.IdentVar _) -> meta
573 | Ast.Variable (Ast.TermVar ("_",_)) -> Ast.Ident ("_", None)
574 | _ -> failwith "Invalid index name."
581 index_name = OPT [ "on"; id = single_arg -> id ];
582 ty = OPT [ SYMBOL ":" ; p = term -> p ];
583 SYMBOL <:unicode<def>> (* ≝ *); body = term ->
584 let rec position_of name p = function
586 | n :: _ when n = name -> Some p, p
587 | _ :: tl -> position_of name (p + 1) tl
589 let rec find_arg name n = function
591 Ast.fail loc (sprintf "Argument %s not found"
592 (CicNotationPp.pp_term name))
594 (match position_of name 0 l with
595 | None, len -> find_arg name (n + len) tl
596 | Some where, len -> n + where)
599 match index_name with
601 | Some index_name -> find_arg index_name 0 args
606 (function (names,ty) -> List.map (function x -> x,ty) names
609 args, (name, ty), body, index
616 l = LIST1 single_arg SEP SYMBOL "," -> l
617 | SYMBOL "_" -> [Ast.Ident ("_", None)] ];
618 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
621 protected_binder_vars: [
622 [ LPAREN; vars = binder_vars; RPAREN -> vars
625 maybe_protected_binder_vars: [
626 [ vars = binder_vars -> vars
627 | vars = protected_binder_vars -> vars
632 [ "let"; var = possibly_typed_name; SYMBOL <:unicode<def>> (* ≝ *);
633 p1 = term; "in"; p2 = term ->
634 return_term loc (Ast.LetIn (var, p1, p2))
635 | LETCOREC; defs = let_defs; "in";
637 return_term loc (Ast.LetRec (`CoInductive, defs, body))
638 | LETREC; defs = let_defs; "in";
640 return_term loc (Ast.LetRec (`Inductive, defs, body))
645 [ b = binder; (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term LEVEL "19" ->
646 return_term loc (fold_cluster b vars typ body)
647 | SYMBOL <:unicode<exists>> (* ∃ *);
648 (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term LEVEL "19"->
649 return_term loc (fold_exists vars typ body)
654 [ p1 = term; p2 = term LEVEL "71" ->
655 let rec aux = function
656 | Ast.Appl (hd :: tl)
657 | Ast.AttributedTerm (_, Ast.Appl (hd :: tl)) ->
661 return_term loc (Ast.Appl (aux p1 @ [p2]))
666 [ id = IDENT -> return_term loc (Ast.Ident (id, None))
667 | id = IDENT; s = explicit_subst ->
668 return_term loc (Ast.Ident (id, Some s))
669 | s = CSYMBOL -> return_term loc (Ast.Symbol (s, 0))
670 | u = URI -> return_term loc (Ast.Uri (u, None))
671 | n = NUMBER -> return_term loc (Ast.Num (n, 0))
672 | IMPLICIT -> return_term loc (Ast.Implicit)
673 | PLACEHOLDER -> return_term loc Ast.UserInput
674 | m = META -> return_term loc (Ast.Meta (int_of_string m, []))
675 | m = META; s = meta_substs ->
676 return_term loc (Ast.Meta (int_of_string m, s))
677 | s = sort -> return_term loc (Ast.Sort s)
679 indty_ident = OPT [ "in"; id = IDENT -> id, None ];
680 outtyp = OPT [ "return"; ty = term -> ty ];
683 lhs = match_pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *);
688 return_term loc (Ast.Case (t, indty_ident, outtyp, patterns))
689 | LPAREN; p1 = term; SYMBOL ":"; p2 = term; RPAREN ->
690 return_term loc (Ast.Cast (p1, p2))
691 | LPAREN; p = term; RPAREN -> p
692 | blob = UNPARSED_META ->
693 !parse_level2_meta_ref (Ulexing.from_utf8_string blob)
699 (** {2 API implementation} *)
701 let exc_located_wrapper f =
705 | Stdpp.Exc_located (floc, Stream.Error msg) ->
706 raise (HExtlib.Localized (floc, Parse_error msg))
707 | Stdpp.Exc_located (floc, exn) ->
708 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
710 let parse_level1_pattern precedence lexbuf =
712 (fun () -> Grammar.Entry.parse level1_pattern (Obj.magic lexbuf) precedence)
714 let parse_level2_ast lexbuf =
716 (fun () -> Grammar.Entry.parse level2_ast (Obj.magic lexbuf))
718 let parse_level2_meta lexbuf =
720 (fun () -> Grammar.Entry.parse level2_meta (Obj.magic lexbuf))
723 parse_level1_pattern_ref := parse_level1_pattern;
724 parse_level2_ast_ref := parse_level2_ast;
725 parse_level2_meta_ref := parse_level2_meta
727 let parse_term lexbuf =
729 (fun () -> (Grammar.Entry.parse term (Obj.magic lexbuf)))
733 let print_l2_pattern () =
734 Grammar.print_entry Format.std_formatter (Grammar.Entry.obj term);
735 Format.pp_print_flush Format.std_formatter ();
738 (* vim:set encoding=utf8 foldmethod=marker: *)