1 (* Copyright (C) 2004, 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/
29 prerr_endline "<NEW_TEXTUAL_PARSER>";
31 prerr_endline "</NEW_TEXTUAL_PARSER>"
34 (** if set to true each number will have a different insance number and can
35 * thus be interpreted differently than others *)
36 let use_fresh_num_instances = false
38 (** does the lexer return COMMENT tokens? *)
39 let return_comments = false
43 open DisambiguateTypes
45 exception Parse_error of Token.flocation * string
47 let cic_lexer = CicTextualLexer2.cic_lexer ~comments:return_comments ()
49 let fresh_num_instance =
51 if use_fresh_num_instances then
52 (fun () -> incr n; !n)
56 let choice_of_uri suri =
57 let term = CicUtil.term_of_uri (UriManager.uri_of_string suri) in
58 (suri, (fun _ _ _ -> term))
60 let grammar = Grammar.gcreate cic_lexer
62 let term = Grammar.Entry.create grammar "term"
63 let term0 = Grammar.Entry.create grammar "term0"
64 let tactic = Grammar.Entry.create grammar "tactic"
65 let tactical = Grammar.Entry.create grammar "tactical"
66 let tactical0 = Grammar.Entry.create grammar "tactical0"
67 let command = Grammar.Entry.create grammar "command"
68 let alias_spec = Grammar.Entry.create grammar "alias_spec"
69 let macro = Grammar.Entry.create grammar "macro"
70 let script = Grammar.Entry.create grammar "script"
71 let statement = Grammar.Entry.create grammar "statement"
72 let statements = Grammar.Entry.create grammar "statements"
74 let return_term loc term = CicAst.AttributedTerm (`Loc loc, term)
77 let (x, y) = CicAst.loc_of_floc floc in
78 failwith (Printf.sprintf "Error at characters %d - %d: %s" x y msg)
80 let name_of_string = function
81 | "_" -> Cic.Anonymous
84 let string_of_name = function
85 | Cic.Anonymous -> "_"
88 let int_opt = function
90 | Some lexeme -> Some (int_of_string lexeme)
94 Pervasives.int_of_string s
96 failwith (sprintf "Lexer failure: string_of_int \"%s\" failed" s)
98 (** the uri of an inductive type (a ".ind" uri) is not meaningful without an
99 * xpointer. Still, it's likely that an user who wrote "cic:/blabla/foo.ind"
100 * actually meant "cic:/blabla/foo.ind#xpointer(1/1)", i.e. the first inductive
101 * type in a block of mutual inductive types.
103 * This function performs the expansion foo.ind -> foo#xpointer..., if needed
105 let ind_expansion uri =
106 let len = String.length uri in
107 if len >= 4 && String.sub uri (len - 4) 4 = ".ind" then
108 uri ^ "#xpointer(1/1)"
112 let mk_binder_ast binder typ vars body =
115 let name = name_of_string var in
116 CicAst.Binder (binder, (name, typ), body))
120 GLOBAL: term term0 statement statements;
125 with Failure _ -> raise (Parse_error (loc, "integer literal expected"))
129 [ s = SYMBOL "_" -> None
130 | t = term -> Some t ]
133 [ SYMBOL <:unicode<Pi>> (* Π *) -> `Pi
134 | SYMBOL <:unicode<exists>> (* ∃ *) -> `Exists
135 | SYMBOL <:unicode<forall>> (* ∀ *) -> `Forall ]
137 binder_high: [ [ SYMBOL <:unicode<lambda>> (* λ *) -> `Lambda ] ];
142 | "CProp" -> `CProp ]
145 [ PAREN "("; i = IDENT; SYMBOL ":"; typ = term; PAREN ")" ->
146 (Cic.Name i, Some typ)
147 | i = IDENT -> (Cic.Name i, None)
151 [ SYMBOL "\\subst"; (* to avoid catching frequent "a [1]" cases *)
154 i = IDENT; SYMBOL <:unicode<Assign>> (* ≔ *); t = term -> (i, t)
160 substituted_name: [ (* a subs.name is an explicit substitution subject *)
161 [ s = IDENT; subst = OPT subst -> CicAst.Ident (s, subst)
162 | s = URI; subst = OPT subst -> CicAst.Uri (ind_expansion s, subst)
165 name: [ (* as substituted_name with no explicit substitution *)
166 [ s = [ IDENT | SYMBOL ] -> s ]
169 [ n = name -> (n, [])
170 | PAREN "("; head = name; vars = LIST1 typed_name; PAREN ")" ->
175 [ PAREN "(" ; names = LIST1 IDENT SEP SYMBOL ",";
176 SYMBOL ":"; ty = term; PAREN ")" -> names,ty
177 | name = IDENT -> [name],CicAst.Implicit
183 args = LIST1 [arg = arg -> arg];
184 index_name = OPT [ IDENT "on"; idx = IDENT -> idx ];
185 ty = OPT [ SYMBOL ":" ; t = term -> t ];
186 SYMBOL <:unicode<def>> (* ≝ *);
188 let rec list_of_binder binder ty final_term = function
191 CicAst.Binder (binder, (Cic.Name name, Some ty),
192 list_of_binder binder ty final_term tl)
194 let rec binder_of_arg_list binder final_term = function
197 list_of_binder binder ty
198 (binder_of_arg_list binder final_term tl) l
200 let t1' = binder_of_arg_list `Lambda t1 args in
204 | Some ty -> Some (binder_of_arg_list `Pi ty args)
206 let rec get_position_of name n = function
212 (get_position_of name (n+1) tl)
214 let rec find_arg name n = function
215 | [] -> (fail loc (sprintf "Argument %s not found" name))
217 let (got,len) = get_position_of name 0 l in
219 | None -> (find_arg name (n+len) tl)
220 | Some where -> n + where)
223 (match index_name with
225 | (Some name) -> find_arg name 0 args)
227 ((Cic.Name name,ty'), t1', index)
230 constructor: [ [ name = IDENT; SYMBOL ":"; typ = term -> (name, typ) ] ];
232 [ vars = [ l = LIST1 IDENT SEP SYMBOL "," -> l | SYMBOL "_" -> ["_"]];
233 typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ)
235 vars = [ l = LIST1 IDENT SEP SYMBOL "," -> l | SYMBOL "_" -> ["_"]];
236 typ = OPT [ SYMBOL ":"; t = term -> t ];
237 PAREN ")" -> (vars, typ)
240 term0: [ [ t = term; EOI -> return_term loc t ] ];
243 [ "let"; var = typed_name;
244 SYMBOL <:unicode<def>> (* ≝ *);
245 t1 = term; "in"; t2 = term ->
246 return_term loc (CicAst.LetIn (var, t1, t2))
247 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
248 defs = let_defs; "in"; body = term ->
249 return_term loc (CicAst.LetRec (ind_kind, defs, body))
253 b = binder_low; (vars, typ) = binder_vars; SYMBOL "."; body = term ->
254 let binder = mk_binder_ast b typ vars body in
255 return_term loc binder
256 | b = binder_high; (vars, typ) = binder_vars; SYMBOL "."; body = term ->
257 let binder = mk_binder_ast b typ vars body in
258 return_term loc binder
259 | t1 = term; SYMBOL <:unicode<to>> (* → *); t2 = term ->
260 return_term loc (CicAst.Binder (`Pi, (Cic.Anonymous, Some t1), t2))
262 | "logic_add" LEFTA [ (* nothing here by default *) ]
263 | "logic_mult" LEFTA [ (* nothing here by default *) ]
264 | "logic_inv" NONA [ (* nothing here by default *) ]
266 [ t1 = term; SYMBOL "="; t2 = term ->
267 return_term loc (CicAst.Appl [CicAst.Symbol ("eq", 0); t1; t2])
269 | "add" LEFTA [ (* nothing here by default *) ]
270 | "mult" LEFTA [ (* nothing here by default *) ]
271 | "power" LEFTA [ (* nothing here by default *) ]
272 | "inv" NONA [ (* nothing here by default *) ]
274 [ t1 = term; t2 = term ->
275 let rec aux = function
276 | CicAst.Appl (hd :: tl) -> aux hd @ tl
279 CicAst.Appl (aux t1 @ [t2])
282 [ sort = sort -> CicAst.Sort sort
283 | n = substituted_name -> return_term loc n
284 | i = NUM -> return_term loc (CicAst.Num (i, (fresh_num_instance ())))
285 | IMPLICIT -> return_term loc CicAst.Implicit
286 | PLACEHOLDER -> return_term loc CicAst.UserInput
289 PAREN "["; substs = LIST0 meta_subst SEP SYMBOL ";" ; PAREN "]" ->
294 int_of_string (String.sub m 1 (String.length m - 1))
295 with Failure "int_of_string" ->
296 fail loc ("Invalid meta variable number: " ^ m)
298 return_term loc (CicAst.Meta (index, substs))
299 | outtyp = OPT [ PAREN "["; typ = term; PAREN "]" -> typ ];
301 indty_ident = OPT ["in" ; id = IDENT -> id ];
305 lhs = pattern; SYMBOL <:unicode<Rightarrow>> (* ⇒ *); rhs = term
307 ((lhs: CicAst.case_pattern), rhs)
311 (CicAst.Case (t, indty_ident, outtyp, patterns))
312 | PAREN "("; t1 = term; SYMBOL ":"; t2 = term; PAREN ")" ->
313 return_term loc (CicAst.Appl [CicAst.Symbol ("cast", 0); t1; t2])
314 | PAREN "("; t = term; PAREN ")" -> return_term loc t
317 tactic_term: [ [ t = term -> t ] ];
319 [ PAREN "["; idents = LIST0 IDENT SEP SYMBOL ";"; PAREN "]" -> idents ]
322 [ [ IDENT "reduce" ] -> `Reduce
323 | [ IDENT "simplify" ] -> `Simpl
324 | [ IDENT "whd" ] -> `Whd
325 | [ IDENT "normalize" ] -> `Normalize ]
332 path = OPT [SYMBOL ":" ; path = term -> path ] ->
333 (id,match path with Some p -> p | None -> CicAst.UserInput) ]
335 goal_path = OPT [ SYMBOL <:unicode<vdash>>; term = term -> term ] ->
336 (hyp_paths, goal_path) ]
339 [ IDENT "left" -> `Left
340 | SYMBOL ">" -> `Left
341 | IDENT "right" -> `Right
342 | SYMBOL "<" -> `Right ]
345 [ IDENT "absurd"; t = tactic_term ->
346 TacticAst.Absurd (loc, t)
347 | IDENT "apply"; t = tactic_term ->
348 TacticAst.Apply (loc, t)
349 | IDENT "assumption" ->
350 TacticAst.Assumption loc
352 depth = OPT [ IDENT "depth"; SYMBOL "="; i = NUM -> int_of_string i ];
353 width = OPT [ IDENT "depth"; SYMBOL "="; i = NUM -> int_of_string i ] ->
354 TacticAst.Auto (loc,depth,width)
355 | IDENT "change"; t1 = tactic_term; "with"; t2 = tactic_term; "in";
356 where = pattern_spec ->
357 TacticAst.Change (loc, t1, t2, where)
358 | IDENT "compare"; t = tactic_term ->
359 TacticAst.Compare (loc,t)
360 | IDENT "constructor"; n = NUM ->
361 TacticAst.Constructor (loc,int_of_string n)
362 | IDENT "contradiction" ->
363 TacticAst.Contradiction loc
364 | IDENT "cut"; t = tactic_term; ident = OPT [ "as"; id = IDENT -> id] ->
365 TacticAst.Cut (loc, ident, t)
366 | IDENT "decide"; IDENT "equality" ->
367 TacticAst.DecideEquality loc
368 | IDENT "decompose"; where = term ->
369 TacticAst.Decompose (loc, where)
370 | IDENT "discriminate"; t = tactic_term ->
371 TacticAst.Discriminate (loc, t)
372 | IDENT "elim"; t1 = tactic_term;
373 using = OPT [ "using"; using = tactic_term -> using ] ->
374 TacticAst.Elim (loc, t1, using)
375 | IDENT "elimType"; t = tactic_term ->
376 TacticAst.ElimType (loc, t)
377 | IDENT "exact"; t = tactic_term ->
378 TacticAst.Exact (loc, t)
381 | IDENT "fold"; kind = reduction_kind; t = tactic_term ->
382 TacticAst.Fold (loc, kind, t)
384 TacticAst.Fourier loc
385 | IDENT "fwd"; t = term ->
386 TacticAst.FwdSimpl (loc, t)
387 | IDENT "generalize"; t = tactic_term;
388 id = OPT [ "as" ; id = IDENT -> id ];
389 p = OPT [ pattern_spec ] ->
390 let p = match p with None -> [], None | Some p -> p in
391 TacticAst.Generalize (loc,t,id,p)
392 | IDENT "goal"; n = NUM ->
393 TacticAst.Goal (loc, int_of_string n)
394 | IDENT "injection"; t = term ->
395 TacticAst.Injection (loc, t)
396 | IDENT "intros"; num = OPT [num = int -> num]; idents = OPT ident_list0 ->
397 let idents = match idents with None -> [] | Some idents -> idents in
398 TacticAst.Intros (loc, num, idents)
399 | IDENT "intro"; ident = OPT IDENT ->
400 let idents = match ident with None -> [] | Some id -> [id] in
401 TacticAst.Intros (loc, Some 1, idents)
402 | IDENT "lapply"; what = tactic_term;
403 to_what = OPT [ "to" ; t = tactic_term -> t ] ->
404 TacticAst.LApply (loc, to_what, what)
405 | IDENT "left" -> TacticAst.Left loc
406 | IDENT "letin"; where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
407 TacticAst.LetIn (loc, t, where)
408 | kind = reduction_kind; p = OPT [ pattern_spec ] ->
409 let p = match p with None -> [], None | Some p -> p in
410 TacticAst.Reduce (loc, kind, p)
411 | IDENT "reflexivity" ->
412 TacticAst.Reflexivity loc
413 | IDENT "replace"; t1 = tactic_term; "with"; t2 = tactic_term ->
414 TacticAst.Replace (loc, t1, t2)
415 | IDENT "rewrite" ; d = direction; t = term ; p = OPT [ pattern_spec ] ->
416 let p = match p with None -> [], None | Some p -> p in
417 TacticAst.Rewrite (loc, d, t, p)
424 | IDENT "symmetry" ->
425 TacticAst.Symmetry loc
426 | IDENT "transitivity"; t = tactic_term ->
427 TacticAst.Transitivity (loc, t)
432 [ tacticals = LIST1 NEXT SEP SYMBOL ";" ->
433 TacticAst.Seq (loc, tacticals)
437 PAREN "["; tacs = LIST0 tactical SEP SYMBOL ";"; PAREN "]" ->
438 (TacticAst.Then (loc, tac, tacs))
441 [ [ IDENT "do" ]; count = int; tac = tactical ->
442 TacticAst.Do (loc, count, tac)
443 | [ IDENT "repeat" ]; tac = tactical ->
444 TacticAst.Repeat (loc, tac)
448 PAREN "["; tacs = LIST0 tactical SEP SYMBOL ";"; PAREN "]" ->
449 TacticAst.Tries (loc, tacs)
450 | IDENT "try"; tac = NEXT ->
451 TacticAst.Try (loc, tac)
452 | IDENT "fail" -> TacticAst.Fail loc
453 | IDENT "id" -> TacticAst.IdTac loc
454 | PAREN "("; tac = tactical; PAREN ")" -> tac
455 | tac = tactic -> TacticAst.Tactic (loc, tac)
459 [ [ IDENT "definition" ] -> `Definition
460 | [ IDENT "fact" ] -> `Fact
461 | [ IDENT "lemma" ] -> `Lemma
462 | [ IDENT "remark" ] -> `Remark
463 | [ IDENT "theorem" ] -> `Theorem
467 fst_name = IDENT; params = LIST0 [ arg=arg -> arg ];
468 SYMBOL ":"; fst_typ = term; SYMBOL <:unicode<def>>; OPT SYMBOL "|";
469 fst_constructors = LIST0 constructor SEP SYMBOL "|";
472 name = IDENT; SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>;
473 OPT SYMBOL "|"; constructors = LIST0 constructor SEP SYMBOL "|" ->
474 (name, true, typ, constructors) ] SEP "with" -> types
478 (fun (names, typ) acc ->
479 (List.map (fun name -> (name, typ)) names) @ acc)
482 let fst_ind_type = (fst_name, true, fst_typ, fst_constructors) in
483 let tl_ind_types = match tl with None -> [] | Some types -> types in
484 let ind_types = fst_ind_type :: tl_ind_types in
489 name = IDENT; params = LIST0 [ arg = arg -> arg ] ;
490 SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>; PAREN "{" ;
492 name = IDENT ; SYMBOL ":" ; ty = term -> (name,ty)
493 ] SEP SYMBOL ";"; PAREN "}" ->
496 (fun (names, typ) acc ->
497 (List.map (fun name -> (name, typ)) names) @ acc)
500 (params,name,typ,fields)
504 [ [ IDENT "quit" ] -> TacticAst.Quit loc
505 (* | [ IDENT "abort" ] -> TacticAst.Abort loc *)
506 | [ IDENT "print" ]; name = QSTRING -> TacticAst.Print (loc, name)
507 (* | [ IDENT "undo" ]; steps = OPT NUM ->
508 TacticAst.Undo (loc, int_opt steps)
509 | [ IDENT "redo" ]; steps = OPT NUM ->
510 TacticAst.Redo (loc, int_opt steps) *)
511 | [ IDENT "check" ]; t = term ->
512 TacticAst.Check (loc, t)
513 | [ IDENT "hint" ] -> TacticAst.Hint loc
514 | [ IDENT "whelp"; "match" ] ; t = term ->
515 TacticAst.WMatch (loc,t)
516 | [ IDENT "whelp"; IDENT "instance" ] ; t = term ->
517 TacticAst.WInstance (loc,t)
518 | [ IDENT "whelp"; IDENT "locate" ] ; id = IDENT ->
519 TacticAst.WLocate (loc,id)
520 | [ IDENT "whelp"; IDENT "elim" ] ; t = term ->
521 TacticAst.WElim (loc, t)
522 | [ IDENT "whelp"; IDENT "hint" ] ; t = term ->
523 TacticAst.WHint (loc,t)
524 | [ IDENT "print" ]; name = QSTRING -> TacticAst.Print (loc, name)
529 [ IDENT "id"; id = QSTRING; SYMBOL "="; uri = QSTRING ->
530 let alpha = "[a-zA-Z]" in
531 let num = "[0-9]+" in
532 let ident_cont = "\\("^alpha^"\\|"^num^"\\|_\\|\\\\\\)" in
533 let ident = "\\("^alpha^ident_cont^"*\\|_"^ident_cont^"+\\)" in
534 let rex = Str.regexp ("^"^ident^"$") in
535 if Str.string_match rex id 0 then
537 ("^\\(cic:/\\|theory:/\\)"^ident^
538 "\\(/"^ident^"+\\)*\\(\\."^ident^"\\)+"^
539 "\\(#xpointer("^ num^"\\(/"^num^"\\)+)\\)?$")
541 if Str.string_match rex uri 0 then
542 TacticAst.Ident_alias (id, uri)
544 raise (Parse_error (loc,sprintf "Not a valid uri: %s" uri))
546 raise (Parse_error (loc,sprintf "Not a valid identifier: %s" id))
547 | IDENT "symbol"; symbol = QSTRING;
548 instance = OPT [ PAREN "("; IDENT "instance"; n = NUM; PAREN ")" -> n ];
549 SYMBOL "="; dsc = QSTRING ->
551 match instance with Some i -> int_of_string i | None -> 0
553 TacticAst.Symbol_alias (symbol, instance, dsc)
555 instance = OPT [ PAREN "("; IDENT "instance"; n = NUM; PAREN ")" -> n ];
556 SYMBOL "="; dsc = QSTRING ->
558 match instance with Some i -> int_of_string i | None -> 0
560 TacticAst.Number_alias (instance, dsc)
565 [ IDENT "set" ]; n = QSTRING; v = QSTRING ->
566 TacticAst.Set (loc, n, v)
567 | [ IDENT "qed" ] -> TacticAst.Qed loc
568 | flavour = theorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
569 body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
570 TacticAst.Obj (loc,TacticAst.Theorem (flavour, name, typ, body))
571 | flavour = theorem_flavour; name = IDENT;
572 body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
573 TacticAst.Obj (loc,TacticAst.Theorem (flavour, name, CicAst.Implicit, body))
574 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
578 | ((Cic.Name name,Some ty),_,_) :: _ -> name,ty
579 | ((Cic.Name name,None),_,_) :: _ -> name,CicAst.Implicit
582 let body = CicAst.Ident (name,None) in
583 TacticAst.Obj (loc,TacticAst.Theorem(`Definition, name, ty,
584 Some (CicAst.LetRec (ind_kind, defs, body))))
586 | [ IDENT "inductive" ]; spec = inductive_spec ->
587 let (params, ind_types) = spec in
588 TacticAst.Obj (loc,TacticAst.Inductive (params, ind_types))
589 | [ IDENT "coinductive" ]; spec = inductive_spec ->
590 let (params, ind_types) = spec in
591 let ind_types = (* set inductive flags to false (coinductive) *)
592 List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
595 TacticAst.Obj (loc,TacticAst.Inductive (params, ind_types))
596 | [ IDENT "coercion" ] ; name = IDENT ->
597 TacticAst.Coercion (loc, CicAst.Ident (name,Some []))
598 | [ IDENT "coercion" ] ; name = URI ->
599 TacticAst.Coercion (loc, CicAst.Uri (name,Some []))
600 | [ IDENT "alias" ]; spec = alias_spec ->
601 TacticAst.Alias (loc, spec)
602 | [ IDENT "record" ]; (params,name,ty,fields) = record_spec ->
603 TacticAst.Obj (loc,TacticAst.Record (params,name,ty,fields))
607 [ cmd = command; SYMBOL "." -> TacticAst.Command (loc, cmd)
608 | tac = tactical; SYMBOL "." -> TacticAst.Tactical (loc, tac)
609 | mac = macro; SYMBOL "." -> TacticAst.Macro (loc, mac)
614 [ BEGINCOMMENT ; ex = executable ; ENDCOMMENT ->
615 TacticAst.Code (loc, ex)
617 TacticAst.Note (loc, str)
622 [ ex = executable -> TacticAst.Executable (loc,ex)
623 | com = comment -> TacticAst.Comment (loc, com)
627 [ l = LIST0 statement ; EOI -> l
632 let exc_located_wrapper f =
636 | Stdpp.Exc_located (floc, Stream.Error msg) ->
637 raise (Parse_error (floc, msg))
638 | Stdpp.Exc_located (floc, exn) ->
639 raise (Parse_error (floc, (Printexc.to_string exn)))
641 let parse_term stream =
642 exc_located_wrapper (fun () -> (Grammar.Entry.parse term0 stream))
643 let parse_statement stream =
644 exc_located_wrapper (fun () -> (Grammar.Entry.parse statement stream))
645 let parse_statements stream =
646 exc_located_wrapper (fun () -> (Grammar.Entry.parse statements stream))
651 (** {2 Interface for gTopLevel} *)
653 module EnvironmentP3 =
659 let aliases_grammar = Grammar.gcreate cic_lexer
660 let aliases = Grammar.Entry.create aliases_grammar "aliases"
665 (fun domain_item (dsc, _) acc ->
667 match domain_item with
669 TacticAstPp.pp_alias (TacticAst.Ident_alias (id, dsc)) ^ "."
670 | Symbol (symb, i) ->
671 TacticAstPp.pp_alias (TacticAst.Symbol_alias (symb, i, dsc))
674 TacticAstPp.pp_alias (TacticAst.Number_alias (i, dsc)) ^ "."
679 String.concat "\n" (List.sort compare aliases)
683 aliases: [ (* build an environment from an aliases list *)
684 [ aliases = LIST0 alias; EOI ->
686 (fun env (domain_item, codomain_item) ->
687 Environment.add domain_item codomain_item env)
688 Environment.empty aliases
691 alias: [ (* return a pair <domain_item, codomain_item> from an alias *)
694 [ IDENT "id"; id = IDENT; SYMBOL "="; suri = URI ->
695 (Id id, choice_of_uri suri)
696 | IDENT "symbol"; symbol = QSTRING;
697 PAREN "("; IDENT "instance"; instance = NUM; PAREN ")";
698 SYMBOL "="; dsc = QSTRING ->
699 (Symbol (symbol, int_of_string instance),
700 DisambiguateChoices.lookup_symbol_by_dsc symbol dsc)
702 PAREN "("; IDENT "instance"; instance = NUM; PAREN ")";
703 SYMBOL "="; dsc = QSTRING ->
704 (Num (int_of_string instance),
705 DisambiguateChoices.lookup_num_by_dsc dsc)
715 (fun () -> Grammar.Entry.parse aliases (Stream.of_string s))
718 (* vim:set encoding=utf8: *)