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
56 type by_continuation =
58 | BYC_weproved of CicNotationPt.term * string option * CicNotationPt.term option
59 | BYC_letsuchthat of string * CicNotationPt.term * string * CicNotationPt.term
60 | BYC_wehaveand of string * CicNotationPt.term * string * CicNotationPt.term
63 GLOBAL: term statement;
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 "normalize" -> `Normalize
72 | IDENT "reduce" -> `Reduce
73 | IDENT "simplify" -> `Simpl
74 | IDENT "unfold"; t = OPT tactic_term -> `Unfold t
75 | IDENT "whd" -> `Whd ]
77 sequent_pattern_spec: [
81 path = OPT [SYMBOL ":" ; path = tactic_term -> path ] ->
82 (id,match path with Some p -> p | None -> Ast.UserInput) ];
83 goal_path = OPT [ SYMBOL <:unicode<vdash>>; term = tactic_term -> term ] ->
85 match goal_path, hyp_paths with
86 None, [] -> Some Ast.UserInput
88 | Some goal_path, _ -> Some goal_path
97 [ "match" ; wanted = tactic_term ;
98 sps = OPT [ "in"; sps = sequent_pattern_spec -> sps ] ->
100 | sps = sequent_pattern_spec ->
103 let wanted,hyp_paths,goal_path =
104 match wanted_and_sps with
105 wanted,None -> wanted, [], Some Ast.UserInput
106 | wanted,Some (hyp_paths,goal_path) -> wanted,hyp_paths,goal_path
108 wanted, hyp_paths, goal_path ] ->
110 None -> None,[],Some Ast.UserInput
114 [ SYMBOL ">" -> `LeftToRight
115 | SYMBOL "<" -> `RightToLeft ]
117 int: [ [ num = NUMBER -> int_of_string num ] ];
119 [ num = OPT [ num = int -> num ]; idents = OPT ident_list0 ->
120 let idents = match idents with None -> [] | Some idents -> idents in
124 using: [ [ using = OPT [ IDENT "using"; t = tactic_term -> t ] -> using ] ];
126 [ IDENT "absurd"; t = tactic_term ->
127 GrafiteAst.Absurd (loc, t)
128 | IDENT "apply"; t = tactic_term ->
129 GrafiteAst.Apply (loc, t)
130 | IDENT "applyS"; t = tactic_term ; params =
131 LIST0 [ i = IDENT -> i,"" | i = IDENT ; SYMBOL "="; v = [ v = int ->
132 string_of_int v | v = IDENT -> v ] -> i,v ] ->
133 GrafiteAst.ApplyS (loc, t, params)
134 | IDENT "assumption" ->
135 GrafiteAst.Assumption loc
136 | IDENT "auto"; params =
137 LIST0 [ i = IDENT -> i,"" | i = IDENT ; SYMBOL "="; v = [ v = int ->
138 string_of_int v | v = IDENT -> v ] -> i,v ] ->
139 GrafiteAst.Auto (loc,params)
140 | IDENT "clear"; ids = LIST1 IDENT ->
141 GrafiteAst.Clear (loc, ids)
142 | IDENT "clearbody"; id = IDENT ->
143 GrafiteAst.ClearBody (loc,id)
144 | IDENT "change"; what = pattern_spec; "with"; t = tactic_term ->
145 GrafiteAst.Change (loc, what, t)
146 | IDENT "constructor"; n = int ->
147 GrafiteAst.Constructor (loc, n)
148 | IDENT "contradiction" ->
149 GrafiteAst.Contradiction loc
150 | IDENT "cut"; t = tactic_term; ident = OPT [ "as"; id = IDENT -> id] ->
151 GrafiteAst.Cut (loc, ident, t)
152 | IDENT "decompose"; types = OPT ident_list0; what = OPT IDENT;
153 idents = OPT [ "as"; idents = LIST1 IDENT -> idents ] ->
154 let types = match types with None -> [] | Some types -> types in
155 let idents = match idents with None -> [] | Some idents -> idents in
156 let to_spec id = GrafiteAst.Ident id in
157 GrafiteAst.Decompose (loc, List.rev_map to_spec types, what, idents)
158 | IDENT "demodulate" -> GrafiteAst.Demodulate loc
159 | IDENT "destruct"; t = tactic_term ->
160 GrafiteAst.Destruct (loc, t)
161 | IDENT "elim"; what = tactic_term; using = using;
162 (num, idents) = intros_spec ->
163 GrafiteAst.Elim (loc, what, using, num, idents)
164 | IDENT "elimType"; what = tactic_term; using = using;
165 (num, idents) = intros_spec ->
166 GrafiteAst.ElimType (loc, what, using, num, idents)
167 | IDENT "exact"; t = tactic_term ->
168 GrafiteAst.Exact (loc, t)
170 GrafiteAst.Exists loc
171 | IDENT "fail" -> GrafiteAst.Fail loc
172 | IDENT "fold"; kind = reduction_kind; t = tactic_term; p = pattern_spec ->
175 raise (HExtlib.Localized (loc, CicNotationParser.Parse_error
176 ("the pattern cannot specify the term to replace, only its"
177 ^ " paths in the hypotheses and in the conclusion")))
179 GrafiteAst.Fold (loc, kind, t, p)
181 GrafiteAst.Fourier loc
182 | IDENT "fwd"; hyp = IDENT; idents = OPT [ "as"; idents = LIST1 IDENT -> idents ] ->
183 let idents = match idents with None -> [] | Some idents -> idents in
184 GrafiteAst.FwdSimpl (loc, hyp, idents)
185 | IDENT "generalize"; p=pattern_spec; id = OPT ["as" ; id = IDENT -> id] ->
186 GrafiteAst.Generalize (loc,p,id)
187 | IDENT "goal"; n = int ->
188 GrafiteAst.Goal (loc, n)
189 | IDENT "id" -> GrafiteAst.IdTac loc
190 | IDENT "intro"; ident = OPT IDENT ->
191 let idents = match ident with None -> [] | Some id -> [id] in
192 GrafiteAst.Intros (loc, Some 1, idents)
193 | IDENT "intros"; (num, idents) = intros_spec ->
194 GrafiteAst.Intros (loc, num, idents)
195 | IDENT "inversion"; t = tactic_term ->
196 GrafiteAst.Inversion (loc, t)
198 linear = OPT [ IDENT "linear" ];
199 depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
201 to_what = OPT [ "to" ; t = tactic_term_list1 -> t ];
202 ident = OPT [ "as" ; ident = IDENT -> ident ] ->
203 let linear = match linear with None -> false | Some _ -> true in
204 let to_what = match to_what with None -> [] | Some to_what -> to_what in
205 GrafiteAst.LApply (loc, linear, depth, to_what, what, ident)
206 | IDENT "left" -> GrafiteAst.Left loc
207 | IDENT "letin"; where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
208 GrafiteAst.LetIn (loc, t, where)
209 | kind = reduction_kind; p = pattern_spec ->
210 GrafiteAst.Reduce (loc, kind, p)
211 | IDENT "reflexivity" ->
212 GrafiteAst.Reflexivity loc
213 | IDENT "replace"; p = pattern_spec; "with"; t = tactic_term ->
214 GrafiteAst.Replace (loc, p, t)
215 | IDENT "rewrite" ; d = direction; t = tactic_term ; p = pattern_spec ->
219 (HExtlib.Localized (loc,
220 (CicNotationParser.Parse_error
221 "the pattern cannot specify the term to rewrite, only its paths in the hypotheses and in the conclusion")))
223 GrafiteAst.Rewrite (loc, d, t, p)
232 | IDENT "symmetry" ->
233 GrafiteAst.Symmetry loc
234 | IDENT "transitivity"; t = tactic_term ->
235 GrafiteAst.Transitivity (loc, t)
236 (* Produzioni Aggiunte *)
237 | IDENT "assume" ; id = IDENT ; SYMBOL ":" ; t = tactic_term ->
238 GrafiteAst.Assume (loc, id, t)
239 | IDENT "suppose" ; t = tactic_term ; LPAREN ; id = IDENT ; RPAREN ; t1 = OPT [IDENT "that" ; IDENT "is" ; IDENT "equivalent" ; "to" ; t' = tactic_term -> t']->
240 GrafiteAst.Suppose (loc, t, id, t1)
241 | IDENT "by" ; t = [t' = tactic_term -> LSome t' | SYMBOL "_" -> LNone loc];
242 cont=by_continuation ->
243 let t' = match t with LNone _ -> None | LSome t -> Some t in
245 BYC_done -> GrafiteAst.Bydone (loc, t')
246 | BYC_weproved (ty,id,t1) ->
247 GrafiteAst.By_term_we_proved(loc, t', ty, id, t1)
248 | BYC_letsuchthat (id1,t1,id2,t2) ->
251 raise (HExtlib.Localized
252 (floc,CicNotationParser.Parse_error
253 "tactic_term expected here"))
254 | LSome t -> GrafiteAst.ExistsElim (loc, t, id1, t1, id2, t2))
255 | BYC_wehaveand (id1,t1,id2,t2) ->
258 raise (HExtlib.Localized
259 (floc,CicNotationParser.Parse_error
260 "tactic_term expected here"))
261 | LSome t -> GrafiteAst.AndElim (loc, t, id1, t1, id2, t2)))
262 | IDENT "we" ; IDENT "need" ; "to" ; IDENT "prove" ; t = tactic_term ; id = OPT [ LPAREN ; id = IDENT ; RPAREN -> id ] ; t1 = OPT [IDENT "or" ; IDENT "equivalently"; t' = tactic_term -> t']->
263 GrafiteAst.We_need_to_prove (loc, t, id, t1)
264 | IDENT "we" ; IDENT "proceed" ; IDENT "by" ; IDENT "induction" ; "on" ; t=tactic_term ; "to" ; IDENT "prove" ; t1=tactic_term ->
265 GrafiteAst.We_proceed_by_induction_on (loc, t, t1)
266 | IDENT "by" ; IDENT "induction" ; IDENT "hypothesis" ; IDENT "we" ; IDENT "know" ; t=tactic_term ; LPAREN ; id = IDENT ; RPAREN ->
267 GrafiteAst.Byinduction(loc, t, id)
268 | IDENT "the" ; IDENT "thesis" ; IDENT "becomes" ; t=tactic_term ->
269 GrafiteAst.Thesisbecomes(loc, t)
270 | IDENT "case" ; id = IDENT ; params=LIST0[LPAREN ; i=IDENT ;
271 SYMBOL":" ; t=tactic_term ; RPAREN -> i,t] ->
272 GrafiteAst.Case(loc,id,params)
273 | IDENT "obtain" ; termine=tactic_term ; SYMBOL "=" ; t1=tactic_term ; IDENT "by" ; t2=[ t=tactic_term -> Some t | SYMBOL "_" -> None ] ; cont=rewriting_step_continuation ->
274 GrafiteAst.RewritingStep(loc, Some termine, t1, t2, cont)
275 | SYMBOL "=" ; t1=tactic_term ; IDENT "by" ; t2=[ t=tactic_term -> Some t | SYMBOL "_" -> None ] ; cont=rewriting_step_continuation ->
276 GrafiteAst.RewritingStep(loc, None, t1, t2, cont)
280 [ IDENT "we" ; IDENT "proved" ; ty = tactic_term ; LPAREN ; id = IDENT ; RPAREN ; t1 = OPT [IDENT "that" ; IDENT "is" ; IDENT "equivalent" ; "to" ; t2 = tactic_term -> t2] -> BYC_weproved (ty,Some id,t1)
281 | IDENT "we" ; IDENT "proved" ; ty = tactic_term ; t1 = OPT [IDENT "that" ; IDENT "is" ; IDENT "equivalent" ; "to" ; t2 = tactic_term -> t2] ;
282 IDENT "done" -> BYC_weproved (ty,None,t1)
283 | IDENT "done" -> BYC_done
284 | "let" ; id1 = IDENT ; SYMBOL ":" ; t1 = tactic_term ;
285 IDENT "such" ; IDENT "that" ; t2=tactic_term ; LPAREN ; id2 = IDENT ; RPAREN -> BYC_letsuchthat (id1,t1,id2,t2)
286 | IDENT "we" ; IDENT "have" ; t1=tactic_term ; LPAREN ; id1=IDENT ; RPAREN ;"and" ; t2=tactic_term ; LPAREN ; id2=IDENT ; RPAREN ->
287 BYC_wehaveand (id1,t1,id2,t2)
290 rewriting_step_continuation : [
291 [ IDENT "done" -> None
292 | IDENT "we" ; IDENT "proved" ; id=IDENT -> Some (Cic.Name id)
293 | -> Some Cic.Anonymous
298 [ t1 = SELF; SYMBOL ";"; t2 = SELF ->
301 | GrafiteAst.Seq (_, l) -> l @ [ t2 ]
304 GrafiteAst.Seq (loc, ts)
307 [ tac = SELF; SYMBOL ";";
308 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
309 (GrafiteAst.Then (loc, tac, tacs))
312 [ IDENT "do"; count = int; tac = SELF; IDENT "end" ->
313 GrafiteAst.Do (loc, count, tac)
314 | IDENT "repeat"; tac = SELF; IDENT "end" -> GrafiteAst.Repeat (loc, tac)
318 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
319 GrafiteAst.First (loc, tacs)
320 | IDENT "try"; tac = SELF -> GrafiteAst.Try (loc, tac)
322 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
323 GrafiteAst.Solve (loc, tacs)
324 | IDENT "progress"; tac = SELF -> GrafiteAst.Progress (loc, tac)
325 | LPAREN; tac = SELF; RPAREN -> tac
326 | tac = tactic -> GrafiteAst.Tactic (loc, tac)
329 punctuation_tactical:
331 [ SYMBOL "[" -> GrafiteAst.Branch loc
332 | SYMBOL "|" -> GrafiteAst.Shift loc
333 | i = LIST1 int SEP SYMBOL ","; SYMBOL ":" -> GrafiteAst.Pos (loc, i)
334 | SYMBOL "*"; SYMBOL ":" -> GrafiteAst.Wildcard loc
335 | SYMBOL "]" -> GrafiteAst.Merge loc
336 | SYMBOL ";" -> GrafiteAst.Semicolon loc
337 | SYMBOL "." -> GrafiteAst.Dot loc
342 [ IDENT "focus"; goals = LIST1 int -> GrafiteAst.Focus (loc, goals)
343 | IDENT "unfocus" -> GrafiteAst.Unfocus loc
344 | IDENT "skip" -> GrafiteAst.Skip loc
345 | tac = atomic_tactical LEVEL "loops" -> tac
349 [ [ IDENT "definition" ] -> `Definition
350 | [ IDENT "fact" ] -> `Fact
351 | [ IDENT "lemma" ] -> `Lemma
352 | [ IDENT "remark" ] -> `Remark
353 | [ IDENT "theorem" ] -> `Theorem
357 fst_name = IDENT; params = LIST0 CicNotationParser.protected_binder_vars;
358 SYMBOL ":"; fst_typ = term; SYMBOL <:unicode<def>>; OPT SYMBOL "|";
359 fst_constructors = LIST0 constructor SEP SYMBOL "|";
362 name = IDENT; SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>;
363 OPT SYMBOL "|"; constructors = LIST0 constructor SEP SYMBOL "|" ->
364 (name, true, typ, constructors) ] SEP "with" -> types
368 (fun (names, typ) acc ->
369 (List.map (fun name -> (name, typ)) names) @ acc)
372 let fst_ind_type = (fst_name, true, fst_typ, fst_constructors) in
373 let tl_ind_types = match tl with None -> [] | Some types -> types in
374 let ind_types = fst_ind_type :: tl_ind_types in
379 name = IDENT; params = LIST0 CicNotationParser.protected_binder_vars ;
380 SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>; SYMBOL "{" ;
384 SYMBOL ":" -> false,0
385 | SYMBOL ":"; SYMBOL ">" -> true,0
386 | SYMBOL ":"; arity = int ; SYMBOL ">" -> true,arity
389 let b,n = coercion in
391 ] SEP SYMBOL ";"; SYMBOL "}" ->
394 (fun (names, typ) acc ->
395 (List.map (fun name -> (name, typ)) names) @ acc)
398 (params,name,typ,fields)
402 [ [ IDENT "check" ]; t = term ->
403 GrafiteAst.Check (loc, t)
404 | [ IDENT "inline"]; suri = QSTRING ->
405 GrafiteAst.Inline (loc,suri)
406 | [ IDENT "hint" ] -> GrafiteAst.Hint loc
407 | [ IDENT "whelp"; "match" ] ; t = term ->
408 GrafiteAst.WMatch (loc,t)
409 | [ IDENT "whelp"; IDENT "instance" ] ; t = term ->
410 GrafiteAst.WInstance (loc,t)
411 | [ IDENT "whelp"; IDENT "locate" ] ; id = QSTRING ->
412 GrafiteAst.WLocate (loc,id)
413 | [ IDENT "whelp"; IDENT "elim" ] ; t = term ->
414 GrafiteAst.WElim (loc, t)
415 | [ IDENT "whelp"; IDENT "hint" ] ; t = term ->
416 GrafiteAst.WHint (loc,t)
420 [ IDENT "id"; id = QSTRING; SYMBOL "="; uri = QSTRING ->
421 let alpha = "[a-zA-Z]" in
422 let num = "[0-9]+" in
423 let ident_cont = "\\("^alpha^"\\|"^num^"\\|_\\|\\\\\\)" in
424 let ident = "\\("^alpha^ident_cont^"*\\|_"^ident_cont^"+\\)" in
425 let rex = Str.regexp ("^"^ident^"$") in
426 if Str.string_match rex id 0 then
427 if (try ignore (UriManager.uri_of_string uri); true
428 with UriManager.IllFormedUri _ -> false)
430 LexiconAst.Ident_alias (id, uri)
433 (HExtlib.Localized (loc, CicNotationParser.Parse_error (sprintf "Not a valid uri: %s" uri)))
435 raise (HExtlib.Localized (loc, CicNotationParser.Parse_error (
436 sprintf "Not a valid identifier: %s" id)))
437 | IDENT "symbol"; symbol = QSTRING;
438 instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
439 SYMBOL "="; dsc = QSTRING ->
441 match instance with Some i -> i | None -> 0
443 LexiconAst.Symbol_alias (symbol, instance, dsc)
445 instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
446 SYMBOL "="; dsc = QSTRING ->
448 match instance with Some i -> i | None -> 0
450 LexiconAst.Number_alias (instance, dsc)
454 [ l = LIST0 [ SYMBOL <:unicode<eta>> (* η *); SYMBOL "." -> () ];
456 Ast.IdentArg (List.length l, id)
460 [ IDENT "left"; IDENT "associative" -> Gramext.LeftA
461 | IDENT "right"; IDENT "associative" -> Gramext.RightA
462 | IDENT "non"; IDENT "associative" -> Gramext.NonA
466 [ "with"; IDENT "precedence"; n = NUMBER -> int_of_string n ]
469 [ dir = OPT direction; s = QSTRING;
470 assoc = OPT associativity; prec = OPT precedence;
473 [ blob = UNPARSED_AST ->
474 add_raw_attribute ~text:(sprintf "@{%s}" blob)
475 (CicNotationParser.parse_level2_ast
476 (Ulexing.from_utf8_string blob))
477 | blob = UNPARSED_META ->
478 add_raw_attribute ~text:(sprintf "${%s}" blob)
479 (CicNotationParser.parse_level2_meta
480 (Ulexing.from_utf8_string blob))
484 | None -> default_associativity
485 | Some assoc -> assoc
489 | None -> default_precedence
493 add_raw_attribute ~text:s
494 (CicNotationParser.parse_level1_pattern
495 (Ulexing.from_utf8_string s))
497 (dir, p1, assoc, prec, p2)
501 [ u = URI -> Ast.UriPattern (UriManager.uri_of_string u)
502 | id = IDENT -> Ast.VarPattern id
503 | SYMBOL "_" -> Ast.ImplicitPattern
504 | LPAREN; terms = LIST1 SELF; RPAREN ->
508 | terms -> Ast.ApplPattern terms)
512 [ s = CSYMBOL; args = LIST0 argument; SYMBOL "="; t = level3_term ->
518 IDENT "include" ; path = QSTRING ->
519 loc,path,LexiconAst.WithPreferences
520 | IDENT "include'" ; path = QSTRING ->
521 loc,path,LexiconAst.WithoutPreferences
525 IDENT "set"; n = QSTRING; v = QSTRING ->
526 GrafiteAst.Set (loc, n, v)
527 | IDENT "drop" -> GrafiteAst.Drop loc
528 | IDENT "print"; s = IDENT -> GrafiteAst.Print (loc,s)
529 | IDENT "qed" -> GrafiteAst.Qed loc
530 | IDENT "variant" ; name = IDENT; SYMBOL ":";
531 typ = term; SYMBOL <:unicode<def>> ; newname = IDENT ->
534 (`Variant,name,typ,Some (Ast.Ident (newname, None))))
535 | flavour = theorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
536 body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
537 GrafiteAst.Obj (loc, Ast.Theorem (flavour, name, typ, body))
538 | flavour = theorem_flavour; name = IDENT; SYMBOL <:unicode<def>> (* ≝ *);
541 Ast.Theorem (flavour, name, Ast.Implicit, Some body))
542 | IDENT "axiom"; name = IDENT; SYMBOL ":"; typ = term ->
543 GrafiteAst.Obj (loc, Ast.Theorem (`Axiom, name, typ, None))
544 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
545 defs = CicNotationParser.let_defs ->
548 | (params,(Ast.Ident (name, None), Some ty),_,_) :: _ ->
551 (fun var ty -> Ast.Binder (`Pi,var,ty)
555 | (_,(Ast.Ident (name, None), None),_,_) :: _ ->
559 let body = Ast.Ident (name,None) in
560 GrafiteAst.Obj (loc, Ast.Theorem(`Definition, name, ty,
561 Some (Ast.LetRec (ind_kind, defs, body))))
562 | IDENT "inductive"; spec = inductive_spec ->
563 let (params, ind_types) = spec in
564 GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
565 | IDENT "coinductive"; spec = inductive_spec ->
566 let (params, ind_types) = spec in
567 let ind_types = (* set inductive flags to false (coinductive) *)
568 List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
571 GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
572 | IDENT "coercion" ; suri = URI ; arity = OPT int ->
573 let arity = match arity with None -> 0 | Some x -> x in
574 GrafiteAst.Coercion (loc, UriManager.uri_of_string suri, true, arity)
575 | IDENT "record" ; (params,name,ty,fields) = record_spec ->
576 GrafiteAst.Obj (loc, Ast.Record (params,name,ty,fields))
577 | IDENT "default" ; what = QSTRING ; uris = LIST1 URI ->
578 let uris = List.map UriManager.uri_of_string uris in
579 GrafiteAst.Default (loc,what,uris)
580 | IDENT "relation" ; aeq = tactic_term ; "on" ; a = tactic_term ;
581 refl = OPT [ IDENT "reflexivity" ; IDENT "proved" ; IDENT "by" ;
582 refl = tactic_term -> refl ] ;
583 sym = OPT [ IDENT "symmetry" ; IDENT "proved" ; IDENT "by" ;
584 sym = tactic_term -> sym ] ;
585 trans = OPT [ IDENT "transitivity" ; IDENT "proved" ; IDENT "by" ;
586 trans = tactic_term -> trans ] ;
588 GrafiteAst.Relation (loc,id,a,aeq,refl,sym,trans)
591 IDENT "alias" ; spec = alias_spec ->
592 LexiconAst.Alias (loc, spec)
593 | IDENT "notation"; (dir, l1, assoc, prec, l2) = notation ->
594 LexiconAst.Notation (loc, dir, l1, assoc, prec, l2)
595 | IDENT "interpretation"; id = QSTRING;
596 (symbol, args, l3) = interpretation ->
597 LexiconAst.Interpretation (loc, id, (symbol, args), l3)
600 [ cmd = grafite_command; SYMBOL "." -> GrafiteAst.Command (loc, cmd)
601 | tac = tactical; punct = punctuation_tactical ->
602 GrafiteAst.Tactical (loc, tac, Some punct)
603 | punct = punctuation_tactical -> GrafiteAst.Tactical (loc, punct, None)
604 | mac = macro; SYMBOL "." -> GrafiteAst.Macro (loc, mac)
608 [ BEGINCOMMENT ; ex = executable ; ENDCOMMENT ->
609 GrafiteAst.Code (loc, ex)
611 GrafiteAst.Note (loc, str)
616 fun ~include_paths status -> status,LSome(GrafiteAst.Executable (loc,ex))
618 fun ~include_paths status -> status,LSome (GrafiteAst.Comment (loc, com))
619 | (iloc,fname,mode) = include_command ; SYMBOL "." ->
620 fun ~include_paths status ->
622 DependenciesParser.baseuri_of_script ~include_paths fname
625 LexiconEngine.eval_command status
626 (LexiconAst.Include (iloc,buri,mode,fullpath))
630 (GrafiteAst.Executable
631 (loc,GrafiteAst.Command
632 (loc,GrafiteAst.Include (iloc,buri))))
633 | scom = lexicon_command ; SYMBOL "." ->
634 fun ~include_paths status ->
635 let status = LexiconEngine.eval_command status scom in
637 | EOI -> raise End_of_file
642 let exc_located_wrapper f =
646 | Stdpp.Exc_located (_, End_of_file) -> raise End_of_file
647 | Stdpp.Exc_located (floc, Stream.Error msg) ->
648 raise (HExtlib.Localized (floc,CicNotationParser.Parse_error msg))
649 | Stdpp.Exc_located (floc, exn) ->
651 (HExtlib.Localized (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
653 let parse_statement lexbuf =
655 (fun () -> (Grammar.Entry.parse statement (Obj.magic lexbuf)))