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
51 let refresh_uri_in_checked_l1_pattern ~refresh_uri_in_term
52 ~refresh_uri_in_reference (CL1P (t,n))
54 CL1P (NotationUtil.refresh_uri_in_term ~refresh_uri_in_term
55 ~refresh_uri_in_reference t, n)
59 | Binding of string * Env.value_type
60 | Env of (string * Env.value_type) list
64 (int -> NotationPt.term,
66 (Ast.term Ast.capture_variable list *
67 Ast.term Ast.capture_variable * Ast.term * int) list,
68 Ast.term list * Ast.term option) grammars;
69 keywords: string list;
70 items: (string * Ast.term * (NotationEnv.t -> Ast.location -> Ast.term)) list
75 Pervasives.int_of_string s
77 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
79 (** {2 Grammar extension} *)
81 let level_of precedence =
82 if precedence < min_precedence || precedence > max_precedence then
83 raise (Level_not_found precedence);
84 string_of_int precedence
86 let gram_symbol s = Gramext.Stoken ("SYMBOL", s)
87 let gram_ident s = Gramext.Stoken ("IDENT", s)
88 let gram_number s = Gramext.Stoken ("NUMBER", s)
89 let gram_keyword s = Gramext.Stoken ("", s)
90 let gram_term status = function
91 | Ast.Self _ -> Gramext.Sself
92 | Ast.Level precedence ->
95 (status#notation_parser_db.grammars.term : 'a Grammar.Entry.e),
101 | `Symbol s -> gram_symbol s
102 | `Keyword s -> gram_keyword s
103 | `Number s -> gram_number s
105 let make_action action bindings =
106 let rec aux (vl : NotationEnv.t) =
108 [] -> Gramext.action (fun (loc: Ast.location) -> action vl loc)
109 | NoBinding :: tl -> Gramext.action (fun _ -> aux vl tl)
110 (* LUCA: DEFCON 3 BEGIN *)
111 | Binding (name, Env.TermType l) :: tl ->
114 aux ((name, (Env.TermType l, Env.TermValue v))::vl) tl)
115 | Binding (name, Env.StringType) :: tl ->
118 aux ((name, (Env.StringType, Env.StringValue v)) :: vl) tl)
119 | Binding (name, Env.NumType) :: tl ->
122 aux ((name, (Env.NumType, Env.NumValue v)) :: vl) tl)
123 | Binding (name, Env.OptType t) :: tl ->
125 (fun (v:'a option) ->
126 aux ((name, (Env.OptType t, Env.OptValue v)) :: vl) tl)
127 | Binding (name, Env.ListType t) :: tl ->
130 aux ((name, (Env.ListType t, Env.ListValue v)) :: vl) tl)
132 Gramext.action (fun (v:NotationEnv.t) -> aux (v @ vl) tl)
133 (* LUCA: DEFCON 3 END *)
135 aux [] (List.rev bindings)
141 | NoBinding :: tl -> aux acc tl
142 | Env names :: tl -> aux (List.rev names @ acc) tl
143 | Binding (name, ty) :: tl -> aux ((name, ty) :: acc) tl
147 (* given a level 1 pattern computes the new RHS of "term" grammar entry *)
148 let extract_term_production status pattern =
149 let rec aux = function
150 | Ast.AttributedTerm (_, t) -> aux t
151 | Ast.Literal l -> aux_literal l
152 | Ast.Layout l -> aux_layout l
153 | Ast.Magic m -> aux_magic m
154 | Ast.Variable v -> aux_variable v
156 prerr_endline (NotationPp.pp_term t);
160 | `Symbol s -> [NoBinding, gram_symbol s]
162 (* assumption: s will be registered as a keyword with the lexer *)
163 [NoBinding, gram_keyword s]
164 | `Number s -> [NoBinding, gram_number s]
165 and aux_layout = function
166 | Ast.Sub (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sub "] @ aux p2
167 | Ast.Sup (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sup "] @ aux p2
168 | Ast.Below (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\below "] @ aux p2
169 | Ast.Above (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\above "] @ aux p2
170 | Ast.Frac (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\frac "] @ aux p2
171 | Ast.InfRule (p1, p2, p3) -> [NoBinding, gram_symbol "\\infrule "] @ aux p1 @ aux p2 @ aux p3
172 | Ast.Atop (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\atop "] @ aux p2
173 | Ast.Over (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\over "] @ aux p2
174 | Ast.Root (p1, p2) ->
175 [NoBinding, gram_symbol "\\root "] @ aux p2
176 @ [NoBinding, gram_symbol "\\of "] @ aux p1
177 | Ast.Sqrt p -> [NoBinding, gram_symbol "\\sqrt "] @ aux p
179 | Ast.Box (_, pl) -> List.flatten (List.map aux pl)
180 | Ast.Group pl -> List.flatten (List.map aux pl)
181 | Ast.Mstyle (_,pl) -> List.flatten (List.map aux pl)
182 | Ast.Mpadded (_,pl) -> List.flatten (List.map aux pl)
183 | Ast.Maction l -> List.flatten (List.map aux l)
184 and aux_magic magic =
187 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
188 let action (env_opt : NotationEnv.t option) (loc : Ast.location) =
190 | Some env -> List.map Env.opt_binding_some env
191 | None -> List.map Env.opt_binding_of_name p_names
193 [ Env (List.map Env.opt_declaration p_names),
195 [ [ Gramext.Sopt (Gramext.srules [ p_atoms, p_action ]) ],
196 Gramext.action action ] ]
198 | Ast.List1 (p, _) ->
199 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
200 let action (env_list : NotationEnv.t list) (loc : Ast.location) =
201 NotationEnv.coalesce_env p_names env_list
205 | Ast.List0 (_, None) -> Gramext.Slist0 s
206 | Ast.List1 (_, None) -> Gramext.Slist1 s
207 | Ast.List0 (_, Some l) -> Gramext.Slist0sep (s, gram_of_literal l)
208 | Ast.List1 (_, Some l) -> Gramext.Slist1sep (s, gram_of_literal l)
211 [ Env (List.map Env.list_declaration p_names),
213 [ [ gram_of_list (Gramext.srules [ p_atoms, p_action ]) ],
214 Gramext.action action ] ]
218 | Ast.NumVar s -> [Binding (s, Env.NumType), gram_number ""]
219 | Ast.TermVar (s,(Ast.Self level|Ast.Level level as lv)) ->
220 [Binding (s, Env.TermType level), gram_term status lv]
221 | Ast.IdentVar s -> [Binding (s, Env.StringType), gram_ident ""]
222 | Ast.Ascription (p, s) -> assert false (* TODO *)
223 | Ast.FreshVar _ -> assert false
224 and inner_pattern p =
225 let p_bindings, p_atoms = List.split (aux p) in
226 let p_names = flatten_opt p_bindings in
228 make_action (fun (env : NotationEnv.t) (loc : Ast.location) -> env)
231 p_bindings, p_atoms, p_names, action
235 type rule_id = Grammar.token Gramext.g_symbol list
237 let compare_rule_id x y =
238 let rec aux = function
242 | ((s1::tl1) as x),((s2::tl2) as y) ->
243 if Gramext.eq_symbol s1 s2 then aux (tl1,tl2)
244 else Pervasives.compare x y
249 let check_l1_pattern level1_pattern pponly level associativity =
250 let variables = ref 0 in
251 let symbols = ref 0 in
252 let rec aux = function
253 | Ast.AttributedTerm (att, t) -> Ast.AttributedTerm (att,aux t)
254 | Ast.Literal _ as l -> incr symbols; l
255 | Ast.Layout l -> Ast.Layout (aux_layout l)
256 | Ast.Magic m -> Ast.Magic (aux_magic m)
257 | Ast.Variable v -> (aux_variable v)
259 and aux_layout = function
260 | Ast.Sub (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sub (p1, p2)
261 | Ast.Sup (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sup (p1, p2)
262 | Ast.Below (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Below (p1, p2)
263 | Ast.Above (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Above (p1, p2)
264 | Ast.Frac (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Frac (p1, p2)
265 | 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)
266 | Ast.Atop (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Atop (p1, p2)
267 | Ast.Over (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Over (p1, p2)
268 | Ast.Root (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Root (p1, p2)
269 | Ast.Sqrt p -> Ast.Sqrt (aux p)
270 | Ast.Break as t -> t
271 | Ast.Box (b, pl) -> Ast.Box(b, List.map aux pl)
272 | Ast.Group pl -> Ast.Group (List.map aux pl)
273 | Ast.Mstyle (l,pl) -> Ast.Mstyle (l, List.map aux pl)
274 | Ast.Mpadded (l,pl) -> Ast.Mpadded (l, List.map aux pl)
275 | Ast.Maction l as t ->
277 raise(Parse_error("Maction can be used only in output notations"))
279 and aux_magic magic =
281 | Ast.Opt p -> Ast.Opt (aux p)
282 | Ast.List0 (p, x) -> Ast.List0 (aux p, x)
283 | Ast.List1 (p, x) -> Ast.List1 (aux p, x)
287 | Ast.NumVar _ as t -> Ast.Variable t
288 | Ast.TermVar (s,Ast.Self _) when associativity <> Gramext.NonA ->
290 if !variables > 2 then
291 raise (Parse_error ("Exactly 2 variables must be specified in an "^
292 "associative notation"));
293 (match !variables, associativity with
295 Ast.Variable (Ast.TermVar (s, Ast.Self level))
296 | 1,Gramext.RightA ->
297 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
299 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
300 | 2,Gramext.RightA ->
301 Ast.Variable (Ast.TermVar (s, Ast.Level (level-1)))
303 | Ast.TermVar (s,Ast.Level _) when associativity <> Gramext.NonA ->
304 raise (Parse_error ("Variables can not be declared with a " ^
305 "precedence in an associative notation"))
306 (*avoid camlp5 divergence due to non-Sself recursion at the same level *)
307 | Ast.TermVar (s,Ast.Level l) when l<=level && !variables=0 && !symbols=0->
308 raise(Parse_error("Left recursive rule with precedence not greater " ^
309 "than " ^ string_of_int level ^ " is not allowed to avoid divergence"))
310 | Ast.TermVar _ as t -> incr variables; Ast.Variable t
311 | Ast.IdentVar _ as t -> Ast.Variable t
312 | Ast.Ascription _ -> assert false (* TODO *)
313 | Ast.FreshVar _ -> assert false
315 if associativity <> Gramext.NonA && level = min_precedence then
316 raise (Parse_error ("You can not specify an associative notation " ^
317 "at level "^string_of_int min_precedence ^ "; increase it"));
318 let cp = aux level1_pattern in
319 (* prerr_endline ("checked_pattern: " ^ NotationPp.pp_term cp); *)
320 if !variables <> 2 && associativity <> Gramext.NonA then
321 raise (Parse_error ("Exactly 2 variables must be specified in an "^
322 "associative notation"));
328 let fold_cluster binder terms ty body =
330 (fun term body -> Ast.Binder (binder, (term, ty), body))
331 terms body (* terms are names: either Ident or FreshVar *)
333 let fold_exists terms ty body =
336 let lambda = Ast.Binder (`Lambda, (term, ty), body) in
337 Ast.Appl [ Ast.Symbol ("exists", 0); lambda ])
340 let fold_binder binder pt_names body =
342 (fun (names, ty) body -> fold_cluster binder names ty body)
345 let return_term loc term = Ast.AttributedTerm (`Loc loc, term)
346 let return_term_of_level loc term l =
347 Ast.AttributedTerm (`Loc loc, term l)
349 (** {2 API implementation} *)
351 let exc_located_wrapper f =
355 | Stdpp.Exc_located (floc, Stream.Error msg) ->
356 raise (HExtlib.Localized (floc, Parse_error msg))
357 | Stdpp.Exc_located (floc, HExtlib.Localized (_,exn)) ->
358 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
359 | Stdpp.Exc_located (floc, exn) ->
360 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
362 let parse_level1_pattern grammars precedence lexbuf =
364 (fun () -> Grammar.Entry.parse grammars.level1_pattern (Obj.magic lexbuf) precedence)
366 let parse_level2_ast grammars lexbuf =
368 (fun () -> Grammar.Entry.parse grammars.level2_ast (Obj.magic lexbuf))
370 let parse_level2_meta grammars lexbuf =
372 (fun () -> Grammar.Entry.parse grammars.level2_meta (Obj.magic lexbuf))
374 let parse_term grammars lexbuf =
376 (fun () -> (Grammar.Entry.parse grammars.term (Obj.magic lexbuf)))
378 (* create empty precedence level for "term" *)
379 let initialize_grammars grammars =
381 Gramext.action (fun _ ->
382 failwith "internal error, lexer generated a dummy token")
384 (* Needed since campl4 on "delete_rule" remove the precedence level if it gets
385 * empty after the deletion. The lexer never generate the Stoken below. *)
386 let dummy_prod = [ [ Gramext.Stoken ("DUMMY", "") ], dummy_action ] in
387 let mk_level_list first last =
388 let rec aux acc = function
389 | i when i < first -> acc
392 ((Some (level_of i), Some Gramext.NonA, dummy_prod)
399 [ Grammar.Entry.obj (grammars.term: 'a Grammar.Entry.e),
401 mk_level_list min_precedence max_precedence ];
402 (* {{{ Grammar for concrete syntax patterns, notation level 1 *)
404 let level1_pattern = grammars.level1_pattern in
406 GLOBAL: level1_pattern;
409 [ p = l1_pattern; EOI -> fun l -> NotationUtil.boxify (p l) ]
412 [ p = LIST1 l1_simple_pattern ->
413 fun l -> List.map (fun x -> x l) p ]
416 [ s = SYMBOL -> `Symbol s
417 | k = QKEYWORD -> `Keyword k
418 | n = NUMBER -> `Number n
421 sep: [ [ "sep"; sep = literal -> sep ] ];
423 [ "list0"; p = l1_simple_pattern; sep = OPT sep ->
424 fun l -> Ast.List0 (p l, sep)
425 | "list1"; p = l1_simple_pattern; sep = OPT sep ->
426 fun l -> Ast.List1 (p l, sep)
427 | "opt"; p = l1_simple_pattern -> fun l -> Ast.Opt (p l)
430 l1_pattern_variable: [
431 [ "term"; precedence = NUMBER; id = IDENT ->
432 Ast.TermVar (id, Ast.Level (int_of_string precedence))
433 | "number"; id = IDENT -> Ast.NumVar id
434 | "ident"; id = IDENT -> Ast.IdentVar id
439 v = [ IDENT | NUMBER | COLOR | FLOATWITHUNIT ] -> id, v]];
442 v = [ PERCENTAGE ] -> id, v]];
445 [ p1 = SELF; SYMBOL "\\sub "; p2 = SELF ->
446 return_term_of_level loc
447 (fun l -> Ast.Layout (Ast.Sub (p1 l, p2 l)))
448 | p1 = SELF; SYMBOL "\\sup "; p2 = SELF ->
449 return_term_of_level loc
450 (fun l -> Ast.Layout (Ast.Sup (p1 l, p2 l)))
451 | p1 = SELF; SYMBOL "\\below "; p2 = SELF ->
452 return_term_of_level loc
453 (fun l -> Ast.Layout (Ast.Below (p1 l, p2 l)))
454 | p1 = SELF; SYMBOL "\\above "; p2 = SELF ->
455 return_term_of_level loc
456 (fun l -> Ast.Layout (Ast.Above (p1 l, p2 l)))
457 | p1 = SELF; SYMBOL "\\over "; p2 = SELF ->
458 return_term_of_level loc
459 (fun l -> Ast.Layout (Ast.Over (p1 l, p2 l)))
460 | p1 = SELF; SYMBOL "\\atop "; p2 = SELF ->
461 return_term_of_level loc
462 (fun l -> Ast.Layout (Ast.Atop (p1 l, p2 l)))
463 | p1 = SELF; SYMBOL "\\frac "; p2 = SELF ->
464 return_term_of_level loc
465 (fun l -> Ast.Layout (Ast.Frac (p1 l, p2 l)))
466 | SYMBOL "\\infrule "; p1 = SELF; p2 = SELF; p3 = SELF ->
467 return_term_of_level loc
468 (fun l -> Ast.Layout (Ast.InfRule (p1 l, p2 l, p3 l)))
469 | SYMBOL "\\sqrt "; p = SELF ->
470 return_term_of_level loc (fun l -> Ast.Layout (Ast.Sqrt p l))
471 | SYMBOL "\\root "; index = SELF; SYMBOL "\\of "; arg = SELF ->
472 return_term_of_level loc
473 (fun l -> Ast.Layout (Ast.Root (arg l, index l)))
474 | "hbox"; LPAREN; p = l1_pattern; RPAREN ->
475 return_term_of_level loc
476 (fun l -> Ast.Layout (Ast.Box ((Ast.H, false, false), p l)))
477 | "vbox"; LPAREN; p = l1_pattern; RPAREN ->
478 return_term_of_level loc
479 (fun l -> Ast.Layout (Ast.Box ((Ast.V, false, false), p l)))
480 | "hvbox"; LPAREN; p = l1_pattern; RPAREN ->
481 return_term_of_level loc
482 (fun l -> Ast.Layout (Ast.Box ((Ast.HV, false, false), p l)))
483 | "hovbox"; LPAREN; p = l1_pattern; RPAREN ->
484 return_term_of_level loc
485 (fun l -> Ast.Layout (Ast.Box ((Ast.HOV, false, false), p l)))
486 | "break" -> return_term_of_level loc (fun _ -> Ast.Layout Ast.Break)
487 | "mstyle"; m = LIST1 mstyle ; LPAREN; t = l1_pattern; RPAREN ->
488 return_term_of_level loc
490 Ast.Layout (Ast.Mstyle (m, t l)))
491 | "mpadded"; m = LIST1 mpadded ; LPAREN; t = l1_pattern; RPAREN ->
492 return_term_of_level loc
494 Ast.Layout (Ast.Mpadded (m, t l)))
495 | "maction"; m = LIST1 [ LPAREN; l = l1_pattern; RPAREN -> l ] ->
496 return_term_of_level loc
497 (fun l -> Ast.Layout (Ast.Maction (List.map (fun x ->
498 NotationUtil.group (x l)) m)))
499 | LPAREN; p = l1_pattern; RPAREN ->
500 return_term_of_level loc (fun l -> NotationUtil.group (p l))
504 return_term_of_level loc
505 (fun l -> Ast.Variable (Ast.TermVar (i,Ast.Self l)))
506 | m = l1_magic_pattern ->
507 return_term_of_level loc (fun l -> Ast.Magic (m l))
508 | v = l1_pattern_variable ->
509 return_term_of_level loc (fun _ -> Ast.Variable v)
510 | l = literal -> return_term_of_level loc (fun _ -> Ast.Literal l)
516 (* {{{ Grammar for ast magics, notation level 2 *)
518 let level2_meta = grammars.level2_meta in
522 [ "term"; precedence = NUMBER; id = IDENT ->
523 Ast.TermVar (id,Ast.Level (int_of_string precedence))
524 | "number"; id = IDENT -> Ast.NumVar id
525 | "ident"; id = IDENT -> Ast.IdentVar id
526 | "fresh"; id = IDENT -> Ast.FreshVar id
527 | "anonymous" -> Ast.TermVar ("_",Ast.Self 0) (* is the level relevant?*)
528 | id = IDENT -> Ast.TermVar (id,Ast.Self 0)
532 [ "fold"; kind = [ "left" -> `Left | "right" -> `Right ];
533 base = level2_meta; "rec"; id = IDENT; recursive = level2_meta ->
534 Ast.Fold (kind, base, [id], recursive)
535 | "default"; some = level2_meta; none = level2_meta ->
536 Ast.Default (some, none)
537 | "if"; p_test = level2_meta;
538 "then"; p_true = level2_meta;
539 "else"; p_false = level2_meta ->
540 Ast.If (p_test, p_true, p_false)
545 [ magic = l2_magic -> Ast.Magic magic
546 | var = l2_variable -> Ast.Variable var
547 | blob = UNPARSED_AST ->
548 parse_level2_ast grammars (Ulexing.from_utf8_string blob)
554 (* {{{ Grammar for ast patterns, notation level 2 *)
556 let level2_ast = grammars.level2_ast in
557 let term = grammars.term in
558 let let_defs = grammars.let_defs in
559 let protected_binder_vars = grammars.protected_binder_vars in
561 GLOBAL: level2_ast term let_defs protected_binder_vars;
562 level2_ast: [ [ p = term -> p ] ];
566 | "Type"; SYMBOL "["; n = [ NUMBER| IDENT ]; SYMBOL "]" -> `NType n
567 | "CProp"; SYMBOL "["; n = [ NUMBER| IDENT ]; SYMBOL "]" -> `NCProp n
571 [ SYMBOL "\\subst "; (* to avoid catching frequent "a [1]" cases *)
574 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
581 [ s = SYMBOL "_" -> None
582 | p = term -> Some p ]
585 [ SYMBOL "["; substs = LIST0 meta_subst; SYMBOL "]" -> substs ]
587 possibly_typed_name: [
588 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
590 | arg = single_arg -> arg, None
591 | id = PIDENT -> Ast.Ident (id, None), None
592 | SYMBOL "_" -> Ast.Ident ("_", None), None
593 | LPAREN; id = PIDENT; SYMBOL ":"; typ = term; RPAREN ->
594 Ast.Ident (id, None), Some typ
595 | LPAREN; SYMBOL "_"; SYMBOL ":"; typ = term; RPAREN ->
596 Ast.Ident ("_", None), Some typ
600 [ SYMBOL "_" -> Ast.Wildcard
601 | id = IDENT -> Ast.Pattern (id, None, [])
602 | LPAREN; id = IDENT; vars = LIST1 possibly_typed_name; RPAREN ->
603 Ast.Pattern (id, None, vars)
604 | id = IDENT; vars = LIST1 possibly_typed_name ->
605 Ast.Pattern (id, None, vars)
609 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
610 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall
611 | SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda
615 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
616 SYMBOL ":"; ty = term; RPAREN ->
617 List.map (fun n -> Ast.Ident (n, None)) names, Some ty
618 | name = IDENT -> [Ast.Ident (name, None)], None
619 | blob = UNPARSED_META ->
620 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
622 | Ast.Variable (Ast.FreshVar _) -> [meta], None
623 | Ast.Variable (Ast.TermVar ("_",_)) -> [Ast.Ident ("_", None)], None
624 | _ -> failwith "Invalid bound name."
628 [ name = IDENT -> Ast.Ident (name, None)
629 | blob = UNPARSED_META ->
630 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
632 | Ast.Variable (Ast.FreshVar _)
633 | Ast.Variable (Ast.IdentVar _) -> meta
634 | Ast.Variable (Ast.TermVar ("_",_)) -> Ast.Ident ("_", None)
635 | _ -> failwith "Invalid index name."
642 index_name = OPT [ "on"; id = single_arg -> id ];
643 ty = OPT [ SYMBOL ":" ; p = term -> p ];
644 SYMBOL <:unicode<def>> (* ≝ *); body = term ->
645 let rec position_of name p = function
647 | n :: _ when n = name -> Some p, p
648 | _ :: tl -> position_of name (p + 1) tl
650 let rec find_arg name n = function
652 Ast.fail loc (sprintf "Argument %s not found"
653 (NotationPp.pp_term name))
655 (match position_of name 0 l with
656 | None, len -> find_arg name (n + len) tl
657 | Some where, len -> n + where)
660 match index_name with
662 | Some index_name -> find_arg index_name 0 args
667 (function (names,ty) -> List.map (function x -> x,ty) names
670 args, (name, ty), body, index
677 [ l = LIST1 single_arg SEP SYMBOL "," -> l
678 | l = LIST1 [ PIDENT | SYMBOL "_" ] SEP SYMBOL "," ->
679 List.map (fun x -> Ast.Ident(x,None)) l
681 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
684 protected_binder_vars: [
685 [ LPAREN; vars = binder_vars; RPAREN -> vars
688 maybe_protected_binder_vars: [
689 [ vars = binder_vars -> vars
690 | vars = protected_binder_vars -> vars
697 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
699 | id = IDENT; ty = OPT [ SYMBOL ":"; typ = term -> typ] ->
700 Ast.Ident(id,None), ty ];
701 SYMBOL <:unicode<def>> (* ≝ *);
702 p1 = term; "in"; p2 = term ->
703 return_term loc (Ast.LetIn (var, p1, p2))
704 | LETCOREC; defs = let_defs; "in";
706 return_term loc (Ast.LetRec (`CoInductive, defs, body))
707 | LETREC; defs = let_defs; "in";
709 return_term loc (Ast.LetRec (`Inductive, defs, body))
714 [ b = binder; (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term LEVEL "19" ->
715 return_term loc (fold_cluster b vars typ body)
720 [ p1 = term; p2 = term LEVEL "71" ->
721 let rec aux = function
722 | Ast.Appl (hd :: tl)
723 | Ast.AttributedTerm (_, Ast.Appl (hd :: tl)) ->
727 return_term loc (Ast.Appl (aux p1 @ [p2]))
732 [ id = IDENT -> return_term loc (Ast.Ident (id, None))
733 | id = IDENT; s = explicit_subst ->
734 return_term loc (Ast.Ident (id, Some s))
735 | s = CSYMBOL -> return_term loc (Ast.Symbol (s, 0))
736 | u = URI -> return_term loc (Ast.Uri (u, None))
737 | r = NREF -> return_term loc (Ast.NRef (NReference.reference_of_string r))
738 | n = NUMBER -> return_term loc (Ast.Num (n, 0))
739 | IMPLICIT -> return_term loc (Ast.Implicit `JustOne)
740 | SYMBOL <:unicode<ldots>> -> return_term loc (Ast.Implicit `Vector)
741 | PLACEHOLDER -> return_term loc Ast.UserInput
742 | m = META -> return_term loc (Ast.Meta (int_of_string m, []))
743 | m = META; s = meta_substs ->
744 return_term loc (Ast.Meta (int_of_string m, s))
745 | s = sort -> return_term loc (Ast.Sort s)
747 indty_ident = OPT [ "in"; id = IDENT -> id, None ];
748 outtyp = OPT [ "return"; ty = term -> ty ];
751 lhs = match_pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *);
756 return_term loc (Ast.Case (t, indty_ident, outtyp, patterns))
757 | LPAREN; p1 = term; SYMBOL ":"; p2 = term; RPAREN ->
758 return_term loc (Ast.Cast (p1, p2))
759 | LPAREN; p = term; RPAREN -> p
760 | blob = UNPARSED_META ->
761 parse_level2_meta grammars (Ulexing.from_utf8_string blob)
770 let initial_grammars keywords =
771 let lexers = CicNotationLexer.mk_lexers keywords in
772 let level1_pattern_grammar =
773 Grammar.gcreate lexers.CicNotationLexer.level1_pattern_lexer in
774 let level2_ast_grammar =
775 Grammar.gcreate lexers.CicNotationLexer.level2_ast_lexer in
776 let level2_meta_grammar =
777 Grammar.gcreate lexers.CicNotationLexer.level2_meta_lexer in
779 Grammar.Entry.create level1_pattern_grammar "level1_pattern" in
780 let level2_ast = Grammar.Entry.create level2_ast_grammar "level2_ast" in
781 let term = Grammar.Entry.create level2_ast_grammar "term" in
782 let let_defs = Grammar.Entry.create level2_ast_grammar "let_defs" in
783 let protected_binder_vars =
784 Grammar.Entry.create level2_ast_grammar "protected_binder_vars" in
785 let level2_meta = Grammar.Entry.create level2_meta_grammar "level2_meta" in
786 initialize_grammars { level1_pattern=level1_pattern;
787 level2_ast=level2_ast;
790 protected_binder_vars=protected_binder_vars;
791 level2_meta=level2_meta;
792 level2_ast_grammar=level2_ast_grammar;
796 class type g_status =
798 method notation_parser_db: db
801 class status ~keywords:kwds =
803 val db = { grammars = initial_grammars kwds; keywords = kwds; items = [] }
804 method notation_parser_db = db
805 method set_notation_parser_db v = {< db = v >}
806 method set_notation_parser_status
807 : 'status. #g_status as 'status -> 'self
808 = fun o -> {< db = o#notation_parser_db >}
811 let extend (status : #status) (CL1P (level1_pattern,precedence)) action =
812 (* move inside constructor XXX *)
813 let add1item status (level, level1_pattern, action) =
814 let p_bindings, p_atoms =
815 List.split (extract_term_production status level1_pattern) in
818 (status#notation_parser_db.grammars.term : 'a Grammar.Entry.e),
819 Some (Gramext.Level level),
821 Some (*Gramext.NonA*) Gramext.NonA,
824 (fun (env: NotationEnv.t) (loc: Ast.location) ->
830 let level = level_of precedence in
831 level, level1_pattern, action in
832 let keywords = NotationUtil.keywords_of_term level1_pattern @
833 status#notation_parser_db.keywords in
834 let items = current_item :: status#notation_parser_db.items in
835 let status = status#set_notation_parser_status (new status ~keywords) in
836 let status = status#set_notation_parser_db
837 {status#notation_parser_db with items = items} in
838 List.fold_left add1item status items
842 let parse_level1_pattern status =
843 parse_level1_pattern status#notation_parser_db.grammars
844 let parse_level2_ast status =
845 parse_level2_ast status#notation_parser_db.grammars
846 let parse_level2_meta status =
847 parse_level2_meta status#notation_parser_db.grammars
848 let parse_term status =
849 parse_term status#notation_parser_db.grammars
851 let level2_ast_grammar status =
852 status#notation_parser_db.grammars.level2_ast_grammar
853 let term status = status#notation_parser_db.grammars.term
854 let let_defs status = status#notation_parser_db.grammars.let_defs
855 let protected_binder_vars status =
856 status#notation_parser_db.grammars.protected_binder_vars
860 let print_l2_pattern status =
861 Grammar.print_entry Format.std_formatter
862 (Grammar.Entry.obj status#notation_parser_db.grammars.term);
863 Format.pp_print_flush Format.std_formatter ();
866 (* vim:set encoding=utf8 foldmethod=marker: *)