1 (* Copyright (C) 2005, HELM Team.
3 * This file is part of HELM, an Hypertextual, Electronic
4 * Library of Mathematics, developed at the Computer Science
5 * Department, University of Bologna, Italy.
7 * HELM is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; either version 2
10 * of the License, or (at your option) any later version.
12 * HELM is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with HELM; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
22 * For details, see the HELM World-Wide-Web page,
23 * http://helm.cs.unibo.it/
30 module Ast = CicNotationPt
32 type 'a localized_option =
34 | LNone of GrafiteAst.loc
37 (CicNotationPt.term, CicNotationPt.term,
38 CicNotationPt.term GrafiteAst.reduction, CicNotationPt.obj, string)
42 include_paths:string list ->
43 LexiconEngine.status ->
44 LexiconEngine.status * ast_statement localized_option
46 let grammar = CicNotationParser.level2_ast_grammar
48 let term = CicNotationParser.term
49 let statement = Grammar.Entry.create grammar "statement"
51 let add_raw_attribute ~text t = Ast.AttributedTerm (`Raw text, t)
53 let default_precedence = 50
54 let default_associativity = Gramext.NonA
57 GLOBAL: term statement;
59 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
60 SYMBOL ":"; ty = term; RPAREN -> names,ty
61 | name = IDENT -> [name],Ast.Implicit
64 constructor: [ [ name = IDENT; SYMBOL ":"; typ = term -> (name, typ) ] ];
65 tactic_term: [ [ t = term LEVEL "90N" -> t ] ];
66 ident_list0: [ [ LPAREN; idents = LIST0 IDENT; RPAREN -> idents ] ];
68 [ tactic_terms = LIST1 tactic_term SEP SYMBOL "," -> tactic_terms ]
71 [ IDENT "demodulate" -> `Demodulate
72 | IDENT "normalize" -> `Normalize
73 | IDENT "reduce" -> `Reduce
74 | IDENT "simplify" -> `Simpl
75 | IDENT "unfold"; t = OPT term -> `Unfold t
76 | IDENT "whd" -> `Whd ]
78 sequent_pattern_spec: [
82 path = OPT [SYMBOL ":" ; path = tactic_term -> path ] ->
83 (id,match path with Some p -> p | None -> Ast.UserInput) ];
84 goal_path = OPT [ SYMBOL <:unicode<vdash>>; term = tactic_term -> term ] ->
86 match goal_path, hyp_paths with
87 None, [] -> Some Ast.UserInput
89 | Some goal_path, _ -> Some goal_path
98 [ "match" ; wanted = tactic_term ;
99 sps = OPT [ "in"; sps = sequent_pattern_spec -> sps ] ->
101 | sps = sequent_pattern_spec ->
104 let wanted,hyp_paths,goal_path =
105 match wanted_and_sps with
106 wanted,None -> wanted, [], Some Ast.UserInput
107 | wanted,Some (hyp_paths,goal_path) -> wanted,hyp_paths,goal_path
109 wanted, hyp_paths, goal_path ] ->
111 None -> None,[],Some Ast.UserInput
115 [ SYMBOL ">" -> `LeftToRight
116 | SYMBOL "<" -> `RightToLeft ]
118 int: [ [ num = NUMBER -> int_of_string num ] ];
120 [ num = OPT [ num = int -> num ]; idents = OPT ident_list0 ->
121 let idents = match idents with None -> [] | Some idents -> idents in
125 using: [ [ using = OPT [ IDENT "using"; t = tactic_term -> t ] -> using ] ];
127 [ IDENT "absurd"; t = tactic_term ->
128 GrafiteAst.Absurd (loc, t)
129 | IDENT "apply"; t = tactic_term ->
130 GrafiteAst.Apply (loc, t)
131 | IDENT "assumption" ->
132 GrafiteAst.Assumption loc
134 depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
135 width = OPT [ IDENT "width"; SYMBOL "="; i = int -> i ];
136 paramodulation = OPT [ IDENT "paramodulation" ];
137 full = OPT [ IDENT "full" ] -> (* ALB *)
138 GrafiteAst.Auto (loc,depth,width,paramodulation,full)
139 | IDENT "clear"; id = IDENT ->
140 GrafiteAst.Clear (loc,id)
141 | IDENT "clearbody"; id = IDENT ->
142 GrafiteAst.ClearBody (loc,id)
143 | IDENT "change"; what = pattern_spec; "with"; t = tactic_term ->
144 GrafiteAst.Change (loc, what, t)
145 | IDENT "constructor"; n = int ->
146 GrafiteAst.Constructor (loc, n)
147 | IDENT "contradiction" ->
148 GrafiteAst.Contradiction loc
149 | IDENT "cut"; t = tactic_term; ident = OPT [ "as"; id = IDENT -> id] ->
150 GrafiteAst.Cut (loc, ident, t)
151 | IDENT "decompose"; types = OPT ident_list0; what = IDENT;
152 (num, idents) = intros_spec ->
153 let types = match types with None -> [] | Some types -> types in
154 let to_spec id = GrafiteAst.Ident id in
155 GrafiteAst.Decompose (loc, List.rev_map to_spec types, what, idents)
156 | IDENT "discriminate"; t = tactic_term ->
157 GrafiteAst.Discriminate (loc, t)
158 | IDENT "elim"; what = tactic_term; using = using;
159 (num, idents) = intros_spec ->
160 GrafiteAst.Elim (loc, what, using, num, idents)
161 | IDENT "elimType"; what = tactic_term; using = using;
162 (num, idents) = intros_spec ->
163 GrafiteAst.ElimType (loc, what, using, num, idents)
164 | IDENT "exact"; t = tactic_term ->
165 GrafiteAst.Exact (loc, t)
167 GrafiteAst.Exists loc
168 | IDENT "fail" -> GrafiteAst.Fail loc
169 | IDENT "fold"; kind = reduction_kind; t = tactic_term; p = pattern_spec ->
172 raise (HExtlib.Localized (loc, CicNotationParser.Parse_error
173 ("the pattern cannot specify the term to replace, only its"
174 ^ " paths in the hypotheses and in the conclusion")))
176 GrafiteAst.Fold (loc, kind, t, p)
178 GrafiteAst.Fourier loc
179 | IDENT "fwd"; hyp = IDENT; idents = OPT ident_list0 ->
180 let idents = match idents with None -> [] | Some idents -> idents in
181 GrafiteAst.FwdSimpl (loc, hyp, idents)
182 | IDENT "generalize"; p=pattern_spec; id = OPT ["as" ; id = IDENT -> id] ->
183 GrafiteAst.Generalize (loc,p,id)
184 | IDENT "goal"; n = int ->
185 GrafiteAst.Goal (loc, n)
186 | IDENT "id" -> GrafiteAst.IdTac loc
187 | IDENT "injection"; t = tactic_term ->
188 GrafiteAst.Injection (loc, t)
189 | IDENT "intro"; ident = OPT IDENT ->
190 let idents = match ident with None -> [] | Some id -> [id] in
191 GrafiteAst.Intros (loc, Some 1, idents)
192 | IDENT "intros"; (num, idents) = intros_spec ->
193 GrafiteAst.Intros (loc, num, idents)
194 | IDENT "inversion"; t = tactic_term ->
195 GrafiteAst.Inversion (loc, t)
197 depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
199 to_what = OPT [ "to" ; t = tactic_term_list1 -> t ];
200 ident = OPT [ IDENT "using" ; ident = IDENT -> ident ] ->
201 let to_what = match to_what with None -> [] | Some to_what -> to_what in
202 GrafiteAst.LApply (loc, depth, to_what, what, ident)
203 | IDENT "left" -> GrafiteAst.Left loc
204 | IDENT "letin"; where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
205 GrafiteAst.LetIn (loc, t, where)
206 | kind = reduction_kind; p = pattern_spec ->
207 GrafiteAst.Reduce (loc, kind, p)
208 | IDENT "reflexivity" ->
209 GrafiteAst.Reflexivity loc
210 | IDENT "replace"; p = pattern_spec; "with"; t = tactic_term ->
211 GrafiteAst.Replace (loc, p, t)
212 | IDENT "rewrite" ; d = direction; t = tactic_term ; p = pattern_spec ->
216 (HExtlib.Localized (loc,
217 (CicNotationParser.Parse_error
218 "the pattern cannot specify the term to rewrite, only its paths in the hypotheses and in the conclusion")))
220 GrafiteAst.Rewrite (loc, d, t, p)
227 | IDENT "symmetry" ->
228 GrafiteAst.Symmetry loc
229 | IDENT "transitivity"; t = tactic_term ->
230 GrafiteAst.Transitivity (loc, t)
235 [ t1 = SELF; SYMBOL ";"; t2 = SELF ->
238 | GrafiteAst.Seq (_, l) -> l @ [ t2 ]
241 GrafiteAst.Seq (loc, ts)
244 [ tac = SELF; SYMBOL ";";
245 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
246 (GrafiteAst.Then (loc, tac, tacs))
249 [ IDENT "do"; count = int; tac = SELF; IDENT "end" ->
250 GrafiteAst.Do (loc, count, tac)
251 | IDENT "repeat"; tac = SELF; IDENT "end" -> GrafiteAst.Repeat (loc, tac)
255 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
256 GrafiteAst.First (loc, tacs)
257 | IDENT "try"; tac = SELF -> GrafiteAst.Try (loc, tac)
259 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
260 GrafiteAst.Solve (loc, tacs)
261 | LPAREN; tac = SELF; RPAREN -> tac
262 | tac = tactic -> GrafiteAst.Tactic (loc, tac)
265 punctuation_tactical:
267 [ SYMBOL "[" -> GrafiteAst.Branch loc
268 | SYMBOL "|" -> GrafiteAst.Shift loc
269 | i = LIST1 int SEP SYMBOL ","; SYMBOL ":" -> GrafiteAst.Pos (loc, i)
270 | SYMBOL "*"; SYMBOL ":" -> GrafiteAst.Wildcard loc
271 | SYMBOL "]" -> GrafiteAst.Merge loc
272 | SYMBOL ";" -> GrafiteAst.Semicolon loc
273 | SYMBOL "." -> GrafiteAst.Dot loc
278 [ IDENT "focus"; goals = LIST1 int -> GrafiteAst.Focus (loc, goals)
279 | IDENT "unfocus" -> GrafiteAst.Unfocus loc
280 | IDENT "skip" -> GrafiteAst.Skip loc
281 | tac = atomic_tactical LEVEL "loops" -> tac
285 [ [ IDENT "definition" ] -> `Definition
286 | [ IDENT "fact" ] -> `Fact
287 | [ IDENT "lemma" ] -> `Lemma
288 | [ IDENT "remark" ] -> `Remark
289 | [ IDENT "theorem" ] -> `Theorem
293 fst_name = IDENT; params = LIST0 [ arg=arg -> arg ];
294 SYMBOL ":"; fst_typ = term; SYMBOL <:unicode<def>>; OPT SYMBOL "|";
295 fst_constructors = LIST0 constructor SEP SYMBOL "|";
298 name = IDENT; SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>;
299 OPT SYMBOL "|"; constructors = LIST0 constructor SEP SYMBOL "|" ->
300 (name, true, typ, constructors) ] SEP "with" -> types
304 (fun (names, typ) acc ->
305 (List.map (fun name -> (name, typ)) names) @ acc)
308 let fst_ind_type = (fst_name, true, fst_typ, fst_constructors) in
309 let tl_ind_types = match tl with None -> [] | Some types -> types in
310 let ind_types = fst_ind_type :: tl_ind_types in
315 name = IDENT; params = LIST0 [ arg = arg -> arg ] ;
316 SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>; SYMBOL "{" ;
319 coercion = [ SYMBOL ":" -> false | SYMBOL ":"; SYMBOL ">" -> true ] ;
320 ty = term -> (name,ty,coercion)
321 ] SEP SYMBOL ";"; SYMBOL "}" ->
324 (fun (names, typ) acc ->
325 (List.map (fun name -> (name, typ)) names) @ acc)
328 (params,name,typ,fields)
332 [ [ IDENT "quit" ] -> GrafiteAst.Quit loc
333 (* | [ IDENT "abort" ] -> GrafiteAst.Abort loc *)
334 (* | [ IDENT "undo" ]; steps = OPT NUMBER ->
335 GrafiteAst.Undo (loc, int_opt steps)
336 | [ IDENT "redo" ]; steps = OPT NUMBER ->
337 GrafiteAst.Redo (loc, int_opt steps) *)
338 | [ IDENT "check" ]; t = term ->
339 GrafiteAst.Check (loc, t)
340 | [ IDENT "hint" ] -> GrafiteAst.Hint loc
341 | [ IDENT "whelp"; "match" ] ; t = term ->
342 GrafiteAst.WMatch (loc,t)
343 | [ IDENT "whelp"; IDENT "instance" ] ; t = term ->
344 GrafiteAst.WInstance (loc,t)
345 | [ IDENT "whelp"; IDENT "locate" ] ; id = QSTRING ->
346 GrafiteAst.WLocate (loc,id)
347 | [ IDENT "whelp"; IDENT "elim" ] ; t = term ->
348 GrafiteAst.WElim (loc, t)
349 | [ IDENT "whelp"; IDENT "hint" ] ; t = term ->
350 GrafiteAst.WHint (loc,t)
351 | [ IDENT "print" ]; name = QSTRING -> GrafiteAst.Print (loc, name)
355 [ IDENT "id"; id = QSTRING; SYMBOL "="; uri = QSTRING ->
356 let alpha = "[a-zA-Z]" in
357 let num = "[0-9]+" in
358 let ident_cont = "\\("^alpha^"\\|"^num^"\\|_\\|\\\\\\)" in
359 let ident = "\\("^alpha^ident_cont^"*\\|_"^ident_cont^"+\\)" in
360 let rex = Str.regexp ("^"^ident^"$") in
361 if Str.string_match rex id 0 then
362 if (try ignore (UriManager.uri_of_string uri); true
363 with UriManager.IllFormedUri _ -> false)
365 LexiconAst.Ident_alias (id, uri)
368 (HExtlib.Localized (loc, CicNotationParser.Parse_error (sprintf "Not a valid uri: %s" uri)))
370 raise (HExtlib.Localized (loc, CicNotationParser.Parse_error (
371 sprintf "Not a valid identifier: %s" id)))
372 | IDENT "symbol"; symbol = QSTRING;
373 instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
374 SYMBOL "="; dsc = QSTRING ->
376 match instance with Some i -> i | None -> 0
378 LexiconAst.Symbol_alias (symbol, instance, dsc)
380 instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
381 SYMBOL "="; dsc = QSTRING ->
383 match instance with Some i -> i | None -> 0
385 LexiconAst.Number_alias (instance, dsc)
389 [ l = LIST0 [ SYMBOL <:unicode<eta>> (* η *); SYMBOL "." -> () ];
391 Ast.IdentArg (List.length l, id)
395 [ IDENT "left"; IDENT "associative" -> Gramext.LeftA
396 | IDENT "right"; IDENT "associative" -> Gramext.RightA
397 | IDENT "non"; IDENT "associative" -> Gramext.NonA
401 [ "with"; IDENT "precedence"; n = NUMBER -> int_of_string n ]
404 [ dir = OPT direction; s = QSTRING;
405 assoc = OPT associativity; prec = OPT precedence;
408 [ blob = UNPARSED_AST ->
409 add_raw_attribute ~text:(sprintf "@{%s}" blob)
410 (CicNotationParser.parse_level2_ast
411 (Ulexing.from_utf8_string blob))
412 | blob = UNPARSED_META ->
413 add_raw_attribute ~text:(sprintf "${%s}" blob)
414 (CicNotationParser.parse_level2_meta
415 (Ulexing.from_utf8_string blob))
419 | None -> default_associativity
420 | Some assoc -> assoc
424 | None -> default_precedence
428 add_raw_attribute ~text:s
429 (CicNotationParser.parse_level1_pattern
430 (Ulexing.from_utf8_string s))
432 (dir, p1, assoc, prec, p2)
436 [ u = URI -> Ast.UriPattern (UriManager.uri_of_string u)
437 | id = IDENT -> Ast.VarPattern id
438 | SYMBOL "_" -> Ast.ImplicitPattern
439 | LPAREN; terms = LIST1 SELF; RPAREN ->
443 | terms -> Ast.ApplPattern terms)
447 [ s = CSYMBOL; args = LIST0 argument; SYMBOL "="; t = level3_term ->
453 IDENT "include" ; path = QSTRING ->
454 loc,path,LexiconAst.WithPreferences
455 | IDENT "include'" ; path = QSTRING ->
456 loc,path,LexiconAst.WithoutPreferences
460 IDENT "set"; n = QSTRING; v = QSTRING ->
461 GrafiteAst.Set (loc, n, v)
462 | IDENT "drop" -> GrafiteAst.Drop loc
463 | IDENT "qed" -> GrafiteAst.Qed loc
464 | IDENT "variant" ; name = IDENT; SYMBOL ":";
465 typ = term; SYMBOL <:unicode<def>> ; newname = IDENT ->
468 (`Variant,name,typ,Some (Ast.Ident (newname, None))))
469 | flavour = theorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
470 body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
471 GrafiteAst.Obj (loc, Ast.Theorem (flavour, name, typ, body))
472 | flavour = theorem_flavour; name = IDENT; SYMBOL <:unicode<def>> (* ≝ *);
475 Ast.Theorem (flavour, name, Ast.Implicit, Some body))
476 | IDENT "axiom"; name = IDENT; SYMBOL ":"; typ = term ->
477 GrafiteAst.Obj (loc, Ast.Theorem (`Axiom, name, typ, None))
478 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
479 defs = CicNotationParser.let_defs ->
482 | ((Ast.Ident (name, None), Some ty),_,_) :: _ -> name,ty
483 | ((Ast.Ident (name, None), None),_,_) :: _ ->
487 let body = Ast.Ident (name,None) in
488 GrafiteAst.Obj (loc, Ast.Theorem(`Definition, name, ty,
489 Some (Ast.LetRec (ind_kind, defs, body))))
490 | IDENT "inductive"; spec = inductive_spec ->
491 let (params, ind_types) = spec in
492 GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
493 | IDENT "coinductive"; spec = inductive_spec ->
494 let (params, ind_types) = spec in
495 let ind_types = (* set inductive flags to false (coinductive) *)
496 List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
499 GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
500 | IDENT "coercion" ; suri = URI ->
501 GrafiteAst.Coercion (loc, UriManager.uri_of_string suri, true)
502 | IDENT "record" ; (params,name,ty,fields) = record_spec ->
503 GrafiteAst.Obj (loc, Ast.Record (params,name,ty,fields))
504 | IDENT "default" ; what = QSTRING ; uris = LIST1 URI ->
505 let uris = List.map UriManager.uri_of_string uris in
506 GrafiteAst.Default (loc,what,uris)
509 IDENT "alias" ; spec = alias_spec ->
510 LexiconAst.Alias (loc, spec)
511 | IDENT "notation"; (dir, l1, assoc, prec, l2) = notation ->
512 LexiconAst.Notation (loc, dir, l1, assoc, prec, l2)
513 | IDENT "interpretation"; id = QSTRING;
514 (symbol, args, l3) = interpretation ->
515 LexiconAst.Interpretation (loc, id, (symbol, args), l3)
518 [ cmd = grafite_command; SYMBOL "." -> GrafiteAst.Command (loc, cmd)
519 | tac = tactical; punct = punctuation_tactical ->
520 GrafiteAst.Tactical (loc, tac, Some punct)
521 | punct = punctuation_tactical -> GrafiteAst.Tactical (loc, punct, None)
522 | mac = macro; SYMBOL "." -> GrafiteAst.Macro (loc, mac)
526 [ BEGINCOMMENT ; ex = executable ; ENDCOMMENT ->
527 GrafiteAst.Code (loc, ex)
529 GrafiteAst.Note (loc, str)
534 fun ~include_paths status -> status,LSome(GrafiteAst.Executable (loc,ex))
536 fun ~include_paths status -> status,LSome (GrafiteAst.Comment (loc, com))
537 | (iloc,fname,mode) = include_command ; SYMBOL "." ->
538 fun ~include_paths status ->
539 let path = DependenciesParser.baseuri_of_script ~include_paths fname in
541 LexiconEngine.eval_command status (LexiconAst.Include (iloc,path,mode))
545 (GrafiteAst.Executable
546 (loc,GrafiteAst.Command
547 (loc,GrafiteAst.Include (iloc,path))))
548 | scom = lexicon_command ; SYMBOL "." ->
549 fun ~include_paths status ->
550 let status = LexiconEngine.eval_command status scom in
552 | EOI -> raise End_of_file
557 let exc_located_wrapper f =
561 | Stdpp.Exc_located (_, End_of_file) -> raise End_of_file
562 | Stdpp.Exc_located (floc, Stream.Error msg) ->
563 raise (HExtlib.Localized (floc,CicNotationParser.Parse_error msg))
564 | Stdpp.Exc_located (floc, exn) ->
566 (HExtlib.Localized (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
568 let parse_statement lexbuf =
570 (fun () -> (Grammar.Entry.parse statement (Obj.magic lexbuf)))