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 * 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;
65 [ LPAREN; names = LIST1 IDENT SEP SYMBOL ",";
66 SYMBOL ":"; ty = term; RPAREN -> names,ty
67 | name = IDENT -> [name],Ast.Implicit
70 constructor: [ [ name = IDENT; SYMBOL ":"; typ = term -> (name, typ) ] ];
71 tactic_term: [ [ t = term LEVEL "90N" -> t ] ];
72 ident_list0: [ [ LPAREN; idents = LIST0 IDENT; RPAREN -> idents ] ];
74 [ tactic_terms = LIST1 tactic_term SEP SYMBOL "," -> tactic_terms ]
77 [ IDENT "normalize" -> `Normalize
78 | IDENT "reduce" -> `Reduce
79 | IDENT "simplify" -> `Simpl
80 | IDENT "unfold"; t = OPT tactic_term -> `Unfold t
81 | IDENT "whd" -> `Whd ]
83 sequent_pattern_spec: [
87 path = OPT [SYMBOL ":" ; path = tactic_term -> path ] ->
88 (id,match path with Some p -> p | None -> Ast.UserInput) ];
89 goal_path = OPT [ SYMBOL <:unicode<vdash>>; term = tactic_term -> term ] ->
91 match goal_path, hyp_paths with
92 None, [] -> Some Ast.UserInput
94 | Some goal_path, _ -> Some goal_path
103 [ "match" ; wanted = tactic_term ;
104 sps = OPT [ "in"; sps = sequent_pattern_spec -> sps ] ->
106 | sps = sequent_pattern_spec ->
109 let wanted,hyp_paths,goal_path =
110 match wanted_and_sps with
111 wanted,None -> wanted, [], Some Ast.UserInput
112 | wanted,Some (hyp_paths,goal_path) -> wanted,hyp_paths,goal_path
114 wanted, hyp_paths, goal_path ] ->
116 None -> None,[],Some Ast.UserInput
120 [ SYMBOL ">" -> `LeftToRight
121 | SYMBOL "<" -> `RightToLeft ]
123 int: [ [ num = NUMBER -> int_of_string num ] ];
125 [ num = OPT [ num = int -> num ]; idents = OPT ident_list0 ->
126 let idents = match idents with None -> [] | Some idents -> idents in
130 using: [ [ using = OPT [ IDENT "using"; t = tactic_term -> t ] -> using ] ];
132 [ IDENT "absurd"; t = tactic_term ->
133 GrafiteAst.Absurd (loc, t)
134 | IDENT "apply"; t = tactic_term ->
135 GrafiteAst.Apply (loc, t)
136 | IDENT "applyS"; t = tactic_term ->
137 GrafiteAst.ApplyS (loc, t)
138 | IDENT "assumption" ->
139 GrafiteAst.Assumption loc
140 | IDENT "auto"; params =
141 LIST0 [ i = IDENT -> i,"" | i = IDENT ; SYMBOL "="; v = [ v = int ->
142 string_of_int v | v = IDENT -> v ] -> i,v ] ->
143 GrafiteAst.Auto (loc,params)
144 | IDENT "clear"; ids = LIST1 IDENT ->
145 GrafiteAst.Clear (loc, ids)
146 | IDENT "clearbody"; id = IDENT ->
147 GrafiteAst.ClearBody (loc,id)
148 | IDENT "change"; what = pattern_spec; "with"; t = tactic_term ->
149 GrafiteAst.Change (loc, what, t)
150 | IDENT "constructor"; n = int ->
151 GrafiteAst.Constructor (loc, n)
152 | IDENT "contradiction" ->
153 GrafiteAst.Contradiction loc
154 | IDENT "cut"; t = tactic_term; ident = OPT [ "as"; id = IDENT -> id] ->
155 GrafiteAst.Cut (loc, ident, t)
156 | IDENT "decompose"; types = OPT ident_list0; what = OPT IDENT;
157 idents = OPT [ "as"; idents = LIST1 IDENT -> idents ] ->
158 let types = match types with None -> [] | Some types -> types in
159 let idents = match idents with None -> [] | Some idents -> idents in
160 let to_spec id = GrafiteAst.Ident id in
161 GrafiteAst.Decompose (loc, List.rev_map to_spec types, what, idents)
162 | IDENT "demodulate" -> GrafiteAst.Demodulate loc
163 | IDENT "discriminate"; t = tactic_term ->
164 GrafiteAst.Discriminate (loc, t)
165 | IDENT "elim"; what = tactic_term; using = using;
166 (num, idents) = intros_spec ->
167 GrafiteAst.Elim (loc, what, using, num, idents)
168 | IDENT "elimType"; what = tactic_term; using = using;
169 (num, idents) = intros_spec ->
170 GrafiteAst.ElimType (loc, what, using, num, idents)
171 | IDENT "exact"; t = tactic_term ->
172 GrafiteAst.Exact (loc, t)
174 GrafiteAst.Exists loc
175 | IDENT "fail" -> GrafiteAst.Fail loc
176 | IDENT "fold"; kind = reduction_kind; t = tactic_term; p = pattern_spec ->
179 raise (HExtlib.Localized (loc, CicNotationParser.Parse_error
180 ("the pattern cannot specify the term to replace, only its"
181 ^ " paths in the hypotheses and in the conclusion")))
183 GrafiteAst.Fold (loc, kind, t, p)
185 GrafiteAst.Fourier loc
186 | IDENT "fwd"; hyp = IDENT; idents = OPT [ "as"; idents = LIST1 IDENT -> idents ] ->
187 let idents = match idents with None -> [] | Some idents -> idents in
188 GrafiteAst.FwdSimpl (loc, hyp, idents)
189 | IDENT "generalize"; p=pattern_spec; id = OPT ["as" ; id = IDENT -> id] ->
190 GrafiteAst.Generalize (loc,p,id)
191 | IDENT "goal"; n = int ->
192 GrafiteAst.Goal (loc, n)
193 | IDENT "id" -> GrafiteAst.IdTac loc
194 | IDENT "injection"; t = tactic_term ->
195 GrafiteAst.Injection (loc, t)
196 | IDENT "intro"; ident = OPT IDENT ->
197 let idents = match ident with None -> [] | Some id -> [id] in
198 GrafiteAst.Intros (loc, Some 1, idents)
199 | IDENT "intros"; (num, idents) = intros_spec ->
200 GrafiteAst.Intros (loc, num, idents)
201 | IDENT "inversion"; t = tactic_term ->
202 GrafiteAst.Inversion (loc, t)
204 linear = OPT [ IDENT "linear" ];
205 depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
207 to_what = OPT [ "to" ; t = tactic_term_list1 -> t ];
208 ident = OPT [ "as" ; ident = IDENT -> ident ] ->
209 let linear = match linear with None -> false | Some _ -> true in
210 let to_what = match to_what with None -> [] | Some to_what -> to_what in
211 GrafiteAst.LApply (loc, linear, depth, to_what, what, ident)
212 | IDENT "left" -> GrafiteAst.Left loc
213 | IDENT "letin"; where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
214 GrafiteAst.LetIn (loc, t, where)
215 | kind = reduction_kind; p = pattern_spec ->
216 GrafiteAst.Reduce (loc, kind, p)
217 | IDENT "reflexivity" ->
218 GrafiteAst.Reflexivity loc
219 | IDENT "replace"; p = pattern_spec; "with"; t = tactic_term ->
220 GrafiteAst.Replace (loc, p, t)
221 | IDENT "rewrite" ; d = direction; t = tactic_term ; p = pattern_spec ->
225 (HExtlib.Localized (loc,
226 (CicNotationParser.Parse_error
227 "the pattern cannot specify the term to rewrite, only its paths in the hypotheses and in the conclusion")))
229 GrafiteAst.Rewrite (loc, d, t, p)
236 | IDENT "symmetry" ->
237 GrafiteAst.Symmetry loc
238 | IDENT "transitivity"; t = tactic_term ->
239 GrafiteAst.Transitivity (loc, t)
240 (* Produzioni Aggiunte *)
241 | IDENT "assume" ; id = IDENT ; SYMBOL ":" ; t = tactic_term ->
242 GrafiteAst.Assume (loc, id, t)
243 | IDENT "suppose" ; t = tactic_term ; LPAREN ; id = IDENT ; RPAREN ; t1 = OPT [IDENT "that" ; IDENT "is" ; IDENT "equivalent" ; "to" ; t' = tactic_term -> t']->
244 GrafiteAst.Suppose (loc, t, id, t1)
245 | IDENT "by" ; t = [t' = tactic_term -> LSome t' | SYMBOL "_" -> LNone loc];
246 cont=by_continuation ->
247 let t' = match t with LNone _ -> None | LSome t -> Some t in
249 BYC_done -> GrafiteAst.Bydone (loc, t')
250 | BYC_weproved (ty,id,t1) ->
251 GrafiteAst.By_term_we_proved(loc, t', ty, id, t1)
252 | BYC_letsuchthat (id1,t1,id2,t2) ->
255 raise (HExtlib.Localized
256 (floc,CicNotationParser.Parse_error
257 "tactic_term expected here"))
258 | LSome t -> GrafiteAst.ExistsElim (loc, t, id1, t1, id2, t2))
259 | BYC_wehaveand (id1,t1,id2,t2) ->
262 raise (HExtlib.Localized
263 (floc,CicNotationParser.Parse_error
264 "tactic_term expected here"))
265 | LSome t -> GrafiteAst.AndElim (loc, t, id1, t1, id2, t2)))
266 | IDENT "we" ; IDENT "need" ; "to" ; IDENT "prove" ; t = tactic_term ; LPAREN ; id = IDENT ; RPAREN ; t1 = OPT [IDENT "or" ; IDENT "equivalently"; t' = tactic_term -> t']->
267 GrafiteAst.We_need_to_prove (loc, t, id, t1)
268 | IDENT "we" ; IDENT "proceed" ; IDENT "by" ; IDENT "induction" ; "on" ; t=tactic_term ; "to" ; IDENT "prove" ; t1=tactic_term ->
269 GrafiteAst.We_proceed_by_induction_on (loc, t, t1)
270 | IDENT "by" ; IDENT "induction" ; IDENT "hypothesis" ; IDENT "we" ; IDENT "know" ; t=tactic_term ; LPAREN ; id = IDENT ; RPAREN ->
271 GrafiteAst.Byinduction(loc, t, id)
272 | IDENT "the" ; IDENT "thesis" ; IDENT "becomes" ; t=tactic_term ->
273 GrafiteAst.Thesisbecomes(loc, t)
274 | IDENT "case" ; id = IDENT ; params=LIST0[LPAREN ; i=IDENT ;
275 SYMBOL":" ; t=tactic_term ; RPAREN -> i,t] ->
276 GrafiteAst.Case(loc,id,params)
277 | IDENT "obtain" ; termine=tactic_term ; SYMBOL "=" ; t1=tactic_term ; IDENT "by" ; t2=[ t=tactic_term -> Some t | SYMBOL "_" -> None ] ; cont=rewriting_step_continuation ->
278 GrafiteAst.RewritingStep(loc, Some termine, t1, t2, cont)
279 | SYMBOL "=" ; t1=tactic_term ; IDENT "by" ; t2=[ t=tactic_term -> Some t | SYMBOL "_" -> None ] ; cont=rewriting_step_continuation ->
280 GrafiteAst.RewritingStep(loc, None, t1, t2, cont)
284 [ 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,id,t1)
285 | IDENT "done" -> BYC_done
286 | "let" ; id1 = IDENT ; SYMBOL ":" ; t1 = tactic_term ;
287 IDENT "such" ; IDENT "that" ; t2=tactic_term ; LPAREN ; id2 = IDENT ;
288 RPAREN -> BYC_letsuchthat (id1,t1,id2,t2)
289 | IDENT "we" ; IDENT "have" ; t1=tactic_term ; LPAREN ; id1=IDENT ; RPAREN ;
290 "and" ; t2=tactic_term ; LPAREN ; id2=IDENT ; RPAREN ->
291 BYC_wehaveand (id1,t1,id2,t2)
294 rewriting_step_continuation : [
295 [ IDENT "done" -> None
296 | IDENT "we" ; IDENT "proved" ; id=IDENT -> Some (Cic.Name id)
297 | -> Some Cic.Anonymous
302 [ t1 = SELF; SYMBOL ";"; t2 = SELF ->
305 | GrafiteAst.Seq (_, l) -> l @ [ t2 ]
308 GrafiteAst.Seq (loc, ts)
311 [ tac = SELF; SYMBOL ";";
312 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
313 (GrafiteAst.Then (loc, tac, tacs))
316 [ IDENT "do"; count = int; tac = SELF; IDENT "end" ->
317 GrafiteAst.Do (loc, count, tac)
318 | IDENT "repeat"; tac = SELF; IDENT "end" -> GrafiteAst.Repeat (loc, tac)
322 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
323 GrafiteAst.First (loc, tacs)
324 | IDENT "try"; tac = SELF -> GrafiteAst.Try (loc, tac)
326 SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
327 GrafiteAst.Solve (loc, tacs)
328 | LPAREN; tac = SELF; RPAREN -> tac
329 | tac = tactic -> GrafiteAst.Tactic (loc, tac)
332 punctuation_tactical:
334 [ SYMBOL "[" -> GrafiteAst.Branch loc
335 | SYMBOL "|" -> GrafiteAst.Shift loc
336 | i = LIST1 int SEP SYMBOL ","; SYMBOL ":" -> GrafiteAst.Pos (loc, i)
337 | SYMBOL "*"; SYMBOL ":" -> GrafiteAst.Wildcard loc
338 | SYMBOL "]" -> GrafiteAst.Merge loc
339 | SYMBOL ";" -> GrafiteAst.Semicolon loc
340 | SYMBOL "." -> GrafiteAst.Dot loc
345 [ IDENT "focus"; goals = LIST1 int -> GrafiteAst.Focus (loc, goals)
346 | IDENT "unfocus" -> GrafiteAst.Unfocus loc
347 | IDENT "skip" -> GrafiteAst.Skip loc
348 | tac = atomic_tactical LEVEL "loops" -> tac
352 [ [ IDENT "definition" ] -> `Definition
353 | [ IDENT "fact" ] -> `Fact
354 | [ IDENT "lemma" ] -> `Lemma
355 | [ IDENT "remark" ] -> `Remark
356 | [ IDENT "theorem" ] -> `Theorem
360 fst_name = IDENT; params = LIST0 [ arg=arg -> arg ];
361 SYMBOL ":"; fst_typ = term; SYMBOL <:unicode<def>>; OPT SYMBOL "|";
362 fst_constructors = LIST0 constructor SEP SYMBOL "|";
365 name = IDENT; SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>;
366 OPT SYMBOL "|"; constructors = LIST0 constructor SEP SYMBOL "|" ->
367 (name, true, typ, constructors) ] SEP "with" -> types
371 (fun (names, typ) acc ->
372 (List.map (fun name -> (name, typ)) names) @ acc)
375 let fst_ind_type = (fst_name, true, fst_typ, fst_constructors) in
376 let tl_ind_types = match tl with None -> [] | Some types -> types in
377 let ind_types = fst_ind_type :: tl_ind_types in
382 name = IDENT; params = LIST0 [ arg = arg -> arg ] ;
383 SYMBOL ":"; typ = term; SYMBOL <:unicode<def>>; SYMBOL "{" ;
386 coercion = [ SYMBOL ":" -> false | SYMBOL ":"; SYMBOL ">" -> true ] ;
387 ty = term -> (name,ty,coercion)
388 ] SEP SYMBOL ";"; SYMBOL "}" ->
391 (fun (names, typ) acc ->
392 (List.map (fun name -> (name, typ)) names) @ acc)
395 (params,name,typ,fields)
399 [ [ IDENT "check" ]; t = term ->
400 GrafiteAst.Check (loc, t)
401 | [ IDENT "hint" ] -> GrafiteAst.Hint loc
402 | [ IDENT "whelp"; "match" ] ; t = term ->
403 GrafiteAst.WMatch (loc,t)
404 | [ IDENT "whelp"; IDENT "instance" ] ; t = term ->
405 GrafiteAst.WInstance (loc,t)
406 | [ IDENT "whelp"; IDENT "locate" ] ; id = QSTRING ->
407 GrafiteAst.WLocate (loc,id)
408 | [ IDENT "whelp"; IDENT "elim" ] ; t = term ->
409 GrafiteAst.WElim (loc, t)
410 | [ IDENT "whelp"; IDENT "hint" ] ; t = term ->
411 GrafiteAst.WHint (loc,t)
415 [ IDENT "id"; id = QSTRING; SYMBOL "="; uri = QSTRING ->
416 let alpha = "[a-zA-Z]" in
417 let num = "[0-9]+" in
418 let ident_cont = "\\("^alpha^"\\|"^num^"\\|_\\|\\\\\\)" in
419 let ident = "\\("^alpha^ident_cont^"*\\|_"^ident_cont^"+\\)" in
420 let rex = Str.regexp ("^"^ident^"$") in
421 if Str.string_match rex id 0 then
422 if (try ignore (UriManager.uri_of_string uri); true
423 with UriManager.IllFormedUri _ -> false)
425 LexiconAst.Ident_alias (id, uri)
428 (HExtlib.Localized (loc, CicNotationParser.Parse_error (sprintf "Not a valid uri: %s" uri)))
430 raise (HExtlib.Localized (loc, CicNotationParser.Parse_error (
431 sprintf "Not a valid identifier: %s" id)))
432 | IDENT "symbol"; symbol = QSTRING;
433 instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
434 SYMBOL "="; dsc = QSTRING ->
436 match instance with Some i -> i | None -> 0
438 LexiconAst.Symbol_alias (symbol, instance, dsc)
440 instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
441 SYMBOL "="; dsc = QSTRING ->
443 match instance with Some i -> i | None -> 0
445 LexiconAst.Number_alias (instance, dsc)
449 [ l = LIST0 [ SYMBOL <:unicode<eta>> (* η *); SYMBOL "." -> () ];
451 Ast.IdentArg (List.length l, id)
455 [ IDENT "left"; IDENT "associative" -> Gramext.LeftA
456 | IDENT "right"; IDENT "associative" -> Gramext.RightA
457 | IDENT "non"; IDENT "associative" -> Gramext.NonA
461 [ "with"; IDENT "precedence"; n = NUMBER -> int_of_string n ]
464 [ dir = OPT direction; s = QSTRING;
465 assoc = OPT associativity; prec = OPT precedence;
468 [ blob = UNPARSED_AST ->
469 add_raw_attribute ~text:(sprintf "@{%s}" blob)
470 (CicNotationParser.parse_level2_ast
471 (Ulexing.from_utf8_string blob))
472 | blob = UNPARSED_META ->
473 add_raw_attribute ~text:(sprintf "${%s}" blob)
474 (CicNotationParser.parse_level2_meta
475 (Ulexing.from_utf8_string blob))
479 | None -> default_associativity
480 | Some assoc -> assoc
484 | None -> default_precedence
488 add_raw_attribute ~text:s
489 (CicNotationParser.parse_level1_pattern
490 (Ulexing.from_utf8_string s))
492 (dir, p1, assoc, prec, p2)
496 [ u = URI -> Ast.UriPattern (UriManager.uri_of_string u)
497 | id = IDENT -> Ast.VarPattern id
498 | SYMBOL "_" -> Ast.ImplicitPattern
499 | LPAREN; terms = LIST1 SELF; RPAREN ->
503 | terms -> Ast.ApplPattern terms)
507 [ s = CSYMBOL; args = LIST0 argument; SYMBOL "="; t = level3_term ->
513 IDENT "include" ; path = QSTRING ->
514 loc,path,LexiconAst.WithPreferences
515 | IDENT "include'" ; path = QSTRING ->
516 loc,path,LexiconAst.WithoutPreferences
520 IDENT "set"; n = QSTRING; v = QSTRING ->
521 GrafiteAst.Set (loc, n, v)
522 | IDENT "drop" -> GrafiteAst.Drop loc
523 | IDENT "print"; s = IDENT -> GrafiteAst.Print (loc,s)
524 | IDENT "qed" -> GrafiteAst.Qed loc
525 | IDENT "variant" ; name = IDENT; SYMBOL ":";
526 typ = term; SYMBOL <:unicode<def>> ; newname = IDENT ->
529 (`Variant,name,typ,Some (Ast.Ident (newname, None))))
530 | flavour = theorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
531 body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
532 GrafiteAst.Obj (loc, Ast.Theorem (flavour, name, typ, body))
533 | flavour = theorem_flavour; name = IDENT; SYMBOL <:unicode<def>> (* ≝ *);
536 Ast.Theorem (flavour, name, Ast.Implicit, Some body))
537 | IDENT "axiom"; name = IDENT; SYMBOL ":"; typ = term ->
538 GrafiteAst.Obj (loc, Ast.Theorem (`Axiom, name, typ, None))
539 | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ];
540 defs = CicNotationParser.let_defs ->
543 | ((Ast.Ident (name, None), Some ty),_,_) :: _ -> name,ty
544 | ((Ast.Ident (name, None), None),_,_) :: _ ->
548 let body = Ast.Ident (name,None) in
549 GrafiteAst.Obj (loc, Ast.Theorem(`Definition, name, ty,
550 Some (Ast.LetRec (ind_kind, defs, body))))
551 | IDENT "inductive"; spec = inductive_spec ->
552 let (params, ind_types) = spec in
553 GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
554 | IDENT "coinductive"; spec = inductive_spec ->
555 let (params, ind_types) = spec in
556 let ind_types = (* set inductive flags to false (coinductive) *)
557 List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
560 GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
561 | IDENT "coercion" ; suri = URI ->
562 GrafiteAst.Coercion (loc, UriManager.uri_of_string suri, true)
563 | IDENT "record" ; (params,name,ty,fields) = record_spec ->
564 GrafiteAst.Obj (loc, Ast.Record (params,name,ty,fields))
565 | IDENT "default" ; what = QSTRING ; uris = LIST1 URI ->
566 let uris = List.map UriManager.uri_of_string uris in
567 GrafiteAst.Default (loc,what,uris)
570 IDENT "alias" ; spec = alias_spec ->
571 LexiconAst.Alias (loc, spec)
572 | IDENT "notation"; (dir, l1, assoc, prec, l2) = notation ->
573 LexiconAst.Notation (loc, dir, l1, assoc, prec, l2)
574 | IDENT "interpretation"; id = QSTRING;
575 (symbol, args, l3) = interpretation ->
576 LexiconAst.Interpretation (loc, id, (symbol, args), l3)
579 [ cmd = grafite_command; SYMBOL "." -> GrafiteAst.Command (loc, cmd)
580 | tac = tactical; punct = punctuation_tactical ->
581 GrafiteAst.Tactical (loc, tac, Some punct)
582 | punct = punctuation_tactical -> GrafiteAst.Tactical (loc, punct, None)
583 | mac = macro; SYMBOL "." -> GrafiteAst.Macro (loc, mac)
587 [ BEGINCOMMENT ; ex = executable ; ENDCOMMENT ->
588 GrafiteAst.Code (loc, ex)
590 GrafiteAst.Note (loc, str)
595 fun ~include_paths status -> status,LSome(GrafiteAst.Executable (loc,ex))
597 fun ~include_paths status -> status,LSome (GrafiteAst.Comment (loc, com))
598 | (iloc,fname,mode) = include_command ; SYMBOL "." ->
599 fun ~include_paths status ->
601 DependenciesParser.baseuri_of_script ~include_paths fname
604 LexiconEngine.eval_command status
605 (LexiconAst.Include (iloc,buri,mode,fullpath))
609 (GrafiteAst.Executable
610 (loc,GrafiteAst.Command
611 (loc,GrafiteAst.Include (iloc,buri))))
612 | scom = lexicon_command ; SYMBOL "." ->
613 fun ~include_paths status ->
614 let status = LexiconEngine.eval_command status scom in
616 | EOI -> raise End_of_file
621 let exc_located_wrapper f =
625 | Stdpp.Exc_located (_, End_of_file) -> raise End_of_file
626 | Stdpp.Exc_located (floc, Stream.Error msg) ->
627 raise (HExtlib.Localized (floc,CicNotationParser.Parse_error msg))
628 | Stdpp.Exc_located (floc, exn) ->
630 (HExtlib.Localized (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
632 let parse_statement lexbuf =
634 (fun () -> (Grammar.Entry.parse statement (Obj.magic lexbuf)))