(* $Id$ *)
-let out = ref ignore
-let set_callback f = out := f
-
-module Ast = CicNotationPt
+module N = CicNotationPt
+module G = GrafiteAst
+module L = LexiconAst
+module LE = LexiconEngine
exception NoInclusionPerformed of string (* full path *)
type 'a localized_option =
LSome of 'a
- | LNone of GrafiteAst.loc
+ | LNone of G.loc
type ast_statement =
- (CicNotationPt.term, CicNotationPt.term,
- CicNotationPt.term GrafiteAst.reduction,
- CicNotationPt.term CicNotationPt.obj, string)
- GrafiteAst.statement
+ (N.term, N.term, N.term G.reduction, N.term N.obj, string) G.statement
type statement =
- ?never_include:bool ->
- include_paths:string list ->
- LexiconEngine.status ->
- LexiconEngine.status * ast_statement localized_option
+ ?never_include:bool -> include_paths:string list -> LE.status ->
+ LE.status * ast_statement localized_option
type parser_status = {
grammar : Grammar.g;
- term : CicNotationPt.term Grammar.Entry.e;
+ term : N.term Grammar.Entry.e;
statement : statement Grammar.Entry.e;
}
+let grafite_callback = ref (fun _ _ -> ())
+let set_grafite_callback cb = grafite_callback := cb
+
+let lexicon_callback = ref (fun _ _ -> ())
+let set_lexicon_callback cb = lexicon_callback := cb
+
let initial_parser () =
let grammar = CicNotationParser.level2_ast_grammar () in
let term = CicNotationParser.term () in
let grafite_parser = ref (initial_parser ())
-let add_raw_attribute ~text t = Ast.AttributedTerm (`Raw text, t)
+let add_raw_attribute ~text t = N.AttributedTerm (`Raw text, t)
let default_associativity = Gramext.NonA
`MutualDefinition to rememer this. *)
let name,ty =
match defs with
- | (params,(Ast.Ident (name, None), Some ty),_,_) :: _ ->
+ | (params,(N.Ident (name, None), Some ty),_,_) :: _ ->
let ty =
List.fold_right
- (fun var ty -> Ast.Binder (`Pi,var,ty)
+ (fun var ty -> N.Binder (`Pi,var,ty)
) params ty
in
name,ty
- | (_,(Ast.Ident (name, None), None),_,_) :: _ ->
- name, Ast.Implicit
+ | (_,(N.Ident (name, None), None),_,_) :: _ ->
+ name, N.Implicit
| _ -> assert false
in
- let body = Ast.Ident (name,None) in
+ let body = N.Ident (name,None) in
let flavour =
if List.length defs = 1 then
`Definition
`MutualDefinition
in
if ng then
- GrafiteAst.NObj (loc, Ast.Theorem(flavour, name, ty,
- Some (Ast.LetRec (ind_kind, defs, body))))
+ G.NObj (loc, N.Theorem(flavour, name, ty,
+ Some (N.LetRec (ind_kind, defs, body))))
else
- GrafiteAst.Obj (loc, Ast.Theorem(flavour, name, ty,
- Some (Ast.LetRec (ind_kind, defs, body))))
+ G.Obj (loc, N.Theorem(flavour, name, ty,
+ Some (N.LetRec (ind_kind, defs, body))))
type by_continuation =
BYC_done
- | BYC_weproved of CicNotationPt.term * string option * CicNotationPt.term option
- | BYC_letsuchthat of string * CicNotationPt.term * string * CicNotationPt.term
- | BYC_wehaveand of string * CicNotationPt.term * string * CicNotationPt.term
+ | BYC_weproved of N.term * string option * N.term option
+ | BYC_letsuchthat of string * N.term * string * N.term
+ | BYC_wehaveand of string * N.term * string * N.term
let initialize_parser () =
(* {{{ parser initialization *)
LIST0
[ id = IDENT ;
path = OPT [SYMBOL ":" ; path = tactic_term -> path ] ->
- (id,match path with Some p -> p | None -> Ast.UserInput) ];
+ (id,match path with Some p -> p | None -> N.UserInput) ];
goal_path = OPT [ SYMBOL <:unicode<vdash>>; term = tactic_term -> term ] ->
let goal_path =
match goal_path, hyp_paths with
- None, [] -> Some Ast.UserInput
+ None, [] -> Some N.UserInput
| None, _::_ -> None
| Some goal_path, _ -> Some goal_path
in
] ->
let wanted,hyp_paths,goal_path =
match wanted_and_sps with
- wanted,None -> wanted, [], Some Ast.UserInput
+ wanted,None -> wanted, [], Some N.UserInput
| wanted,Some (hyp_paths,goal_path) -> wanted,hyp_paths,goal_path
in
wanted, hyp_paths, goal_path ] ->
match res with
- None -> None,[],Some Ast.UserInput
+ None -> None,[],Some N.UserInput
| Some ps -> ps]
];
inverter_param_list: [
[ params = tactic_term ->
let deannotate = function
- | Ast.AttributedTerm (_,t) | t -> t
+ | N.AttributedTerm (_,t) | t -> t
in match deannotate params with
- | Ast.Implicit -> [false]
- | Ast.UserInput -> [true]
- | Ast.Appl l ->
+ | N.Implicit -> [false]
+ | N.UserInput -> [true]
+ | N.Appl l ->
List.map (fun x -> match deannotate x with
- | Ast.Implicit -> false
- | Ast.UserInput -> true
+ | N.Implicit -> false
+ | N.UserInput -> true
| _ -> raise (Invalid_argument "malformed target parameter list 1")) l
| _ -> raise (Invalid_argument ("malformed target parameter list 2\n" ^ CicNotationPp.pp_term params)) ]
];
];
using: [ [ using = OPT [ IDENT "using"; t = tactic_term -> t ] -> using ] ];
ntactic: [
- [ IDENT "napply"; t = tactic_term -> GrafiteAst.NApply (loc, t)
+ [ IDENT "napply"; t = tactic_term -> G.NApply (loc, t)
| IDENT "nassert";
seqs = LIST0 [
hyps = LIST0
id,`Def (bo,ty)];
SYMBOL <:unicode<vdash>>;
concl = tactic_term -> (List.rev hyps,concl) ] ->
- GrafiteAst.NAssert (loc, seqs)
+ G.NAssert (loc, seqs)
| IDENT "ncases"; what = tactic_term ; where = pattern_spec ->
- GrafiteAst.NCases (loc, what, where)
+ G.NCases (loc, what, where)
| IDENT "nchange"; what = pattern_spec; "with"; with_what = tactic_term ->
- GrafiteAst.NChange (loc, what, with_what)
+ G.NChange (loc, what, with_what)
| IDENT "nelim"; what = tactic_term ; where = pattern_spec ->
- GrafiteAst.NElim (loc, what, where)
+ G.NElim (loc, what, where)
| IDENT "ngeneralize"; p=pattern_spec ->
- GrafiteAst.NGeneralize (loc, p)
+ G.NGeneralize (loc, p)
| IDENT "nletin"; name = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term;
where = pattern_spec ->
- GrafiteAst.NLetIn (loc,where,t,name)
+ G.NLetIn (loc,where,t,name)
| IDENT "nrewrite"; dir = direction; what = tactic_term ; where = pattern_spec ->
- GrafiteAst.NRewrite (loc, dir, what, where)
+ G.NRewrite (loc, dir, what, where)
| IDENT "nwhd"; delta = OPT [ IDENT "nodelta" -> () ];
where = pattern_spec ->
let delta = match delta with None -> true | _ -> false in
- GrafiteAst.NEval (loc, where, `Whd delta)
- | SYMBOL "#"; n=IDENT -> GrafiteAst.NIntro (loc,n)
- | SYMBOL "#"; SYMBOL "_" -> GrafiteAst.NIntro (loc,"_")
- | SYMBOL "*" -> GrafiteAst.NCase1 (loc,"_")
+ G.NEval (loc, where, `Whd delta)
+ | SYMBOL "#"; n=IDENT -> G.NIntro (loc,n)
+ | SYMBOL "#"; SYMBOL "_" -> G.NIntro (loc,"_")
+ | SYMBOL "*" -> G.NCase1 (loc,"_")
| SYMBOL "*"; n=IDENT ->
- GrafiteAst.NCase1 (loc,n)
+ G.NCase1 (loc,n)
]
];
tactic: [
[ IDENT "absurd"; t = tactic_term ->
- GrafiteAst.Absurd (loc, t)
+ G.Absurd (loc, t)
| IDENT "apply"; IDENT "rule"; t = tactic_term ->
- GrafiteAst.ApplyRule (loc, t)
+ G.ApplyRule (loc, t)
| IDENT "apply"; t = tactic_term ->
- GrafiteAst.Apply (loc, t)
+ G.Apply (loc, t)
| IDENT "applyP"; t = tactic_term ->
- GrafiteAst.ApplyP (loc, t)
+ G.ApplyP (loc, t)
| IDENT "applyS"; t = tactic_term ; params = auto_params ->
- GrafiteAst.ApplyS (loc, t, params)
+ G.ApplyS (loc, t, params)
| IDENT "assumption" ->
- GrafiteAst.Assumption loc
+ G.Assumption loc
| IDENT "autobatch"; params = auto_params ->
- GrafiteAst.AutoBatch (loc,params)
+ G.AutoBatch (loc,params)
| IDENT "cases"; what = tactic_term;
pattern = OPT pattern_spec;
specs = intros_spec ->
let pattern = match pattern with
- | None -> None, [], Some Ast.UserInput
+ | None -> None, [], Some N.UserInput
| Some pattern -> pattern
in
- GrafiteAst.Cases (loc, what, pattern, specs)
+ G.Cases (loc, what, pattern, specs)
| IDENT "clear"; ids = LIST1 IDENT ->
- GrafiteAst.Clear (loc, ids)
+ G.Clear (loc, ids)
| IDENT "clearbody"; id = IDENT ->
- GrafiteAst.ClearBody (loc,id)
+ G.ClearBody (loc,id)
| IDENT "change"; what = pattern_spec; "with"; t = tactic_term ->
- GrafiteAst.Change (loc, what, t)
+ G.Change (loc, what, t)
| IDENT "compose"; times = OPT int; t1 = tactic_term; t2 =
OPT [ "with"; t = tactic_term -> t ]; specs = intros_spec ->
let times = match times with None -> 1 | Some i -> i in
- GrafiteAst.Compose (loc, t1, t2, times, specs)
+ G.Compose (loc, t1, t2, times, specs)
| IDENT "constructor"; n = int ->
- GrafiteAst.Constructor (loc, n)
+ G.Constructor (loc, n)
| IDENT "contradiction" ->
- GrafiteAst.Contradiction loc
+ G.Contradiction loc
| IDENT "cut"; t = tactic_term; ident = OPT [ "as"; id = IDENT -> id] ->
- GrafiteAst.Cut (loc, ident, t)
+ G.Cut (loc, ident, t)
| IDENT "decompose"; idents = OPT [ "as"; idents = LIST1 new_name -> idents ] ->
let idents = match idents with None -> [] | Some idents -> idents in
- GrafiteAst.Decompose (loc, idents)
- | IDENT "demodulate"; p = auto_params -> GrafiteAst.Demodulate (loc, p)
+ G.Decompose (loc, idents)
+ | IDENT "demodulate"; p = auto_params -> G.Demodulate (loc, p)
| IDENT "destruct"; xts = OPT [ ts = tactic_term_list1 -> ts ] ->
- GrafiteAst.Destruct (loc, xts)
+ G.Destruct (loc, xts)
| IDENT "elim"; what = tactic_term; using = using;
pattern = OPT pattern_spec;
ispecs = intros_spec ->
let pattern = match pattern with
- | None -> None, [], Some Ast.UserInput
+ | None -> None, [], Some N.UserInput
| Some pattern -> pattern
in
- GrafiteAst.Elim (loc, what, using, pattern, ispecs)
+ G.Elim (loc, what, using, pattern, ispecs)
| IDENT "elimType"; what = tactic_term; using = using;
(num, idents) = intros_spec ->
- GrafiteAst.ElimType (loc, what, using, (num, idents))
+ G.ElimType (loc, what, using, (num, idents))
| IDENT "exact"; t = tactic_term ->
- GrafiteAst.Exact (loc, t)
+ G.Exact (loc, t)
| IDENT "exists" ->
- GrafiteAst.Exists loc
- | IDENT "fail" -> GrafiteAst.Fail loc
+ G.Exists loc
+ | IDENT "fail" -> G.Fail loc
| IDENT "fold"; kind = reduction_kind; t = tactic_term; p = pattern_spec ->
let (pt,_,_) = p in
if pt <> None then
("the pattern cannot specify the term to replace, only its"
^ " paths in the hypotheses and in the conclusion")))
else
- GrafiteAst.Fold (loc, kind, t, p)
+ G.Fold (loc, kind, t, p)
| IDENT "fourier" ->
- GrafiteAst.Fourier loc
+ G.Fourier loc
| IDENT "fwd"; hyp = IDENT; idents = OPT [ "as"; idents = LIST1 new_name -> idents ] ->
let idents = match idents with None -> [] | Some idents -> idents in
- GrafiteAst.FwdSimpl (loc, hyp, idents)
+ G.FwdSimpl (loc, hyp, idents)
| IDENT "generalize"; p=pattern_spec; id = OPT ["as" ; id = IDENT -> id] ->
- GrafiteAst.Generalize (loc,p,id)
- | IDENT "id" -> GrafiteAst.IdTac loc
+ G.Generalize (loc,p,id)
+ | IDENT "id" -> G.IdTac loc
| IDENT "intro"; ident = OPT IDENT ->
let idents = match ident with None -> [] | Some id -> [Some id] in
- GrafiteAst.Intros (loc, (Some 1, idents))
+ G.Intros (loc, (Some 1, idents))
| IDENT "intros"; specs = intros_spec ->
- GrafiteAst.Intros (loc, specs)
+ G.Intros (loc, specs)
| IDENT "inversion"; t = tactic_term ->
- GrafiteAst.Inversion (loc, t)
+ G.Inversion (loc, t)
| IDENT "lapply";
linear = OPT [ IDENT "linear" ];
depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
ident = OPT [ "as" ; ident = IDENT -> ident ] ->
let linear = match linear with None -> false | Some _ -> true in
let to_what = match to_what with None -> [] | Some to_what -> to_what in
- GrafiteAst.LApply (loc, linear, depth, to_what, what, ident)
- | IDENT "left" -> GrafiteAst.Left loc
+ G.LApply (loc, linear, depth, to_what, what, ident)
+ | IDENT "left" -> G.Left loc
| IDENT "letin"; where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
- GrafiteAst.LetIn (loc, t, where)
+ G.LetIn (loc, t, where)
| kind = reduction_kind; p = pattern_spec ->
- GrafiteAst.Reduce (loc, kind, p)
+ G.Reduce (loc, kind, p)
| IDENT "reflexivity" ->
- GrafiteAst.Reflexivity loc
+ G.Reflexivity loc
| IDENT "replace"; p = pattern_spec; "with"; t = tactic_term ->
- GrafiteAst.Replace (loc, p, t)
+ G.Replace (loc, p, t)
| IDENT "rewrite" ; d = direction; t = tactic_term ; p = pattern_spec;
xnames = OPT [ "as"; n = ident_list0 -> n ] ->
let (pt,_,_) = p in
"the pattern cannot specify the term to rewrite, only its paths in the hypotheses and in the conclusion")))
else
let n = match xnames with None -> [] | Some names -> names in
- GrafiteAst.Rewrite (loc, d, t, p, n)
+ G.Rewrite (loc, d, t, p, n)
| IDENT "right" ->
- GrafiteAst.Right loc
+ G.Right loc
| IDENT "ring" ->
- GrafiteAst.Ring loc
+ G.Ring loc
| IDENT "split" ->
- GrafiteAst.Split loc
+ G.Split loc
| IDENT "symmetry" ->
- GrafiteAst.Symmetry loc
+ G.Symmetry loc
| IDENT "transitivity"; t = tactic_term ->
- GrafiteAst.Transitivity (loc, t)
+ G.Transitivity (loc, t)
(* Produzioni Aggiunte *)
| IDENT "assume" ; id = IDENT ; SYMBOL ":" ; t = tactic_term ->
- GrafiteAst.Assume (loc, id, t)
+ G.Assume (loc, id, t)
| IDENT "suppose" ; t = tactic_term ; LPAREN ; id = IDENT ; RPAREN ;
t1 = OPT [IDENT "that" ; IDENT "is" ; IDENT "equivalent" ; "to" ;
t' = tactic_term -> t']->
- GrafiteAst.Suppose (loc, t, id, t1)
+ G.Suppose (loc, t, id, t1)
| "let" ; id1 = IDENT ; SYMBOL ":" ; t1 = tactic_term ;
IDENT "such" ; IDENT "that" ; t2=tactic_term ; LPAREN ;
id2 = IDENT ; RPAREN ->
- GrafiteAst.ExistsElim (loc, `Auto ([],[]), id1, t1, id2, t2)
+ G.ExistsElim (loc, `Auto ([],[]), id1, t1, id2, t2)
| just =
[ IDENT "using"; t=tactic_term -> `Term t
| params = auto_params -> `Auto params] ;
cont=by_continuation ->
(match cont with
- BYC_done -> GrafiteAst.Bydone (loc, just)
+ BYC_done -> G.Bydone (loc, just)
| BYC_weproved (ty,id,t1) ->
- GrafiteAst.By_just_we_proved(loc, just, ty, id, t1)
+ G.By_just_we_proved(loc, just, ty, id, t1)
| BYC_letsuchthat (id1,t1,id2,t2) ->
- GrafiteAst.ExistsElim (loc, just, id1, t1, id2, t2)
+ G.ExistsElim (loc, just, id1, t1, id2, t2)
| BYC_wehaveand (id1,t1,id2,t2) ->
- GrafiteAst.AndElim (loc, just, id1, t1, id2, t2))
+ G.AndElim (loc, just, id1, t1, id2, t2))
| 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']->
- GrafiteAst.We_need_to_prove (loc, t, id, t1)
+ G.We_need_to_prove (loc, t, id, t1)
| IDENT "we" ; IDENT "proceed" ; IDENT "by" ; IDENT "cases" ; "on" ; t=tactic_term ; "to" ; IDENT "prove" ; t1=tactic_term ->
- GrafiteAst.We_proceed_by_cases_on (loc, t, t1)
+ G.We_proceed_by_cases_on (loc, t, t1)
| IDENT "we" ; IDENT "proceed" ; IDENT "by" ; IDENT "induction" ; "on" ; t=tactic_term ; "to" ; IDENT "prove" ; t1=tactic_term ->
- GrafiteAst.We_proceed_by_induction_on (loc, t, t1)
+ G.We_proceed_by_induction_on (loc, t, t1)
| IDENT "by" ; IDENT "induction" ; IDENT "hypothesis" ; IDENT "we" ; IDENT "know" ; t=tactic_term ; LPAREN ; id = IDENT ; RPAREN ->
- GrafiteAst.Byinduction(loc, t, id)
+ G.Byinduction(loc, t, id)
| IDENT "the" ; IDENT "thesis" ; IDENT "becomes" ; t=tactic_term ->
- GrafiteAst.Thesisbecomes(loc, t)
+ G.Thesisbecomes(loc, t)
| IDENT "case" ; id = IDENT ; params=LIST0[LPAREN ; i=IDENT ;
SYMBOL":" ; t=tactic_term ; RPAREN -> i,t] ->
- GrafiteAst.Case(loc,id,params)
+ G.Case(loc,id,params)
(* DO NOT FACTORIZE with the two following, camlp5 sucks*)
| IDENT "conclude";
termine = tactic_term;
| IDENT "proof" -> `Proof
| params = auto_params -> `Auto params];
cont = rewriting_step_continuation ->
- GrafiteAst.RewritingStep(loc, Some (None,termine), t1, t2, cont)
+ G.RewritingStep(loc, Some (None,termine), t1, t2, cont)
| IDENT "obtain" ; name = IDENT;
termine = tactic_term;
SYMBOL "=" ;
| IDENT "proof" -> `Proof
| params = auto_params -> `Auto params];
cont = rewriting_step_continuation ->
- GrafiteAst.RewritingStep(loc, Some (Some name,termine), t1, t2, cont)
+ G.RewritingStep(loc, Some (Some name,termine), t1, t2, cont)
| SYMBOL "=" ;
t1=tactic_term ;
t2 =
| IDENT "proof" -> `Proof
| params = auto_params -> `Auto params];
cont = rewriting_step_continuation ->
- GrafiteAst.RewritingStep(loc, None, t1, t2, cont)
+ G.RewritingStep(loc, None, t1, t2, cont)
]
];
auto_fixed_param: [
[ t1 = SELF; SYMBOL ";"; t2 = SELF ->
let ts =
match t1 with
- | GrafiteAst.Seq (_, l) -> l @ [ t2 ]
+ | G.Seq (_, l) -> l @ [ t2 ]
| _ -> [ t1; t2 ]
in
- GrafiteAst.Seq (loc, ts)
+ G.Seq (loc, ts)
]
| "then" NONA
[ tac = SELF; SYMBOL ";";
SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
- (GrafiteAst.Then (loc, tac, tacs))
+ (G.Then (loc, tac, tacs))
]
| "loops" RIGHTA
[ IDENT "do"; count = int; tac = SELF ->
- GrafiteAst.Do (loc, count, tac)
- | IDENT "repeat"; tac = SELF -> GrafiteAst.Repeat (loc, tac)
+ G.Do (loc, count, tac)
+ | IDENT "repeat"; tac = SELF -> G.Repeat (loc, tac)
]
| "simple" NONA
[ IDENT "first";
SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
- GrafiteAst.First (loc, tacs)
- | IDENT "try"; tac = SELF -> GrafiteAst.Try (loc, tac)
+ G.First (loc, tacs)
+ | IDENT "try"; tac = SELF -> G.Try (loc, tac)
| IDENT "solve";
SYMBOL "["; tacs = LIST0 SELF SEP SYMBOL "|"; SYMBOL "]"->
- GrafiteAst.Solve (loc, tacs)
- | IDENT "progress"; tac = SELF -> GrafiteAst.Progress (loc, tac)
+ G.Solve (loc, tacs)
+ | IDENT "progress"; tac = SELF -> G.Progress (loc, tac)
| LPAREN; tac = SELF; RPAREN -> tac
| tac = tactic -> tac
]
];
punctuation_tactical:
[
- [ SYMBOL "[" -> GrafiteAst.Branch loc
- | SYMBOL "|" -> GrafiteAst.Shift loc
- | i = LIST1 int SEP SYMBOL ","; SYMBOL ":" -> GrafiteAst.Pos (loc, i)
- | SYMBOL "*"; SYMBOL ":" -> GrafiteAst.Wildcard loc
- | SYMBOL "]" -> GrafiteAst.Merge loc
- | SYMBOL ";" -> GrafiteAst.Semicolon loc
- | SYMBOL "." -> GrafiteAst.Dot loc
+ [ SYMBOL "[" -> G.Branch loc
+ | SYMBOL "|" -> G.Shift loc
+ | i = LIST1 int SEP SYMBOL ","; SYMBOL ":" -> G.Pos (loc, i)
+ | SYMBOL "*"; SYMBOL ":" -> G.Wildcard loc
+ | SYMBOL "]" -> G.Merge loc
+ | SYMBOL ";" -> G.Semicolon loc
+ | SYMBOL "." -> G.Dot loc
]
];
non_punctuation_tactical:
[ "simple" NONA
- [ IDENT "focus"; goals = LIST1 int -> GrafiteAst.Focus (loc, goals)
- | IDENT "unfocus" -> GrafiteAst.Unfocus loc
- | IDENT "skip" -> GrafiteAst.Skip loc
+ [ IDENT "focus"; goals = LIST1 int -> G.Focus (loc, goals)
+ | IDENT "unfocus" -> G.Unfocus loc
+ | IDENT "skip" -> G.Skip loc
]
];
ntheorem_flavour: [
macro: [
[ [ IDENT "check" ]; t = term ->
- GrafiteAst.Check (loc, t)
+ G.Check (loc, t)
| [ IDENT "eval" ]; kind = reduction_kind; "on"; t = tactic_term ->
- GrafiteAst.Eval (loc, kind, t)
+ G.Eval (loc, kind, t)
| [ IDENT "inline"];
style = OPT [ IDENT "procedural"; depth = OPT int -> depth ];
suri = QSTRING; prefix = OPT QSTRING;
flavour = OPT [ "as"; attr = inline_flavour -> attr ] ->
let style = match style with
- | None -> GrafiteAst.Declarative
- | Some depth -> GrafiteAst.Procedural depth
+ | None -> G.Declarative
+ | Some depth -> G.Procedural depth
in
let prefix = match prefix with None -> "" | Some prefix -> prefix in
- GrafiteAst.Inline (loc,style,suri,prefix, flavour)
+ G.Inline (loc,style,suri,prefix, flavour)
| [ IDENT "hint" ]; rew = OPT (IDENT "rewrite") ->
- if rew = None then GrafiteAst.Hint (loc, false) else GrafiteAst.Hint (loc,true)
+ if rew = None then G.Hint (loc, false) else G.Hint (loc,true)
| IDENT "auto"; params = auto_params ->
- GrafiteAst.AutoInteractive (loc,params)
+ G.AutoInteractive (loc,params)
| [ IDENT "whelp"; "match" ] ; t = term ->
- GrafiteAst.WMatch (loc,t)
+ G.WMatch (loc,t)
| [ IDENT "whelp"; IDENT "instance" ] ; t = term ->
- GrafiteAst.WInstance (loc,t)
+ G.WInstance (loc,t)
| [ IDENT "whelp"; IDENT "locate" ] ; id = QSTRING ->
- GrafiteAst.WLocate (loc,id)
+ G.WLocate (loc,id)
| [ IDENT "whelp"; IDENT "elim" ] ; t = term ->
- GrafiteAst.WElim (loc, t)
+ G.WElim (loc, t)
| [ IDENT "whelp"; IDENT "hint" ] ; t = term ->
- GrafiteAst.WHint (loc,t)
+ G.WHint (loc,t)
]
];
alias_spec: [
if (try ignore (UriManager.uri_of_string uri); true
with UriManager.IllFormedUri _ -> false)
then
- LexiconAst.Ident_alias (id, uri)
+ L.Ident_alias (id, uri)
else
raise
(HExtlib.Localized (loc, CicNotationParser.Parse_error (Printf.sprintf "Not a valid uri: %s" uri)))
let instance =
match instance with Some i -> i | None -> 0
in
- LexiconAst.Symbol_alias (symbol, instance, dsc)
+ L.Symbol_alias (symbol, instance, dsc)
| IDENT "num";
instance = OPT [ LPAREN; IDENT "instance"; n = int; RPAREN -> n ];
SYMBOL "="; dsc = QSTRING ->
let instance =
match instance with Some i -> i | None -> 0
in
- LexiconAst.Number_alias (instance, dsc)
+ L.Number_alias (instance, dsc)
]
];
argument: [
[ l = LIST0 [ SYMBOL <:unicode<eta>> (* η *); SYMBOL "." -> () ];
id = IDENT ->
- Ast.IdentArg (List.length l, id)
+ N.IdentArg (List.length l, id)
]
];
associativity: [
]
];
level3_term: [
- [ u = URI -> Ast.UriPattern (UriManager.uri_of_string u)
- | id = IDENT -> Ast.VarPattern id
- | SYMBOL "_" -> Ast.ImplicitPattern
+ [ u = URI -> N.UriPattern (UriManager.uri_of_string u)
+ | id = IDENT -> N.VarPattern id
+ | SYMBOL "_" -> N.ImplicitPattern
| LPAREN; terms = LIST1 SELF; RPAREN ->
(match terms with
| [] -> assert false
| [term] -> term
- | terms -> Ast.ApplPattern terms)
+ | terms -> N.ApplPattern terms)
]
];
interpretation: [
include_command: [ [
IDENT "include" ; path = QSTRING ->
- loc,path,LexiconAst.WithPreferences
+ loc,path,L.WithPreferences
| IDENT "include'" ; path = QSTRING ->
- loc,path,LexiconAst.WithoutPreferences
+ loc,path,L.WithoutPreferences
]];
grafite_command: [ [
IDENT "set"; n = QSTRING; v = QSTRING ->
- GrafiteAst.Set (loc, n, v)
- | IDENT "drop" -> GrafiteAst.Drop loc
- | IDENT "print"; s = IDENT -> GrafiteAst.Print (loc,s)
- | IDENT "qed" -> GrafiteAst.Qed loc
- | IDENT "nqed" -> GrafiteAst.NQed loc
+ G.Set (loc, n, v)
+ | IDENT "drop" -> G.Drop loc
+ | IDENT "print"; s = IDENT -> G.Print (loc,s)
+ | IDENT "qed" -> G.Qed loc
+ | IDENT "nqed" -> G.NQed loc
| IDENT "variant" ; name = IDENT; SYMBOL ":";
typ = term; SYMBOL <:unicode<def>> ; newname = IDENT ->
- GrafiteAst.Obj (loc,
- Ast.Theorem
- (`Variant,name,typ,Some (Ast.Ident (newname, None))))
+ G.Obj (loc,
+ N.Theorem
+ (`Variant,name,typ,Some (N.Ident (newname, None))))
| nflavour = ntheorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
- GrafiteAst.NObj (loc, Ast.Theorem (nflavour, name, typ, body))
+ G.NObj (loc, N.Theorem (nflavour, name, typ, body))
| flavour = theorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
- GrafiteAst.Obj (loc, Ast.Theorem (flavour, name, typ, body))
+ G.Obj (loc, N.Theorem (flavour, name, typ, body))
| flavour = theorem_flavour; name = IDENT; SYMBOL <:unicode<def>> (* ≝ *);
body = term ->
- GrafiteAst.Obj (loc,
- Ast.Theorem (flavour, name, Ast.Implicit, Some body))
+ G.Obj (loc,
+ N.Theorem (flavour, name, N.Implicit, Some body))
| IDENT "axiom"; name = IDENT; SYMBOL ":"; typ = term ->
- GrafiteAst.Obj (loc, Ast.Theorem (`Axiom, name, typ, None))
+ G.Obj (loc, N.Theorem (`Axiom, name, typ, None))
| IDENT "naxiom"; name = IDENT; SYMBOL ":"; typ = term ->
- GrafiteAst.NObj (loc, Ast.Theorem (`Axiom, name, typ, None))
+ G.NObj (loc, N.Theorem (`Axiom, name, typ, None))
| LETCOREC ; defs = let_defs ->
mk_rec_corec false `CoInductive defs loc
| LETREC ; defs = let_defs ->
mk_rec_corec true `Inductive defs loc
| IDENT "inductive"; spec = inductive_spec ->
let (params, ind_types) = spec in
- GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
+ G.Obj (loc, N.Inductive (params, ind_types))
| IDENT "ninductive"; spec = inductive_spec ->
let (params, ind_types) = spec in
- GrafiteAst.NObj (loc, Ast.Inductive (params, ind_types))
+ G.NObj (loc, N.Inductive (params, ind_types))
| IDENT "coinductive"; spec = inductive_spec ->
let (params, ind_types) = spec in
let ind_types = (* set inductive flags to false (coinductive) *)
List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
ind_types
in
- GrafiteAst.Obj (loc, Ast.Inductive (params, ind_types))
+ G.Obj (loc, N.Inductive (params, ind_types))
| IDENT "ncoinductive"; spec = inductive_spec ->
let (params, ind_types) = spec in
let ind_types = (* set inductive flags to false (coinductive) *)
List.map (fun (name, _, term, ctors) -> (name, false, term, ctors))
ind_types
in
- GrafiteAst.NObj (loc, Ast.Inductive (params, ind_types))
+ G.NObj (loc, N.Inductive (params, ind_types))
| IDENT "coercion" ;
- t = [ u = URI -> Ast.Uri (u,None) | t = tactic_term ; OPT "with" -> t ] ;
+ t = [ u = URI -> N.Uri (u,None) | t = tactic_term ; OPT "with" -> t ] ;
arity = OPT int ; saturations = OPT int;
composites = OPT (IDENT "nocomposites") ->
let arity = match arity with None -> 0 | Some x -> x in
let saturations = match saturations with None -> 0 | Some x -> x in
let composites = match composites with None -> true | Some _ -> false in
- GrafiteAst.Coercion
+ G.Coercion
(loc, t, composites, arity, saturations)
| IDENT "prefer" ; IDENT "coercion"; t = tactic_term ->
- GrafiteAst.PreferCoercion (loc, t)
+ G.PreferCoercion (loc, t)
| IDENT "pump" ; steps = int ->
- GrafiteAst.Pump(loc,steps)
+ G.Pump(loc,steps)
| IDENT "unification"; IDENT "hint"; n = int; t = tactic_term ->
- GrafiteAst.UnificationHint (loc, t, n)
+ G.UnificationHint (loc, t, n)
| IDENT "inverter"; name = IDENT; IDENT "for";
indty = tactic_term; paramspec = inverter_param_list ->
- GrafiteAst.Inverter
+ G.Inverter
(loc, name, indty, paramspec)
| IDENT "record" ; (params,name,ty,fields) = record_spec ->
- GrafiteAst.Obj (loc, Ast.Record (params,name,ty,fields))
+ G.Obj (loc, N.Record (params,name,ty,fields))
| IDENT "default" ; what = QSTRING ; uris = LIST1 URI ->
let uris = List.map UriManager.uri_of_string uris in
- GrafiteAst.Default (loc,what,uris)
+ G.Default (loc,what,uris)
| IDENT "relation" ; aeq = tactic_term ; "on" ; a = tactic_term ;
refl = OPT [ IDENT "reflexivity" ; IDENT "proved" ; IDENT "by" ;
refl = tactic_term -> refl ] ;
trans = OPT [ IDENT "transitivity" ; IDENT "proved" ; IDENT "by" ;
trans = tactic_term -> trans ] ;
"as" ; id = IDENT ->
- GrafiteAst.Relation (loc,id,a,aeq,refl,sym,trans)
+ G.Relation (loc,id,a,aeq,refl,sym,trans)
]];
lexicon_command: [ [
IDENT "alias" ; spec = alias_spec ->
- LexiconAst.Alias (loc, spec)
+ L.Alias (loc, spec)
| IDENT "notation"; (dir, l1, assoc, prec, l2) = notation ->
- LexiconAst.Notation (loc, dir, l1, assoc, prec, l2)
+ L.Notation (loc, dir, l1, assoc, prec, l2)
| IDENT "interpretation"; id = QSTRING;
(symbol, args, l3) = interpretation ->
- LexiconAst.Interpretation (loc, id, (symbol, args), l3)
+ L.Interpretation (loc, id, (symbol, args), l3)
]];
executable: [
- [ cmd = grafite_command; SYMBOL "." -> GrafiteAst.Command (loc, cmd)
+ [ cmd = grafite_command; SYMBOL "." -> G.Command (loc, cmd)
| tac = atomic_tactical LEVEL "loops"; punct = punctuation_tactical ->
- GrafiteAst.Tactic (loc, Some tac, punct)
- | punct = punctuation_tactical -> GrafiteAst.Tactic (loc, None, punct)
+ G.Tactic (loc, Some tac, punct)
+ | punct = punctuation_tactical -> G.Tactic (loc, None, punct)
| tac = ntactic; punct = punctuation_tactical ->
- GrafiteAst.NTactic (loc, tac, punct)
+ G.NTactic (loc, tac, punct)
| SYMBOL "#" ; SYMBOL "#" ; punct = punctuation_tactical ->
- GrafiteAst.NTactic (loc, GrafiteAst.NId loc, punct)
+ G.NTactic (loc, G.NId loc, punct)
| tac = non_punctuation_tactical; punct = punctuation_tactical ->
- GrafiteAst.NonPunctuationTactical (loc, tac, punct)
- | mac = macro; SYMBOL "." -> GrafiteAst.Macro (loc, mac)
+ G.NonPunctuationTactical (loc, tac, punct)
+ | mac = macro; SYMBOL "." -> G.Macro (loc, mac)
]
];
comment: [
[ BEGINCOMMENT ; ex = executable ; ENDCOMMENT ->
- GrafiteAst.Code (loc, ex)
+ G.Code (loc, ex)
| str = NOTE ->
- GrafiteAst.Note (loc, str)
+ G.Note (loc, str)
]
];
statement: [
[ ex = executable ->
- fun ?(never_include=false) ~include_paths status -> status,LSome(GrafiteAst.Executable (loc,ex))
+ fun ?(never_include=false) ~include_paths status ->
+ let stm = G.Executable (loc, ex) in
+ !grafite_callback status stm;
+ status, LSome stm
| com = comment ->
fun ?(never_include=false) ~include_paths status ->
- status,LSome (GrafiteAst.Comment (loc, com))
+ let stm = G.Comment (loc, com) in
+ !grafite_callback status stm;
+ status, LSome stm
| (iloc,fname,mode) = include_command ; SYMBOL "." ->
- !out fname;
fun ?(never_include=false) ~include_paths status ->
- let _root, buri, fullpath, _rrelpath =
- Librarian.baseuri_of_script ~include_paths fname
- in
- let status =
- if never_include then raise (NoInclusionPerformed fullpath)
- else LexiconEngine.eval_command status
- (LexiconAst.Include (iloc,buri,mode,fullpath))
- in
- status,
- LSome
- (GrafiteAst.Executable
- (loc,GrafiteAst.Command
- (loc,GrafiteAst.Include (iloc,buri))))
+ let stm =
+ G.Executable (loc, G.Command (loc, G.Include (iloc, fname)))
+ in
+ !grafite_callback status stm;
+ let _root, buri, fullpath, _rrelpath =
+ Librarian.baseuri_of_script ~include_paths fname
+ in
+ let stm =
+ G.Executable (loc, G.Command (loc, G.Include (iloc, buri)))
+ in
+ let status =
+ if never_include then raise (NoInclusionPerformed fullpath)
+ else LE.eval_command status (L.Include (iloc,buri,mode,fullpath))
+ in
+ status, LSome stm
| scom = lexicon_command ; SYMBOL "." ->
fun ?(never_include=false) ~include_paths status ->
- let status = LexiconEngine.eval_command status scom in
- status,LNone loc
+ !lexicon_callback status scom;
+ let status = LE.eval_command status scom in
+ status, LNone loc
| EOI -> raise End_of_file
]
];
projects / helm.git / commitdiff