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,'e) 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 ident: 'e Grammar.Entry.e;
45 let_defs: 'c Grammar.Entry.e;
46 let_codefs: 'c Grammar.Entry.e;
47 protected_binder_vars: 'd Grammar.Entry.e;
48 level2_meta: 'b Grammar.Entry.e;
51 type checked_l1_pattern = CL1P of NotationPt.term * int
53 let refresh_uri_in_checked_l1_pattern ~refresh_uri_in_term
54 ~refresh_uri_in_reference (CL1P (t,n))
56 CL1P (NotationUtil.refresh_uri_in_term ~refresh_uri_in_term
57 ~refresh_uri_in_reference t, n)
61 | Binding of string * Env.value_type
62 | Env of (string * Env.value_type) list
66 (int -> NotationPt.term,
68 (Ast.term Ast.capture_variable list *
69 Ast.term Ast.capture_variable * Ast.term * int) list,
70 Ast.term list * Ast.term option, Env.ident_or_var) grammars;
71 keywords: string list;
72 items: (string * Ast.term * (NotationEnv.t -> Ast.location -> Ast.term)) list
77 Pervasives.int_of_string s
79 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
81 (** {2 Grammar extension} *)
83 let level_of precedence =
84 if precedence < min_precedence || precedence > max_precedence then
85 raise (Level_not_found precedence);
86 string_of_int precedence
88 let gram_symbol s = Gramext.Stoken ("SYMBOL", s)
89 let gram_ident status =
90 Gramext.Snterm (Grammar.Entry.obj
91 (status#notation_parser_db.grammars.ident : 'a Grammar.Entry.e))
92 (*Gramext.Stoken ("IDENT", s)*)
93 let gram_number s = Gramext.Stoken ("NUMBER", s)
94 let gram_keyword s = Gramext.Stoken ("", s)
95 let gram_term status = function
96 | Ast.Self _ -> Gramext.Sself
97 | Ast.Level precedence ->
100 (status#notation_parser_db.grammars.term : 'a Grammar.Entry.e),
104 let gram_of_literal =
106 | `Symbol s -> gram_symbol s
107 | `Keyword s -> gram_keyword s
108 | `Number s -> gram_number s
110 let make_action action bindings =
111 let rec aux (vl : NotationEnv.t) =
113 [] -> Gramext.action (fun (loc: Ast.location) -> action vl loc)
114 | NoBinding :: tl -> Gramext.action (fun _ -> aux vl tl)
115 (* LUCA: DEFCON 3 BEGIN *)
116 | Binding (name, Env.TermType l) :: tl ->
119 aux ((name, (Env.TermType l, Env.TermValue v))::vl) tl)
120 | Binding (name, Env.StringType) :: tl ->
122 (fun (v:Env.ident_or_var) ->
123 aux ((name, (Env.StringType, Env.StringValue v)) :: vl) tl)
124 | Binding (name, Env.NumType) :: tl ->
127 aux ((name, (Env.NumType, Env.NumValue v)) :: vl) tl)
128 | Binding (name, Env.OptType t) :: tl ->
130 (fun (v:'a option) ->
131 aux ((name, (Env.OptType t, Env.OptValue v)) :: vl) tl)
132 | Binding (name, Env.ListType t) :: tl ->
135 aux ((name, (Env.ListType t, Env.ListValue v)) :: vl) tl)
137 Gramext.action (fun (v:NotationEnv.t) -> aux (v @ vl) tl)
138 (* LUCA: DEFCON 3 END *)
140 aux [] (List.rev bindings)
146 | NoBinding :: tl -> aux acc tl
147 | Env names :: tl -> aux (List.rev names @ acc) tl
148 | Binding (name, ty) :: tl -> aux ((name, ty) :: acc) tl
152 (* given a level 1 pattern computes the new RHS of "term" grammar entry *)
153 let extract_term_production status pattern =
154 let rec aux = function
155 | Ast.AttributedTerm (_, t) -> aux t
156 | Ast.Literal l -> aux_literal l
157 | Ast.Layout l -> aux_layout l
158 | Ast.Magic m -> aux_magic m
159 | Ast.Variable v -> aux_variable v
161 prerr_endline (NotationPp.pp_term status t);
165 | `Symbol s -> [NoBinding, gram_symbol s]
167 (* assumption: s will be registered as a keyword with the lexer *)
168 [NoBinding, gram_keyword s]
169 | `Number s -> [NoBinding, gram_number s]
170 and aux_layout = function
171 | Ast.Sub (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sub "] @ aux p2
172 | Ast.Sup (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\sup "] @ aux p2
173 | Ast.Below (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\below "] @ aux p2
174 | Ast.Above (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\above "] @ aux p2
175 | Ast.Frac (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\frac "] @ aux p2
176 | Ast.InfRule (p1, p2, p3) -> [NoBinding, gram_symbol "\\infrule "] @ aux p1 @ aux p2 @ aux p3
177 | Ast.Atop (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\atop "] @ aux p2
178 | Ast.Over (p1, p2) -> aux p1 @ [NoBinding, gram_symbol "\\over "] @ aux p2
179 | Ast.Root (p1, p2) ->
180 [NoBinding, gram_symbol "\\root "] @ aux p2
181 @ [NoBinding, gram_symbol "\\of "] @ aux p1
182 | Ast.Sqrt p -> [NoBinding, gram_symbol "\\sqrt "] @ aux p
184 | Ast.Box (_, pl) -> List.flatten (List.map aux pl)
185 | Ast.Group pl -> List.flatten (List.map aux pl)
186 | Ast.Mstyle (_,pl) -> List.flatten (List.map aux pl)
187 | Ast.Mpadded (_,pl) -> List.flatten (List.map aux pl)
188 | Ast.Maction l -> List.flatten (List.map aux l)
189 and aux_magic magic =
192 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
193 let action (env_opt : NotationEnv.t option) (loc : Ast.location) =
195 | Some env -> List.map Env.opt_binding_some env
196 | None -> List.map Env.opt_binding_of_name p_names
198 [ Env (List.map Env.opt_declaration p_names),
200 [ [ Gramext.Sopt (Gramext.srules [ p_atoms, p_action ]) ],
201 Gramext.action action ] ]
203 | Ast.List1 (p, _) ->
204 let p_bindings, p_atoms, p_names, p_action = inner_pattern p in
205 let action (env_list : NotationEnv.t list) (loc : Ast.location) =
206 NotationEnv.coalesce_env p_names env_list
210 | Ast.List0 (_, None) -> Gramext.Slist0 s
211 | Ast.List1 (_, None) -> Gramext.Slist1 s
212 (* | Ast.List0 (_, Some l) -> Gramext.Slist0sep (s, gram_of_literal l,false)
213 | Ast.List1 (_, Some l) -> Gramext.Slist1sep (s, gram_of_literal l,false)*)
214 | Ast.List0 (_, Some l) -> Gramext.Slist0sep (s, gram_of_literal l)
215 | Ast.List1 (_, Some l) -> Gramext.Slist1sep (s, gram_of_literal l)
218 [ Env (List.map Env.list_declaration p_names),
220 [ [ gram_of_list (Gramext.srules [ p_atoms, p_action ]) ],
221 Gramext.action action ] ]
225 | Ast.NumVar s -> [Binding (s, Env.NumType), gram_number ""]
226 | Ast.TermVar (s,(Ast.Self level|Ast.Level level as lv)) ->
227 [Binding (s, Env.TermType level), gram_term status lv]
228 | Ast.IdentVar s -> [Binding (s, Env.StringType), gram_ident status]
229 | Ast.Ascription (p, s) -> assert false (* TODO *)
230 | Ast.FreshVar _ -> assert false
231 and inner_pattern p =
232 let p_bindings, p_atoms = List.split (aux p) in
233 let p_names = flatten_opt p_bindings in
235 make_action (fun (env : NotationEnv.t) (loc : Ast.location) -> env)
238 p_bindings, p_atoms, p_names, action
242 type rule_id = Grammar.token Gramext.g_symbol list
244 let compare_rule_id x y =
245 let rec aux = function
249 | ((s1::tl1) as x),((s2::tl2) as y) ->
250 if Gramext.eq_symbol s1 s2 then aux (tl1,tl2)
251 else Pervasives.compare x y
256 let check_l1_pattern level1_pattern pponly level associativity =
257 let variables = ref 0 in
258 let symbols = ref 0 in
259 let rec aux = function
260 | Ast.AttributedTerm (att, t) -> Ast.AttributedTerm (att,aux t)
261 | Ast.Literal _ as l -> incr symbols; l
262 | Ast.Layout l -> Ast.Layout (aux_layout l)
263 | Ast.Magic m -> Ast.Magic (aux_magic m)
264 | Ast.Variable v -> (aux_variable v)
266 and aux_layout = function
267 | Ast.Sub (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sub (p1, p2)
268 | Ast.Sup (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Sup (p1, p2)
269 | Ast.Below (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Below (p1, p2)
270 | Ast.Above (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Above (p1, p2)
271 | Ast.Frac (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Frac (p1, p2)
272 | 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)
273 | Ast.Atop (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Atop (p1, p2)
274 | Ast.Over (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Over (p1, p2)
275 | Ast.Root (p1, p2) -> let p1 = aux p1 in let p2 = aux p2 in Ast.Root (p1, p2)
276 | Ast.Sqrt p -> Ast.Sqrt (aux p)
277 | Ast.Break as t -> t
278 | Ast.Box (b, pl) -> Ast.Box(b, List.map aux pl)
279 | Ast.Group pl -> Ast.Group (List.map aux pl)
280 | Ast.Mstyle (l,pl) -> Ast.Mstyle (l, List.map aux pl)
281 | Ast.Mpadded (l,pl) -> Ast.Mpadded (l, List.map aux pl)
282 | Ast.Maction l as t ->
284 raise(Parse_error("Maction can be used only in output notations"))
286 and aux_magic magic =
288 | Ast.Opt p -> Ast.Opt (aux p)
289 | Ast.List0 (p, x) -> Ast.List0 (aux p, x)
290 | Ast.List1 (p, x) -> Ast.List1 (aux p, x)
294 | Ast.NumVar _ as t -> Ast.Variable t
295 | Ast.TermVar (s,Ast.Self _) when associativity <> Gramext.NonA ->
297 if !variables > 2 then
298 raise (Parse_error ("Exactly 2 variables must be specified in an "^
299 "associative notation"));
300 (match !variables, associativity with
302 Ast.Variable (Ast.TermVar (s, Ast.Self level))
303 | 1,Gramext.RightA ->
304 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
306 Ast.Variable (Ast.TermVar (s, Ast.Self (level+1)))
307 | 2,Gramext.RightA ->
308 Ast.Variable (Ast.TermVar (s, Ast.Level (level-1)))
310 | Ast.TermVar (s,Ast.Level _) when associativity <> Gramext.NonA ->
311 raise (Parse_error ("Variables can not be declared with a " ^
312 "precedence in an associative notation"))
313 (*avoid camlp5 divergence due to non-Sself recursion at the same level *)
314 | Ast.TermVar (s,Ast.Level l) when l<=level && !variables=0 && !symbols=0->
315 raise(Parse_error("Left recursive rule with precedence not greater " ^
316 "than " ^ string_of_int level ^ " is not allowed to avoid divergence"))
317 | Ast.TermVar _ as t -> incr variables; Ast.Variable t
318 | Ast.IdentVar _ as t -> Ast.Variable t
319 | Ast.Ascription _ -> assert false (* TODO *)
320 | Ast.FreshVar _ -> assert false
322 if associativity <> Gramext.NonA && level = min_precedence then
323 raise (Parse_error ("You can not specify an associative notation " ^
324 "at level "^string_of_int min_precedence ^ "; increase it"));
325 let cp = aux level1_pattern in
326 (* prerr_endline ("checked_pattern: " ^ NotationPp.pp_term cp); *)
327 if !variables <> 2 && associativity <> Gramext.NonA then
328 raise (Parse_error ("Exactly 2 variables must be specified in an "^
329 "associative notation"));
335 let fold_cluster binder terms ty body =
337 (fun term body -> Ast.Binder (binder, (term, ty), body))
338 terms body (* terms are names: either Ident or FreshVar *)
340 let fold_exists terms ty body =
343 let lambda = Ast.Binder (`Lambda, (term, ty), body) in
344 Ast.Appl [ Ast.Symbol ("exists", 0); lambda ])
347 let fold_binder binder pt_names body =
349 (fun (names, ty) body -> fold_cluster binder names ty body)
352 let return_term loc term = Ast.AttributedTerm (`Loc loc, term)
353 let return_term_of_level loc term l =
354 Ast.AttributedTerm (`Loc loc, term l)
356 (** {2 API implementation} *)
358 let exc_located_wrapper f =
362 | Stdpp.Exc_located (floc, Stream.Error msg) ->
363 raise (HExtlib.Localized (floc, Parse_error msg))
364 | Stdpp.Exc_located (floc, HExtlib.Localized (_,exn)) ->
365 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
366 | Stdpp.Exc_located (floc, exn) ->
367 raise (HExtlib.Localized (floc, (Parse_error (Printexc.to_string exn))))
369 let parse_level1_pattern grammars precedence lexbuf =
371 (fun () -> Grammar.Entry.parse grammars.level1_pattern (Obj.magic lexbuf) precedence)
373 let parse_level2_ast grammars lexbuf =
375 (fun () -> Grammar.Entry.parse grammars.level2_ast (Obj.magic lexbuf))
377 let parse_level2_meta grammars lexbuf =
379 (fun () -> Grammar.Entry.parse grammars.level2_meta (Obj.magic lexbuf))
381 (* create empty precedence level for "term" *)
382 let initialize_grammars grammars =
384 Gramext.action (fun _ ->
385 failwith "internal error, lexer generated a dummy token")
387 (* Needed since campl4 on "delete_rule" remove the precedence level if it gets
388 * empty after the deletion. The lexer never generate the Stoken below. *)
389 let dummy_prod = [ [ Gramext.Stoken ("DUMMY", "") ], dummy_action ] in
390 let mk_level_list first last =
391 let rec aux acc = function
392 | i when i < first -> acc
395 ((Some (level_of i), Some Gramext.NonA, dummy_prod)
402 [ Grammar.Entry.obj (grammars.term: 'a Grammar.Entry.e),
404 mk_level_list min_precedence max_precedence ];
405 (* {{{ Grammar for concrete syntax patterns, notation level 1 *)
407 let level1_pattern = grammars.level1_pattern in
409 GLOBAL: level1_pattern;
412 [ p = l1_pattern; EOI -> fun l -> NotationUtil.boxify (p l) ]
415 [ p = LIST1 l1_simple_pattern ->
416 fun l -> List.map (fun x -> x l) p ]
419 [ s = SYMBOL -> `Symbol s
420 | k = QKEYWORD -> `Keyword k
421 | n = NUMBER -> `Number n
424 sep: [ [ "sep"; sep = literal -> sep ] ];
426 [ "list0"; p = l1_simple_pattern; sep = OPT sep ->
427 fun l -> Ast.List0 (p l, sep)
428 | "list1"; p = l1_simple_pattern; sep = OPT sep ->
429 fun l -> Ast.List1 (p l, sep)
430 | "opt"; p = l1_simple_pattern -> fun l -> Ast.Opt (p l)
433 l1_pattern_variable: [
434 [ "term"; precedence = NUMBER; id = IDENT ->
435 Ast.TermVar (id, Ast.Level (int_of_string precedence))
436 | "number"; id = IDENT -> Ast.NumVar id
437 | "ident"; id = IDENT -> Ast.IdentVar id
442 v = [ IDENT | NUMBER | COLOR | FLOATWITHUNIT ] -> id, v]];
445 v = [ PERCENTAGE ] -> id, v]];
448 [ p1 = SELF; SYMBOL "\\sub "; p2 = SELF ->
449 return_term_of_level loc
450 (fun l -> Ast.Layout (Ast.Sub (p1 l, p2 l)))
451 | p1 = SELF; SYMBOL "\\sup "; p2 = SELF ->
452 return_term_of_level loc
453 (fun l -> Ast.Layout (Ast.Sup (p1 l, p2 l)))
454 | p1 = SELF; SYMBOL "\\below "; p2 = SELF ->
455 return_term_of_level loc
456 (fun l -> Ast.Layout (Ast.Below (p1 l, p2 l)))
457 | p1 = SELF; SYMBOL "\\above "; p2 = SELF ->
458 return_term_of_level loc
459 (fun l -> Ast.Layout (Ast.Above (p1 l, p2 l)))
460 | p1 = SELF; SYMBOL "\\over "; p2 = SELF ->
461 return_term_of_level loc
462 (fun l -> Ast.Layout (Ast.Over (p1 l, p2 l)))
463 | p1 = SELF; SYMBOL "\\atop "; p2 = SELF ->
464 return_term_of_level loc
465 (fun l -> Ast.Layout (Ast.Atop (p1 l, p2 l)))
466 | p1 = SELF; SYMBOL "\\frac "; p2 = SELF ->
467 return_term_of_level loc
468 (fun l -> Ast.Layout (Ast.Frac (p1 l, p2 l)))
469 | SYMBOL "\\infrule "; p1 = SELF; p2 = SELF; p3 = SELF ->
470 return_term_of_level loc
471 (fun l -> Ast.Layout (Ast.InfRule (p1 l, p2 l, p3 l)))
472 | SYMBOL "\\sqrt "; p = SELF ->
473 return_term_of_level loc (fun l -> Ast.Layout (Ast.Sqrt p l))
474 | SYMBOL "\\root "; index = SELF; SYMBOL "\\of "; arg = SELF ->
475 return_term_of_level loc
476 (fun l -> Ast.Layout (Ast.Root (arg l, index l)))
477 | "hbox"; LPAREN; p = l1_pattern; RPAREN ->
478 return_term_of_level loc
479 (fun l -> Ast.Layout (Ast.Box ((Ast.H, false, false), p l)))
480 | "vbox"; LPAREN; p = l1_pattern; RPAREN ->
481 return_term_of_level loc
482 (fun l -> Ast.Layout (Ast.Box ((Ast.V, false, false), p l)))
483 | "hvbox"; LPAREN; p = l1_pattern; RPAREN ->
484 return_term_of_level loc
485 (fun l -> Ast.Layout (Ast.Box ((Ast.HV, false, false), p l)))
486 | "hovbox"; LPAREN; p = l1_pattern; RPAREN ->
487 return_term_of_level loc
488 (fun l -> Ast.Layout (Ast.Box ((Ast.HOV, false, false), p l)))
489 | "break" -> return_term_of_level loc (fun _ -> Ast.Layout Ast.Break)
490 | "mstyle"; m = LIST1 mstyle ; LPAREN; t = l1_pattern; RPAREN ->
491 return_term_of_level loc
493 Ast.Layout (Ast.Mstyle (m, t l)))
494 | "mpadded"; m = LIST1 mpadded ; LPAREN; t = l1_pattern; RPAREN ->
495 return_term_of_level loc
497 Ast.Layout (Ast.Mpadded (m, t l)))
498 | "maction"; m = LIST1 [ LPAREN; l = l1_pattern; RPAREN -> l ] ->
499 return_term_of_level loc
500 (fun l -> Ast.Layout (Ast.Maction (List.map (fun x ->
501 NotationUtil.group (x l)) m)))
502 | LPAREN; p = l1_pattern; RPAREN ->
503 return_term_of_level loc (fun l -> NotationUtil.group (p l))
507 return_term_of_level loc
508 (fun l -> Ast.Variable (Ast.TermVar (i,Ast.Self l)))
509 | m = l1_magic_pattern ->
510 return_term_of_level loc (fun l -> Ast.Magic (m l))
511 | v = l1_pattern_variable ->
512 return_term_of_level loc (fun _ -> Ast.Variable v)
513 | l = literal -> return_term_of_level loc (fun _ -> Ast.Literal l)
519 (* {{{ Grammar for ast magics, notation level 2 *)
521 let level2_meta = grammars.level2_meta in
525 [ "term"; precedence = NUMBER; id = IDENT ->
526 Ast.TermVar (id,Ast.Level (int_of_string precedence))
527 | "number"; id = IDENT -> Ast.NumVar id
528 | "ident"; id = IDENT -> Ast.IdentVar id
529 | "fresh"; id = IDENT -> Ast.FreshVar id
530 | "anonymous" -> Ast.TermVar ("_",Ast.Self 0) (* is the level relevant?*)
531 | id = IDENT -> Ast.TermVar (id,Ast.Self 0)
535 [ "fold"; kind = [ "left" -> `Left | "right" -> `Right ];
536 base = level2_meta; "rec"; id = IDENT; recursive = level2_meta ->
537 Ast.Fold (kind, base, [id], recursive)
538 | "default"; some = level2_meta; none = level2_meta ->
539 Ast.Default (some, none)
540 | "if"; p_test = level2_meta;
541 "then"; p_true = level2_meta;
542 "else"; p_false = level2_meta ->
543 Ast.If (p_test, p_true, p_false)
548 [ magic = l2_magic -> Ast.Magic magic
549 | var = l2_variable -> Ast.Variable var
550 | blob = UNPARSED_AST ->
551 parse_level2_ast grammars (Ulexing.from_utf8_string blob)
557 (* {{{ Grammar for ast patterns, notation level 2 *)
559 let level2_ast = grammars.level2_ast in
560 let term = grammars.term in
561 let let_defs = grammars.let_defs in
562 let let_codefs = grammars.let_codefs in
563 let ident = grammars.ident in
564 let protected_binder_vars = grammars.protected_binder_vars in
566 GLOBAL: level2_ast term let_defs let_codefs protected_binder_vars ident;
567 level2_ast: [ [ p = term -> p ] ];
571 | "Type"; SYMBOL "["; n = [ NUMBER| IDENT ]; SYMBOL "]" -> `NType n
572 | "CProp"; SYMBOL "["; n = [ NUMBER| IDENT ]; SYMBOL "]" -> `NCProp n
576 [ SYMBOL "\\subst "; (* to avoid catching frequent "a [1]" cases *)
579 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
586 [ s = SYMBOL "_" -> None
587 | p = term -> Some p ]
590 [ SYMBOL "["; substs = LIST0 meta_subst; SYMBOL "]" -> substs ]
592 possibly_typed_name: [
593 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
595 | arg = single_arg -> arg, None
596 | id = PIDENT -> Ast.Ident (id, None), None
597 | SYMBOL "_" -> Ast.Ident ("_", None), None
598 | LPAREN; id = PIDENT; SYMBOL ":"; typ = term; RPAREN ->
599 Ast.Ident (id, None), Some typ
600 | LPAREN; SYMBOL "_"; SYMBOL ":"; typ = term; RPAREN ->
601 Ast.Ident ("_", None), Some typ
605 [ SYMBOL "_" -> Ast.Wildcard
606 | id = IDENT -> Ast.Pattern (id, None, [])
607 | LPAREN; id = IDENT; vars = LIST1 possibly_typed_name; RPAREN ->
608 Ast.Pattern (id, None, vars)
609 | id = IDENT; vars = LIST1 possibly_typed_name ->
610 Ast.Pattern (id, None, vars)
614 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
615 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall
616 | SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda
620 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
621 SYMBOL ":"; ty = term; RPAREN ->
622 List.map (fun n -> Ast.Ident (n, None)) names, Some ty
623 | name = IDENT -> [Ast.Ident (name, None)], None
624 | blob = UNPARSED_META ->
625 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
627 | Ast.Variable (Ast.FreshVar _) -> [meta], None
628 | Ast.Variable (Ast.TermVar ("_",_)) -> [Ast.Ident ("_", None)], None
629 | _ -> failwith "Invalid bound name."
633 [ name = IDENT -> Ast.Ident (name, None)
634 | blob = UNPARSED_META ->
635 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
637 | Ast.Variable (Ast.FreshVar _)
638 | Ast.Variable (Ast.IdentVar _) -> meta
639 | Ast.Variable (Ast.TermVar ("_",_)) -> Ast.Ident ("_", None)
640 | _ -> failwith "Invalid index name."
644 [ name = IDENT -> Env.Ident name
645 | blob = UNPARSED_META ->
646 let meta = parse_level2_meta grammars (Ulexing.from_utf8_string blob) in
648 | Ast.Variable (Ast.FreshVar _) ->
649 (* it makes sense: extend Env.ident_or_var *)
651 | Ast.Variable (Ast.IdentVar name) -> Env.Var name
652 | Ast.Variable (Ast.TermVar ("_",_)) -> Env.Var "_"
653 | _ -> failwith ("Invalid index name: " ^ blob)
660 index_name = OPT [ "on"; id = single_arg -> id ];
661 ty = OPT [ SYMBOL ":" ; p = term -> p ];
662 SYMBOL <:unicode<def>> (* ≝ *); body = term ->
663 let rec position_of name p = function
665 | n :: _ when n = name -> Some p, p
666 | _ :: tl -> position_of name (p + 1) tl
668 let rec find_arg name n = function
670 (* CSC: new NCicPp.status is the best I can do here
671 without changing the return type *)
672 Ast.fail loc (sprintf "Argument %s not found"
673 (NotationPp.pp_term (new NCicPp.status) name))
675 (match position_of name 0 l with
676 | None, len -> find_arg name (n + len) tl
677 | Some where, len -> n + where)
680 match index_name with
682 | Some index_name -> find_arg index_name 0 args
687 (function (names,ty) -> List.map (function x -> x,ty) names
690 args, (name, ty), body, index
699 ty = OPT [ SYMBOL ":" ; p = term -> p ];
700 SYMBOL <:unicode<def>> (* ≝ *); body = term ->
704 (function (names,ty) -> List.map (function x -> x,ty) names
707 args, (name, ty), body, 0
714 [ l = LIST1 single_arg SEP SYMBOL "," -> l
715 | l = LIST1 [ PIDENT | SYMBOL "_" ] SEP SYMBOL "," ->
716 List.map (fun x -> Ast.Ident(x,None)) l
718 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
721 protected_binder_vars: [
722 [ LPAREN; vars = binder_vars; RPAREN -> vars
725 maybe_protected_binder_vars: [
726 [ vars = binder_vars -> vars
727 | vars = protected_binder_vars -> vars
734 [ LPAREN; id = single_arg; SYMBOL ":"; typ = term; RPAREN ->
736 | id = IDENT; ty = OPT [ SYMBOL ":"; typ = term -> typ] ->
737 Ast.Ident(id,None), ty ];
738 SYMBOL <:unicode<def>> (* ≝ *);
739 p1 = term; "in"; p2 = term ->
740 return_term loc (Ast.LetIn (var, p1, p2))
745 [ b = binder; (vars, typ) = maybe_protected_binder_vars; SYMBOL "."; body = term LEVEL "19" ->
746 return_term loc (fold_cluster b vars typ body)
751 [ p1 = term; p2 = term LEVEL "71" ->
752 let rec aux = function
753 | Ast.Appl (hd :: tl)
754 | Ast.AttributedTerm (_, Ast.Appl (hd :: tl)) ->
758 return_term loc (Ast.Appl (aux p1 @ [p2]))
763 [ id = IDENT -> return_term loc (Ast.Ident (id, None))
764 | id = IDENT; s = explicit_subst ->
765 return_term loc (Ast.Ident (id, Some s))
766 | s = CSYMBOL -> return_term loc (Ast.Symbol (s, 0))
767 | u = URI -> return_term loc (Ast.Uri (u, None))
768 | r = NREF -> return_term loc (Ast.NRef (NReference.reference_of_string r))
769 | n = NUMBER -> return_term loc (Ast.Num (n, 0))
770 | IMPLICIT -> return_term loc (Ast.Implicit `JustOne)
771 | SYMBOL <:unicode<ldots>> -> return_term loc (Ast.Implicit `Vector)
772 | PLACEHOLDER -> return_term loc Ast.UserInput
773 | m = META -> return_term loc (Ast.Meta (int_of_string m, []))
774 | m = META; s = meta_substs ->
775 return_term loc (Ast.Meta (int_of_string m, s))
776 | s = sort -> return_term loc (Ast.Sort s)
778 indty_ident = OPT [ "in"; id = IDENT -> id, None ];
779 outtyp = OPT [ "return"; ty = term -> ty ];
782 lhs = match_pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *);
787 return_term loc (Ast.Case (t, indty_ident, outtyp, patterns))
788 | LPAREN; p1 = term; SYMBOL ":"; p2 = term; RPAREN ->
789 return_term loc (Ast.Cast (p1, p2))
790 | LPAREN; p = term; RPAREN -> p
791 | blob = UNPARSED_META ->
792 parse_level2_meta grammars (Ulexing.from_utf8_string blob)
801 let initial_grammars keywords =
802 let lexers = CicNotationLexer.mk_lexers keywords in
803 let level1_pattern_grammar =
804 Grammar.gcreate lexers.CicNotationLexer.level1_pattern_lexer in
805 let level2_ast_grammar =
806 Grammar.gcreate lexers.CicNotationLexer.level2_ast_lexer in
807 let level2_meta_grammar =
808 Grammar.gcreate lexers.CicNotationLexer.level2_meta_lexer in
810 Grammar.Entry.create level1_pattern_grammar "level1_pattern" in
811 let level2_ast = Grammar.Entry.create level2_ast_grammar "level2_ast" in
812 let term = Grammar.Entry.create level2_ast_grammar "term" in
813 let ident = Grammar.Entry.create level2_ast_grammar "ident" in
814 let let_defs = Grammar.Entry.create level2_ast_grammar "let_defs" in
815 let let_codefs = Grammar.Entry.create level2_ast_grammar "let_codefs" in
816 let protected_binder_vars =
817 Grammar.Entry.create level2_ast_grammar "protected_binder_vars" in
818 let level2_meta = Grammar.Entry.create level2_meta_grammar "level2_meta" in
819 initialize_grammars { level1_pattern=level1_pattern;
820 level2_ast=level2_ast;
824 let_codefs=let_codefs;
825 protected_binder_vars=protected_binder_vars;
826 level2_meta=level2_meta;
827 level2_ast_grammar=level2_ast_grammar;
831 class type g_status =
833 method notation_parser_db: db
836 class status0 ~keywords:kwds =
838 val db = { grammars = initial_grammars kwds; keywords = kwds; items = [] }
839 method notation_parser_db = db
840 method set_notation_parser_db v = {< db = v >}
841 method set_notation_parser_status
842 : 'status. #g_status as 'status -> 'self
843 = fun o -> {< db = o#notation_parser_db >}
846 class virtual status ~keywords:kwds =
852 let extend (status : #status) (CL1P (level1_pattern,precedence)) action =
853 (* move inside constructor XXX *)
854 let add1item status (level, level1_pattern, action) =
855 let p_bindings, p_atoms =
856 List.split (extract_term_production status level1_pattern) in
859 (status#notation_parser_db.grammars.term : 'a Grammar.Entry.e),
860 Some (Gramext.Level level),
862 Some (*Gramext.NonA*) Gramext.NonA,
865 (fun (env: NotationEnv.t) (loc: Ast.location) ->
871 let level = level_of precedence in
872 level, level1_pattern, action in
873 let keywords = NotationUtil.keywords_of_term level1_pattern @
874 status#notation_parser_db.keywords in
875 let items = current_item :: status#notation_parser_db.items in
876 let status = status#set_notation_parser_status (new status0 ~keywords) in
877 let status = status#set_notation_parser_db
878 {status#notation_parser_db with items = items} in
879 List.fold_left add1item status items
883 let parse_level1_pattern status =
884 parse_level1_pattern status#notation_parser_db.grammars
885 let parse_level2_ast status =
886 parse_level2_ast status#notation_parser_db.grammars
887 let parse_level2_meta status =
888 parse_level2_meta status#notation_parser_db.grammars
890 let level2_ast_grammar status =
891 status#notation_parser_db.grammars.level2_ast_grammar
892 let term status = status#notation_parser_db.grammars.term
893 let let_defs status = status#notation_parser_db.grammars.let_defs
894 let let_codefs status = status#notation_parser_db.grammars.let_codefs
895 let protected_binder_vars status =
896 status#notation_parser_db.grammars.protected_binder_vars
900 let print_l2_pattern status =
901 Grammar.print_entry Format.std_formatter
902 (Grammar.Entry.obj status#notation_parser_db.grammars.term);
903 Format.pp_print_flush Format.std_formatter ();
906 (* vim:set encoding=utf8 foldmethod=marker: *)