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 = NotationPt
31 module Env = NotationEnv
33 exception Parse_error of string
34 exception Level_not_found of int
36 let min_precedence = 0
37 let max_precedence = 100
39 type ('a,'b,'c,'d) grammars = {
40 level1_pattern: 'a Grammar.Entry.e;
41 level2_ast: 'b Grammar.Entry.e;
42 level2_ast_grammar : Grammar.g;
43 term: 'b Grammar.Entry.e;
44 let_defs: 'c Grammar.Entry.e;
45 protected_binder_vars: 'd Grammar.Entry.e;
46 level2_meta: 'b Grammar.Entry.e;
49 type checked_l1_pattern = CL1P of NotationPt.term * int
53 (int -> NotationPt.term,
55 (Ast.term Ast.capture_variable list *
56 Ast.term Ast.capture_variable * Ast.term * int) list,
57 Ast.term list * Ast.term option) grammars;
58 items: (checked_l1_pattern * int * Gramext.g_assoc * NotationPt.term) list
63 Pervasives.int_of_string s
65 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
67 (** {2 Grammar extension} *)
69 let level_of precedence =
70 if precedence < min_precedence || precedence > max_precedence then
71 raise (Level_not_found precedence);
72 string_of_int precedence
74 let gram_symbol s = Gramext.Stoken ("SYMBOL", s)
75 let gram_ident s = Gramext.Stoken ("IDENT", s)
76 let gram_number s = Gramext.Stoken ("NUMBER", s)
77 let gram_keyword s = Gramext.Stoken ("", s)
78 let gram_term status = function
79 | Ast.Self _ -> Gramext.Sself
80 | Ast.Level precedence ->
83 (status#notation_parser_db.grammars.term: 'a Grammar.Entry.e),
89 | `Symbol s -> gram_symbol s
90 | `Keyword s -> gram_keyword s
91 | `Number s -> gram_number s
95 | Binding of string * Env.value_type
96 | Env of (string * Env.value_type) list
98 let make_action action bindings =
99 let rec aux (vl : NotationEnv.t) =
101 [] -> Gramext.action (fun (loc: Ast.location) -> action vl loc)
102 | NoBinding :: tl -> Gramext.action (fun _ -> aux vl tl)
103 (* LUCA: DEFCON 3 BEGIN *)
104 | Binding (name, Env.TermType l) :: tl ->
107 aux ((name, (Env.TermType l, Env.TermValue v))::vl) tl)
108 | Binding (name, Env.StringType) :: tl ->
111 aux ((name, (Env.StringType, Env.StringValue v)) :: vl) tl)
112 | Binding (name, Env.NumType) :: tl ->
115 aux ((name, (Env.NumType, Env.NumValue v)) :: vl) tl)
116 | Binding (name, Env.OptType t) :: tl ->
118 (fun (v:'a option) ->
119 aux ((name, (Env.OptType t, Env.OptValue v)) :: vl) tl)
120 | Binding (name, Env.ListType t) :: tl ->
123 aux ((name, (Env.ListType t, Env.ListValue v)) :: vl) tl)
125 Gramext.action (fun (v:NotationEnv.t) -> aux (v @ vl) tl)
126 (* LUCA: DEFCON 3 END *)
128 aux [] (List.rev bindings)
134 | NoBinding :: tl -> aux acc tl
135 | Env names :: tl -> aux (List.rev names @ acc) tl
136 | Binding (name, ty) :: tl -> aux ((name, ty) :: acc) tl
140 (* given a level 1 pattern computes the new RHS of "term" grammar entry *)
141 let extract_term_production status pattern =
142 let rec aux = function
143 | Ast.AttributedTerm (_, t) -> aux t
144 | Ast.Literal l -> aux_literal l
145 | Ast.Layout l -> aux_layout l
146 | Ast.Magic m -> aux_magic m
147 | Ast.Variable v -> aux_variable v
149 prerr_endline (NotationPp.pp_term t);
153 | `Symbol s -> [NoBinding, gram_symbol s]
155 (* assumption: s will be registered as a keyword with the lexer *)
156 [NoBinding, gram_keyword s]
157 | `Number s -> [NoBinding, gram_number s]
158 and aux_layout = function
159 | Ast.Sub (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sub "] @ aux p2
160 | Ast.Sup (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sup "] @ aux p2
161 | Ast.Below (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\below "] @ aux p2
162 | Ast.Above (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\above "] @ aux p2
163 | Ast.Frac (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\frac "] @ aux p2
164 | Ast.InfRule (p1, p2, p3) -> [NoBinding, gram_symbol "\\infrule "] @ aux p1 @ aux p2 @ aux p3
165 | Ast.Atop (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\atop "] @ aux p2
166 | Ast.Over (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\over "] @ aux p2
167 | Ast.Root (p1, p2) ->
168 [NoBinding, gram_symbol "\\root "] @ aux p2
169 @ [NoBinding, gram_symbol "\\of "] @ aux p1
170 | Ast.Sqrt p -> [NoBinding, gram_symbol "\\sqrt "] @ aux p
172 | Ast.Box (_, pl) -> List.flatten (List.map aux pl)
173 | Ast.Group pl -> List.flatten (List.map aux pl)
174 | Ast.Mstyle (_,pl) -> List.flatten (List.map aux pl)
175 | Ast.Mpadded (_,pl) -> List.flatten (List.map aux pl)
176 | Ast.Maction l -> List.flatten (List.map aux l)
177 and aux_magic magic =
180 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
181 let action (env_opt : NotationEnv.t option) (loc : Ast.location) =
183 | Some env -> List.map Env.opt_binding_some env
184 | None -> List.map Env.opt_binding_of_name p_names
186 [ Env (List.map Env.opt_declaration p_names),
188 [ [ Gramext.Sopt (Gramext.srules [ p_atoms, p_action ]) ],
189 Gramext.action action ] ]
191 | Ast.List1 (p, _) ->
192 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
193 let action (env_list : NotationEnv.t list) (loc : Ast.location) =
194 NotationEnv.coalesce_env p_names env_list
198 | Ast.List0 (_, None) -> Gramext.Slist0 s
199 | Ast.List1 (_, None) -> Gramext.Slist1 s
200 | Ast.List0 (_, Some l) -> Gramext.Slist0sep (s, gram_of_literal l)
201 | Ast.List1 (_, Some l) -> Gramext.Slist1sep (s, gram_of_literal l)
204 [ Env (List.map Env.list_declaration p_names),
206 [ [ gram_of_list (Gramext.srules [ p_atoms, p_action ]) ],
207 Gramext.action action ] ]
211 | Ast.NumVar s -> [Binding (s, Env.NumType), gram_number ""]
212 | Ast.TermVar (s,(Ast.Self level|Ast.Level level as lv)) ->
213 [Binding (s, Env.TermType level), gram_term status lv]
214 | Ast.IdentVar s -> [Binding (s, Env.StringType), gram_ident ""]
215 | Ast.Ascription (p, s) -> assert false (* TODO *)
216 | Ast.FreshVar _ -> assert false
217 and inner_pattern p =
218 let p_bindings, p_atoms = List.split (aux p) in
219 let p_names = flatten_opt p_bindings in
221 make_action (fun (env : NotationEnv.t) (loc : Ast.location) -> env)
224 p_bindings, p_atoms, p_names, action
228 type rule_id = Grammar.token Gramext.g_symbol list
230 let compare_rule_id x y =
231 let rec aux = function
235 | ((s1::tl1) as x),((s2::tl2) as y) ->
236 if Gramext.eq_symbol s1 s2 then aux (tl1,tl2)
237 else Pervasives.compare x y
242 let check_l1_pattern level1_pattern pponly level associativity =
243 let variables = ref 0 in
244 let symbols = ref 0 in
245 let rec aux = function
246 | Ast.AttributedTerm (att, t) -> Ast.AttributedTerm (att,aux t)
247 | Ast.Literal _ as l -> incr symbols; l
248 | Ast.Layout l -> Ast.Layout (aux_layout l)
249 | Ast.Magic m -> Ast.Magic (aux_magic m)
250 | Ast.Variable v -> (aux_variable v)
252 and aux_layout = function
253 | Ast.Sub (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sub (p1, p2)
254 | Ast.Sup (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sup (p1, p2)
255 | Ast.Below (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Below (p1, p2)
256 | Ast.Above (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Above (p1, p2)
257 | Ast.Frac (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Frac (p1, p2)
258 | Ast.InfRule (p1, p2, p3) -> let p1 = aux p1 in let p2 = aux p2 in let p3 = aux p3 in Ast.InfRule (p1, p2, p3)
259 | Ast.Atop (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Atop (p1, p2)
260 | Ast.Over (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Over (p1, p2)
261 | Ast.Root (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Root (p1, p2)
262 | Ast.Sqrt p -> Ast.Sqrt (aux p)
263 | Ast.Break as t -> t
264 | Ast.Box (b, pl) -> Ast.Box(b, List.map aux pl)
265 | Ast.Group pl -> Ast.Group (List.map aux pl)
266 | Ast.Mstyle (l,pl) -> Ast.Mstyle (l, List.map aux pl)
267 | Ast.Mpadded (l,pl) -> Ast.Mpadded (l, List.map aux pl)
268 | Ast.Maction l as t ->
270 raise(Parse_error("Maction can be used only in output notations"))
272 and aux_magic magic =
274 | Ast.Opt p -> Ast.Opt (aux p)
275 | Ast.List0 (p, x) -> Ast.List0 (aux p, x)
276 | Ast.List1 (p, x) -> Ast.List1 (aux p, x)
280 | Ast.NumVar _ as t -> Ast.Variable t
281 | Ast.TermVar (s,Ast.Self _) when associativity <> Gramext.NonA ->
283 if !variables > 2 then
284 raise (Parse_error ("Exactly 2 variables must be specified in an "^
285 "associative notation"));
286 (match !variables, associativity with
288 Ast.Variable (Ast.TermVar (s, Ast.Self level))
289 | 1,Gramext.RightA ->
290 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
292 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
293 | 2,Gramext.RightA ->
294 Ast.Variable (Ast.TermVar (s, Ast.Level (level-1)))
296 | Ast.TermVar (s,Ast.Level _) when associativity <> Gramext.NonA ->
297 raise (Parse_error ("Variables can not be declared with a " ^
298 "precedence in an associative notation"))
299 (*avoid camlp5 divergence due to non-Sself recursion at the same level *)
300 | Ast.TermVar (s,Ast.Level l) when l<=level && !variables=0 && !symbols=0->
301 raise(Parse_error("Left recursive rule with precedence not greater " ^
302 "than " ^ string_of_int level ^ " is not allowed to avoid divergence"))
303 | Ast.TermVar _ as t -> incr variables; Ast.Variable t
304 | Ast.IdentVar _ as t -> Ast.Variable t
305 | Ast.Ascription _ -> assert false (* TODO *)
306 | Ast.FreshVar _ -> assert false
308 if associativity <> Gramext.NonA && level = min_precedence then
309 raise (Parse_error ("You can not specify an associative notation " ^
310 "at level "^string_of_int min_precedence ^ "; increase it"));
311 let cp = aux level1_pattern in
312 (* prerr_endline ("checked_pattern: " ^ NotationPp.pp_term cp); *)
313 if !variables <> 2 && associativity <> Gramext.NonA then
314 raise (Parse_error ("Exactly 2 variables must be specified in an "^
315 "associative notation"));
319 let extend status (CL1P (level1_pattern,precedence)) action =
322 CicNotationParser.new_parser ();
323 let create_cb_old (l1, precedence, associativity, l2) =
325 CicNotationParser.extend l1
327 NotationPt.AttributedTerm
328 (`Loc loc,TermContentPres.instantiate_level2 env l2)))
330 RefCounter.iter create_cb_old !parser_ref_counter;
333 let p_bindings, p_atoms =
334 List.split (extract_term_production status level1_pattern)
336 let level = level_of precedence in
340 (status#notation_parser_db.grammars.term: 'a Grammar.Entry.e),
341 Some (Gramext.Level level),
343 Some (*Gramext.NonA*) Gramext.NonA,
346 (fun (env: NotationEnv.t) (loc: Ast.location) ->
350 let keywords = NotationUtil.keywords_of_term level1_pattern in
351 let rule_id = p_atoms in
352 List.iter CicNotationLexer.add_level2_ast_keyword keywords;
358 let fold_cluster binder terms ty body =
360 (fun term body -> Ast.Binder (binder, (term, ty), body))
361 terms body (* terms are names: either Ident or FreshVar *)
363 let fold_exists terms ty body =
366 let lambda = Ast.Binder (`Lambda, (term, ty), body) in
367 Ast.Appl [ Ast.Symbol ("exists", 0); lambda ])
370 let fold_binder binder pt_names body =
372 (fun (names, ty) body -> fold_cluster binder names ty body)
375 let return_term loc term = Ast.AttributedTerm (`Loc loc, term)
376 let return_term_of_level loc term l =
377 Ast.AttributedTerm (`Loc loc, term l)
379 (** {2 API implementation} *)
381 let exc_located_wrapper f =
385 | Stdpp.Exc_located (floc, Stream.Error msg) ->
386 raise (HExtlib.Localized (floc, Parse_error msg))
387 | Stdpp.Exc_located (floc, HExtlib.Localized (_,exn)) ->
388 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
389 | Stdpp.Exc_located (floc, exn) ->
390 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
392 let parse_level1_pattern grammars precedence lexbuf =
394 (fun () -> Grammar.Entry.parse grammars.level1_pattern (Obj.magic lexbuf) precedence)
396 let parse_level2_ast grammars lexbuf =
398 (fun () -> Grammar.Entry.parse grammars.level2_ast (Obj.magic lexbuf))
400 let parse_level2_meta grammars lexbuf =
402 (fun () -> Grammar.Entry.parse grammars.level2_meta (Obj.magic lexbuf))
404 let parse_term grammars lexbuf =
406 (fun () -> (Grammar.Entry.parse grammars.term (Obj.magic lexbuf)))
408 (* create empty precedence level for "term" *)
409 let initialize_grammars grammars =
411 Gramext.action (fun _ ->
412 failwith "internal error, lexer generated a dummy token")
414 (* Needed since campl4 on "delete_rule" remove the precedence level if it gets
415 * empty after the deletion. The lexer never generate the Stoken below. *)
416 let dummy_prod = [ [ Gramext.Stoken ("DUMMY", "") ], dummy_action ] in
417 let mk_level_list first last =
418 let rec aux acc = function
419 | i when i < first -> acc
422 ((Some (level_of i), Some Gramext.NonA, dummy_prod)
429 [ Grammar.Entry.obj (grammars.term: 'a Grammar.Entry.e),
431 mk_level_list min_precedence max_precedence ];
432 (* {{{ Grammar for concrete syntax patterns, notation level 1 *)
434 let level1_pattern = grammars.level1_pattern in
436 GLOBAL: level1_pattern;
439 [ p = l1_pattern; EOI -> fun l -> NotationUtil.boxify (p l) ]
442 [ p = LIST1 l1_simple_pattern ->
443 fun l -> List.map (fun x -> x l) p ]
446 [ s = SYMBOL -> `Symbol s
447 | k = QKEYWORD -> `Keyword k
448 | n = NUMBER -> `Number n
451 sep: [ [ "sep"; sep = literal -> sep ] ];
453 [ "list0"; p = l1_simple_pattern; sep = OPT sep ->
454 fun l -> Ast.List0 (p l, sep)
455 | "list1"; p = l1_simple_pattern; sep = OPT sep ->
456 fun l -> Ast.List1 (p l, sep)
457 | "opt"; p = l1_simple_pattern -> fun l -> Ast.Opt (p l)
460 l1_pattern_variable: [
461 [ "term"; precedence = NUMBER; id = IDENT ->
462 Ast.TermVar (id, Ast.Level (int_of_string precedence))
463 | "number"; id = IDENT -> Ast.NumVar id
464 | "ident"; id = IDENT -> Ast.IdentVar id
469 v = [ IDENT | NUMBER | COLOR | FLOATWITHUNIT ] -> id, v]];
472 v = [ PERCENTAGE ] -> id, v]];
475 [ p1 = SELF; SYMBOL "\\sub "; p2 = SELF ->
476 return_term_of_level loc
477 (fun l -> Ast.Layout (Ast.Sub (p1 l, p2 l)))
478 | p1 = SELF; SYMBOL "\\sup "; p2 = SELF ->
479 return_term_of_level loc
480 (fun l -> Ast.Layout (Ast.Sup (p1 l, p2 l)))
481 | p1 = SELF; SYMBOL "\\below "; p2 = SELF ->
482 return_term_of_level loc
483 (fun l -> Ast.Layout (Ast.Below (p1 l, p2 l)))
484 | p1 = SELF; SYMBOL "\\above "; p2 = SELF ->
485 return_term_of_level loc
486 (fun l -> Ast.Layout (Ast.Above (p1 l, p2 l)))
487 | p1 = SELF; SYMBOL "\\over "; p2 = SELF ->
488 return_term_of_level loc
489 (fun l -> Ast.Layout (Ast.Over (p1 l, p2 l)))
490 | p1 = SELF; SYMBOL "\\atop "; p2 = SELF ->
491 return_term_of_level loc
492 (fun l -> Ast.Layout (Ast.Atop (p1 l, p2 l)))
493 | p1 = SELF; SYMBOL "\\frac "; p2 = SELF ->
494 return_term_of_level loc
495 (fun l -> Ast.Layout (Ast.Frac (p1 l, p2 l)))
496 | SYMBOL "\\infrule "; p1 = SELF; p2 = SELF; p3 = SELF ->
497 return_term_of_level loc
498 (fun l -> Ast.Layout (Ast.InfRule (p1 l, p2 l, p3 l)))
499 | SYMBOL "\\sqrt "; p = SELF ->
500 return_term_of_level loc (fun l -> Ast.Layout (Ast.Sqrt p l))
501 | SYMBOL "\\root "; index = SELF; SYMBOL "\\of "; arg = SELF ->
502 return_term_of_level loc
503 (fun l -> Ast.Layout (Ast.Root (arg l, index l)))
504 | "hbox"; LPAREN; p = l1_pattern; RPAREN ->
505 return_term_of_level loc
506 (fun l -> Ast.Layout (Ast.Box ((Ast.H, false, false), p l)))
507 | "vbox"; LPAREN; p = l1_pattern; RPAREN ->
508 return_term_of_level loc
509 (fun l -> Ast.Layout (Ast.Box ((Ast.V, false, false), p l)))
510 | "hvbox"; LPAREN; p = l1_pattern; RPAREN ->
511 return_term_of_level loc
512 (fun l -> Ast.Layout (Ast.Box ((Ast.HV, false, false), p l)))
513 | "hovbox"; LPAREN; p = l1_pattern; RPAREN ->
514 return_term_of_level loc
515 (fun l -> Ast.Layout (Ast.Box ((Ast.HOV, false, false), p l)))
516 | "break" -> return_term_of_level loc (fun _ -> Ast.Layout Ast.Break)
517 | "mstyle"; m = LIST1 mstyle ; LPAREN; t = l1_pattern; RPAREN ->
518 return_term_of_level loc
520 Ast.Layout (Ast.Mstyle (m, t l)))
521 | "mpadded"; m = LIST1 mpadded ; LPAREN; t = l1_pattern; RPAREN ->
522 return_term_of_level loc
524 Ast.Layout (Ast.Mpadded (m, t l)))
525 | "maction"; m = LIST1 [ LPAREN; l = l1_pattern; RPAREN -> l ] ->
526 return_term_of_level loc
527 (fun l -> Ast.Layout (Ast.Maction (List.map (fun x ->
528 NotationUtil.group (x l)) m)))
529 | LPAREN; p = l1_pattern; RPAREN ->
530 return_term_of_level loc (fun l -> NotationUtil.group (p l))
534 return_term_of_level loc
535 (fun l -> Ast.Variable (Ast.TermVar (i,Ast.Self l)))
536 | m = l1_magic_pattern ->
537 return_term_of_level loc (fun l -> Ast.Magic (m l))
538 | v = l1_pattern_variable ->
539 return_term_of_level loc (fun _ -> Ast.Variable v)
540 | l = literal -> return_term_of_level loc (fun _ -> Ast.Literal l)
546 (* {{{ Grammar for ast magics, notation level 2 *)
548 let level2_meta = grammars.level2_meta in
552 [ "term"; precedence = NUMBER; id = IDENT ->
553 Ast.TermVar (id,Ast.Level (int_of_string precedence))
554 | "number"; id = IDENT -> Ast.NumVar id
555 | "ident"; id = IDENT -> Ast.IdentVar id
556 | "fresh"; id = IDENT -> Ast.FreshVar id
557 | "anonymous" -> Ast.TermVar ("_",Ast.Self 0) (* is the level relevant?*)
558 | id = IDENT -> Ast.TermVar (id,Ast.Self 0)
562 [ "fold"; kind = [ "left" -> `Left | "right" -> `Right ];
563 base = level2_meta; "rec"; id = IDENT; recursive = level2_meta ->
564 Ast.Fold (kind, base, [id], recursive)
565 | "default"; some = level2_meta; none = level2_meta ->
566 Ast.Default (some, none)
567 | "if"; p_test = level2_meta;
568 "then"; p_true = level2_meta;
569 "else"; p_false = level2_meta ->
570 Ast.If (p_test, p_true, p_false)
575 [ magic = l2_magic -> Ast.Magic magic
576 | var = l2_variable -> Ast.Variable var
577 | blob = UNPARSED_AST ->
578 parse_level2_ast grammars (Ulexing.from_utf8_string blob)
584 (* {{{ Grammar for ast patterns, notation level 2 *)
586 let level2_ast = grammars.level2_ast in
587 let term = grammars.term in
588 let let_defs = grammars.let_defs in
589 let protected_binder_vars = grammars.protected_binder_vars in
591 GLOBAL: level2_ast term let_defs protected_binder_vars;
592 level2_ast: [ [ p = term -> p ] ];
596 | "Type"; SYMBOL "["; n = [ NUMBER| IDENT ]; SYMBOL "]" -> `NType n
597 | "CProp"; SYMBOL "["; n = [ NUMBER| IDENT ]; SYMBOL "]" -> `NCProp n
601 [ SYMBOL "\\subst "; (* to avoid catching frequent "a [1]" cases *)
604 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
611 [ s = SYMBOL "_" -> None
612 | p = term -> Some p ]
615 [ SYMBOL "["; substs = LIST0 meta_subst; SYMBOL "]" -> substs ]
617 possibly_typed_name: [
618 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
620 | arg = single_arg -> arg, None
621 | id = PIDENT -> Ast.Ident (id, None), None
622 | SYMBOL "_" -> Ast.Ident ("_", None), None
623 | LPAREN; id = PIDENT; SYMBOL ":"; typ = term; RPAREN ->
624 Ast.Ident (id, None), Some typ
625 | LPAREN; SYMBOL "_"; SYMBOL ":"; typ = term; RPAREN ->
626 Ast.Ident ("_", None), Some typ
630 [ SYMBOL "_" -> Ast.Wildcard
631 | id = IDENT -> Ast.Pattern (id, None, [])
632 | LPAREN; id = IDENT; vars = LIST1 possibly_typed_name; RPAREN ->
633 Ast.Pattern (id, None, vars)
634 | id = IDENT; vars = LIST1 possibly_typed_name ->
635 Ast.Pattern (id, None, vars)
639 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
640 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall
641 | SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda
645 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
646 SYMBOL ":"; ty = term; RPAREN ->
647 List.map (fun n -> Ast.Ident (n, None)) names, Some ty
648 | name = IDENT -> [Ast.Ident (name, None)], None
649 | blob = UNPARSED_META ->
650 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
652 | Ast.Variable (Ast.FreshVar _) -> [meta], None
653 | Ast.Variable (Ast.TermVar ("_",_)) -> [Ast.Ident ("_", None)], None
654 | _ -> failwith "Invalid bound name."
658 [ name = IDENT -> Ast.Ident (name, None)
659 | blob = UNPARSED_META ->
660 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
662 | Ast.Variable (Ast.FreshVar _)
663 | Ast.Variable (Ast.IdentVar _) -> meta
664 | Ast.Variable (Ast.TermVar ("_",_)) -> Ast.Ident ("_", None)
665 | _ -> failwith "Invalid index name."
672 index_name = OPT [ "on"; id = single_arg -> id ];
673 ty = OPT [ SYMBOL ":" ; p = term -> p ];
674 SYMBOL <:unicode<def>> (* ≝ *); body = term ->
675 let rec position_of name p = function
677 | n :: _ when n = name -> Some p, p
678 | _ :: tl -> position_of name (p + 1) tl
680 let rec find_arg name n = function
682 Ast.fail loc (sprintf "Argument %s not found"
683 (NotationPp.pp_term name))
685 (match position_of name 0 l with
686 | None, len -> find_arg name (n + len) tl
687 | Some where, len -> n + where)
690 match index_name with
692 | Some index_name -> find_arg index_name 0 args
697 (function (names,ty) -> List.map (function x -> x,ty) names
700 args, (name, ty), body, index
707 [ l = LIST1 single_arg SEP SYMBOL "," -> l
708 | l = LIST1 [ PIDENT | SYMBOL "_" ] SEP SYMBOL "," ->
709 List.map (fun x -> Ast.Ident(x,None)) l
711 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
714 protected_binder_vars: [
715 [ LPAREN; vars = binder_vars; RPAREN -> vars
718 maybe_protected_binder_vars: [
719 [ vars = binder_vars -> vars
720 | vars = protected_binder_vars -> vars
727 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
729 | id = IDENT; ty = OPT [ SYMBOL ":"; typ = term -> typ] ->
730 Ast.Ident(id,None), ty ];
731 SYMBOL <:unicode<def>> (* ≝ *);
732 p1 = term; "in"; p2 = term ->
733 return_term loc (Ast.LetIn (var, p1, p2))
734 | LETCOREC; defs = let_defs; "in";
736 return_term loc (Ast.LetRec (`CoInductive, defs, body))
737 | LETREC; defs = let_defs; "in";
739 return_term loc (Ast.LetRec (`Inductive, defs, body))
744 [ b = binder; (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term LEVEL "19" ->
745 return_term loc (fold_cluster b vars typ body)
750 [ p1 = term; p2 = term LEVEL "71" ->
751 let rec aux = function
752 | Ast.Appl (hd :: tl)
753 | Ast.AttributedTerm (_, Ast.Appl (hd :: tl)) ->
757 return_term loc (Ast.Appl (aux p1 @ [p2]))
762 [ id = IDENT -> return_term loc (Ast.Ident (id, None))
763 | id = IDENT; s = explicit_subst ->
764 return_term loc (Ast.Ident (id, Some s))
765 | s = CSYMBOL -> return_term loc (Ast.Symbol (s, 0))
766 | u = URI -> return_term loc (Ast.Uri (u, None))
767 | r = NREF -> return_term loc (Ast.NRef (NReference.reference_of_string r))
768 | n = NUMBER -> return_term loc (Ast.Num (n, 0))
769 | IMPLICIT -> return_term loc (Ast.Implicit `JustOne)
770 | SYMBOL <:unicode<ldots>> -> return_term loc (Ast.Implicit `Vector)
771 | PLACEHOLDER -> return_term loc Ast.UserInput
772 | m = META -> return_term loc (Ast.Meta (int_of_string m, []))
773 | m = META; s = meta_substs ->
774 return_term loc (Ast.Meta (int_of_string m, s))
775 | s = sort -> return_term loc (Ast.Sort s)
777 indty_ident = OPT [ "in"; id = IDENT -> id, None ];
778 outtyp = OPT [ "return"; ty = term -> ty ];
781 lhs = match_pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *);
786 return_term loc (Ast.Case (t, indty_ident, outtyp, patterns))
787 | LPAREN; p1 = term; SYMBOL ":"; p2 = term; RPAREN ->
788 return_term loc (Ast.Cast (p1, p2))
789 | LPAREN; p = term; RPAREN -> p
790 | blob = UNPARSED_META ->
791 parse_level2_meta grammars (Ulexing.from_utf8_string blob)
800 let initial_grammars =
801 let lexers = CicNotationLexer.mk_lexers [] in
802 let level1_pattern_grammar =
803 Grammar.gcreate lexers.CicNotationLexer.level1_pattern_lexer in
804 let level2_ast_grammar =
805 Grammar.gcreate lexers.CicNotationLexer.level2_ast_lexer in
806 let level2_meta_grammar =
807 Grammar.gcreate lexers.CicNotationLexer.level2_meta_lexer in
809 Grammar.Entry.create level1_pattern_grammar "level1_pattern" in
810 let level2_ast = Grammar.Entry.create level2_ast_grammar "level2_ast" in
811 let term = Grammar.Entry.create level2_ast_grammar "term" in
812 let let_defs = Grammar.Entry.create level2_ast_grammar "let_defs" in
813 let protected_binder_vars =
814 Grammar.Entry.create level2_ast_grammar "protected_binder_vars" in
815 let level2_meta = Grammar.Entry.create level2_meta_grammar "level2_meta" in
816 initialize_grammars { level1_pattern=level1_pattern;
817 level2_ast=level2_ast;
820 protected_binder_vars=protected_binder_vars;
821 level2_meta=level2_meta;
822 level2_ast_grammar=level2_ast_grammar;
826 class type g_status =
828 method notation_parser_db: db
833 val db = { grammars = initial_grammars ; items = [] }
834 method notation_parser_db = db
835 method set_notation_parser_db v = {< db = v >}
836 method set_notation_parser_status
837 : 'status. #g_status as 'status -> 'self
838 = fun o -> {< db = o#notation_parser_db >}
841 let parse_level1_pattern status =
842 parse_level1_pattern status#notation_parser_db.grammars
843 let parse_level2_ast status =
844 parse_level2_ast status#notation_parser_db.grammars
845 let parse_level2_meta status =
846 parse_level2_meta status#notation_parser_db.grammars
847 let parse_term status =
848 parse_term status#notation_parser_db.grammars
850 let level2_ast_grammar status =
851 status#notation_parser_db.grammars.level2_ast_grammar
852 let term status = status#notation_parser_db.grammars.term
853 let let_defs status = status#notation_parser_db.grammars.let_defs
854 let protected_binder_vars status =
855 status#notation_parser_db.grammars.protected_binder_vars
859 let print_l2_pattern status =
860 Grammar.print_entry Format.std_formatter
861 (Grammar.Entry.obj status#notation_parser_db.grammars.term);
862 Format.pp_print_flush Format.std_formatter ();
865 (* vim:set encoding=utf8 foldmethod=marker: *)