* http://helm.cs.unibo.it/
*)
-(* $Id$ *)
+(* $Id: grafiteParser.ml 13176 2016-04-18 15:29:33Z fguidi $ *)
module N = NotationPt
module G = GrafiteAst
-module L = LexiconAst
-module LE = LexiconEngine
-exception NoInclusionPerformed of string (* full path *)
-
-type 'a localized_option =
- LSome of 'a
- | LNone of G.loc
-
-type ast_statement =
- (N.term, N.term, N.term G.reduction, N.term N.obj, string) G.statement
-
-type 'status statement =
- ?never_include:bool ->
- (* do not call LexiconEngine to do includes, always raise NoInclusionPerformed *)
- include_paths:string list -> (#LE.status as 'status) ->
- 'status * ast_statement localized_option
-
-type 'status parser_status = {
- grammar : Grammar.g;
- term : N.term Grammar.Entry.e;
- statement : #LE.status as 'status statement Grammar.Entry.e;
-}
+let exc_located_wrapper f =
+ try
+ f ()
+ with
+ | Ploc.Exc (_, End_of_file) -> raise End_of_file
+ | Ploc.Exc (floc, Stream.Error msg) ->
+ raise (HExtlib.Localized (floc,CicNotationParser.Parse_error msg))
+ | Ploc.Exc (floc, HExtlib.Localized(_,exn)) ->
+ raise (HExtlib.Localized
+ (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
+ | Ploc.Exc (floc, exn) ->
+ raise (HExtlib.Localized
+ (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
-let grafite_callback = ref (fun _ -> ())
-let set_grafite_callback cb = grafite_callback := cb
+type parsable = Grammar.parsable * Ulexing.lexbuf
-let lexicon_callback = ref (fun _ -> ())
-let set_lexicon_callback cb = lexicon_callback := cb
+let parsable_statement status buf =
+ let grammar = CicNotationParser.level2_ast_grammar status in
+ Grammar.parsable grammar (Obj.magic buf), buf
-let initial_parser () =
- let grammar = CicNotationParser.level2_ast_grammar () in
- let term = CicNotationParser.term () in
- let statement = Grammar.Entry.create grammar "statement" in
- { grammar = grammar; term = term; statement = statement }
-;;
+let parse_statement grafite_parser parsable =
+ exc_located_wrapper
+ (fun () -> (Grammar.Entry.parse_parsable grafite_parser (fst parsable)))
-let grafite_parser = ref (initial_parser ())
+let strm_of_parsable (_,buf) = buf
let add_raw_attribute ~text t = N.AttributedTerm (`Raw text, t)
let default_associativity = Gramext.NonA
-let mk_rec_corec ind_kind defs loc =
- (* In case of mutual definitions here we produce just
- the syntax tree for the first one. The others will be
- generated from the completely specified term just before
- insertion in the environment. We use the flavour
- `MutualDefinition to rememer this. *)
- let name,ty =
- match defs with
- | (params,(N.Ident (name, None), ty),_,_) :: _ ->
- let ty = match ty with Some ty -> ty | None -> N.Implicit `JustOne in
- let ty =
- List.fold_right
- (fun var ty -> N.Binder (`Pi,var,ty)
- ) params ty
- in
- name,ty
- | _ -> assert false
- in
- let body = N.Ident (name,None) in
- let flavour =
- if List.length defs = 1 then
- `Definition
- else
- `MutualDefinition
- in
- (loc, N.Theorem(flavour, name, ty, Some (N.LetRec (ind_kind, defs, body)), `Regular))
+let mk_rec_corec src flavour ind_kind defs loc =
+ let attrs = src, flavour, `Regular in
+ (loc, N.LetRec (ind_kind, defs, attrs))
-let nmk_rec_corec ind_kind defs loc =
- let loc,t = mk_rec_corec ind_kind defs loc in
- G.NObj (loc,t)
+let nmk_rec_corec src flavour ind_kind defs loc index =
+ let loc,t = mk_rec_corec src flavour ind_kind defs loc in
+ G.NObj (loc,t,index)
-let npunct_of_punct = function
- | G.Branch loc -> G.NBranch loc
- | G.Shift loc -> G.NShift loc
- | G.Pos (loc, i) -> G.NPos (loc, i)
- | G.Wildcard loc -> G.NWildcard loc
- | G.Merge loc -> G.NMerge loc
- | G.Semicolon loc -> G.NSemicolon loc
- | G.Dot loc -> G.NDot loc
-;;
+let shift_vars binder (vars, ty) bo =
+ let map var bo = N.Binder (binder, (var, ty), bo) in
+ List.fold_right map vars bo
+
+let shift_params binder params bo =
+ List.fold_right (shift_vars binder) params bo
+(*
let nnon_punct_of_punct = function
| G.Skip loc -> G.NSkip loc
| G.Unfocus loc -> G.NUnfocus loc
| G.Focus (loc,l) -> G.NFocus (loc,l)
-;;
-let npunct_of_punct = function
- | G.Branch loc -> G.NBranch loc
- | G.Shift loc -> G.NShift loc
- | G.Pos (loc, i) -> G.NPos (loc, i)
- | G.Wildcard loc -> G.NWildcard loc
- | G.Merge loc -> G.NMerge loc
- | G.Semicolon loc -> G.NSemicolon loc
- | G.Dot loc -> G.NDot loc
-;;
-let cons_ntac t p =
- match t with
- | G.NTactic(loc,[t]) -> G.NTactic(loc,[t;p])
- | x -> x
-;;
+;; *)
type by_continuation =
BYC_done
| BYC_letsuchthat of string * N.term * string * N.term
| BYC_wehaveand of string * N.term * string * N.term
-let initialize_parser () =
+let mk_parser statement lstatus =
+(* let grammar = CicNotationParser.level2_ast_grammar lstatus in *)
+ let term = CicNotationParser.term lstatus in
+ let let_defs = CicNotationParser.let_defs lstatus in
+ let let_codefs = CicNotationParser.let_codefs lstatus in
+ let protected_binder_vars = CicNotationParser.protected_binder_vars lstatus in
(* {{{ parser initialization *)
- let term = !grafite_parser.term in
- let statement = !grafite_parser.statement in
- let let_defs = CicNotationParser.let_defs () in
- let protected_binder_vars = CicNotationParser.protected_binder_vars () in
EXTEND
GLOBAL: term statement;
constructor: [ [ name = IDENT; SYMBOL ":"; typ = term -> (name, typ) ] ];
tactic_term: [ [ t = term LEVEL "90" -> t ] ];
- new_name: [
- [ SYMBOL "_" -> None
- | id = IDENT -> Some id ]
- ];
- ident_list0: [ [ LPAREN; idents = LIST0 new_name; RPAREN -> idents ] ];
ident_list1: [ [ LPAREN; idents = LIST1 IDENT; RPAREN -> idents ] ];
- tactic_term_list1: [
- [ tactic_terms = LIST1 tactic_term SEP SYMBOL "," -> tactic_terms ]
- ];
- reduction_kind: [
- [ IDENT "normalize" -> `Normalize
- | IDENT "simplify" -> `Simpl
- | IDENT "unfold"; t = OPT tactic_term -> `Unfold t
- | IDENT "whd" -> `Whd ]
- ];
nreduction_kind: [
- [ IDENT "nnormalize" ; delta = OPT [ IDENT "nodelta" -> () ] ->
+ [ IDENT "normalize" ; delta = OPT [ IDENT "nodelta" -> () ] ->
let delta = match delta with None -> true | _ -> false in
`Normalize delta
- (*| IDENT "unfold"; t = OPT tactic_term -> `Unfold t*)
- | IDENT "nwhd" ; delta = OPT [ IDENT "nodelta" -> () ] ->
+ | IDENT "whd" ; delta = OPT [ IDENT "nodelta" -> () ] ->
let delta = match delta with None -> true | _ -> false in
`Whd delta]
];
];
pattern_spec: [
[ res = OPT [
- "in";
+ "in" ;
wanted_and_sps =
[ "match" ; wanted = tactic_term ;
sps = OPT [ "in"; sps = sequent_pattern_spec -> sps ] ->
Some wanted,sps
| sps = sequent_pattern_spec ->
None,Some sps
- ] ->
+ ];
+ SYMBOL ";" ->
let wanted,hyp_paths,goal_path =
match wanted_and_sps with
wanted,None -> wanted, [], Some N.UserInput
| N.Implicit _ -> false
| N.UserInput -> true
| _ -> raise (Invalid_argument "malformed target parameter list 1")) l
- | _ -> raise (Invalid_argument ("malformed target parameter list 2\n" ^ NotationPp.pp_term params)) ]
+ | _ ->
+ (*CSC: new NCicPp.status is the best I can do here without changing the
+ result type *)
+ raise (Invalid_argument ("malformed target parameter list 2\n" ^ NotationPp.pp_term (new NCicPp.status) params)) ]
];
direction: [
[ SYMBOL ">" -> `LeftToRight
| SYMBOL "<" -> `RightToLeft ]
];
int: [ [ num = NUMBER -> int_of_string num ] ];
- intros_names: [
- [ idents = OPT ident_list0 ->
- match idents with None -> [] | Some idents -> idents
- ]
- ];
- intros_spec: [
- [ OPT [ IDENT "names" ];
- num = OPT [ num = int -> num ];
- idents = intros_names ->
- num, idents
- ]
- ];
- using: [ [ using = OPT [ IDENT "using"; t = tactic_term -> t ] -> using ] ];
ntactic: [
- [ IDENT "napply"; t = tactic_term -> G.NTactic(loc,[G.NApply (loc, t)])
- | IDENT "napplyS"; t = tactic_term -> G.NTactic(loc,[G.NSmartApply(loc, t)])
- | IDENT "nassert";
+ [ SYMBOL "@"; t = tactic_term -> G.NTactic(loc,[G.NApply (loc, t)])
+ | IDENT "applyS"; t = tactic_term -> G.NTactic(loc,[G.NSmartApply(loc, t)])
+ | IDENT "assert";
seqs = LIST0 [
hyps = LIST0
[ id = IDENT ; SYMBOL ":" ; ty = tactic_term -> id,`Decl ty
SYMBOL <:unicode<vdash>>;
concl = tactic_term -> (List.rev hyps,concl) ] ->
G.NTactic(loc,[G.NAssert (loc, seqs)])
- | IDENT "nauto"; params = auto_params ->
- G.NTactic(loc,[G.NAuto (loc, params)])
| SYMBOL "/"; num = OPT NUMBER ;
- params = nauto_params; SYMBOL "/" ;
- just = OPT [ IDENT "by"; by =
- [ univ = tactic_term_list1 -> `Univ univ
- | SYMBOL "{"; SYMBOL "}" -> `EmptyUniv
- | SYMBOL "_" -> `Trace ] -> by ] ->
+ just_and_params = auto_params; SYMBOL "/" ->
+ let just,params = just_and_params in
let depth = match num with Some n -> n | None -> "1" in
(match just with
| None ->
- G.NTactic(loc,
- [G.NAuto(loc,(None,["slir","";"depth",depth]@params))])
+ G.NTactic(loc,
+ [G.NAuto(loc,(None,["depth",depth]@params))])
| Some (`Univ univ) ->
- G.NTactic(loc,
- [G.NAuto(loc,(Some univ,["slir","";"depth",depth]@params))])
- | Some `EmptyUniv ->
- G.NTactic(loc,
- [G.NAuto(loc,(Some [],["slir","";"depth",depth]@params))])
+ G.NTactic(loc,
+ [G.NAuto(loc,(Some univ,["depth",depth]@params))])
| Some `Trace ->
- G.NMacro(loc,
- G.NAutoInteractive (loc, (None,["slir","";"depth",depth]@params))))
- | IDENT "nintros" -> G.NMacro (loc, G.NIntroGuess loc)
- | IDENT "ncheck"; t = term -> G.NMacro(loc,G.NCheck (loc,t))
+ G.NMacro(loc,
+ G.NAutoInteractive (loc, (None,["depth",depth]@params))))
+ | SYMBOL "#"; SYMBOL "#" -> G.NMacro (loc, G.NIntroGuess loc)
+ | IDENT "check"; t = tactic_term -> G.NMacro(loc,G.NCheck (loc,t))
| IDENT "screenshot"; fname = QSTRING ->
G.NMacro(loc,G.Screenshot (loc, fname))
- | IDENT "ncases"; what = tactic_term ; where = pattern_spec ->
+ | IDENT "cases"; what = tactic_term ; where = pattern_spec ->
G.NTactic(loc,[G.NCases (loc, what, where)])
- | IDENT "nchange"; what = pattern_spec; "with"; with_what = tactic_term ->
+ | IDENT "change"; "with"; with_what = tactic_term; what = pattern_spec ->
G.NTactic(loc,[G.NChange (loc, what, with_what)])
- | SYMBOL "@"; num = OPT NUMBER; l = LIST0 tactic_term ->
- G.NTactic(loc,[G.NConstructor (loc, (match num with None -> None | Some x -> Some (int_of_string x)),l)])
- | IDENT "ncut"; t = tactic_term -> G.NTactic(loc,[G.NCut (loc, t)])
-(* | IDENT "ndiscriminate"; t = tactic_term -> G.NDiscriminate (loc, t)
- | IDENT "nsubst"; t = tactic_term -> G.NSubst (loc, t) *)
- | IDENT "ndestruct"; just = OPT [ dom = ident_list1 -> dom ];
+ | SYMBOL "-"; id = IDENT ->
+ G.NTactic(loc,[G.NClear (loc, [id])])
+ | PLACEHOLDER; num = OPT NUMBER;
+ l = OPT [ SYMBOL "{"; l = LIST1 tactic_term; SYMBOL "}" -> l ] ->
+ G.NTactic(loc,[G.NConstructor (loc, (match num with None -> None | Some x -> Some (int_of_string x)),match l with None -> [] | Some l -> l)])
+ | IDENT "cut"; t = tactic_term -> G.NTactic(loc,[G.NCut (loc, t)])
+ | IDENT "destruct"; just = OPT [ dom = ident_list1 -> dom ];
exclude = OPT [ IDENT "skip"; skip = ident_list1 -> skip ]
-> let exclude' = match exclude with None -> [] | Some l -> l in
G.NTactic(loc,[G.NDestruct (loc,just,exclude')])
- | IDENT "nelim"; what = tactic_term ; where = pattern_spec ->
+ | IDENT "elim"; what = tactic_term ; where = pattern_spec ->
G.NTactic(loc,[G.NElim (loc, what, where)])
- | IDENT "ngeneralize"; p=pattern_spec ->
+ | IDENT "generalize"; p=pattern_spec ->
G.NTactic(loc,[G.NGeneralize (loc, p)])
- | IDENT "ninversion"; what = tactic_term ; where = pattern_spec ->
+ | IDENT "inversion"; what = tactic_term ; where = pattern_spec ->
G.NTactic(loc,[G.NInversion (loc, what, where)])
- | IDENT "nlapply"; t = tactic_term -> G.NTactic(loc,[G.NLApply (loc, t)])
- | IDENT "nletin"; name = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term;
+ | IDENT "lapply"; t = tactic_term -> G.NTactic(loc,[G.NLApply (loc, t)])
+ | IDENT "letin"; name = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term;
where = pattern_spec ->
G.NTactic(loc,[G.NLetIn (loc,where,t,name)])
| kind = nreduction_kind; p = pattern_spec ->
G.NTactic(loc,[G.NReduce (loc, kind, p)])
- | IDENT "nrewrite"; dir = direction; what = tactic_term ; where = pattern_spec ->
+ | dir = direction; what = tactic_term ; where = pattern_spec ->
G.NTactic(loc,[G.NRewrite (loc, dir, what, where)])
- | IDENT "ntry"; tac = SELF ->
+ | IDENT "try"; tac = SELF ->
let tac = match tac with G.NTactic(_,[t]) -> t | _ -> assert false in
G.NTactic(loc,[ G.NTry (loc,tac)])
- | IDENT "nrepeat"; tac = SELF ->
+ | IDENT "repeat"; tac = SELF ->
let tac = match tac with G.NTactic(_,[t]) -> t | _ -> assert false in
G.NTactic(loc,[ G.NRepeat (loc,tac)])
| LPAREN; l = LIST1 SELF; RPAREN ->
List.flatten
(List.map (function G.NTactic(_,t) -> t | _ -> assert false) l) in
G.NTactic(loc,[G.NBlock (loc,l)])
- | IDENT "nassumption" -> G.NTactic(loc,[ G.NAssumption loc])
- | SYMBOL "#"; ns=LIST0 IDENT -> G.NTactic(loc,[ G.NIntros (loc,ns)])
+ | IDENT "assumption" -> G.NTactic(loc,[ G.NAssumption loc])
+ | SYMBOL "#"; ns=IDENT -> G.NTactic(loc,[ G.NIntros (loc,[ns])])
| SYMBOL "#"; SYMBOL "_" -> G.NTactic(loc,[ G.NIntro (loc,"_")])
| SYMBOL "*" -> G.NTactic(loc,[ G.NCase1 (loc,"_")])
- | SYMBOL "*"; n=IDENT -> G.NTactic(loc,[ G.NCase1 (loc,n)])
+ | SYMBOL "*"; "as"; n=IDENT -> G.NTactic(loc,[ G.NCase1 (loc,n)])
]
];
- tactic: [
- [ IDENT "absurd"; t = tactic_term ->
- G.Absurd (loc, t)
- | IDENT "apply"; IDENT "rule"; t = tactic_term ->
- G.ApplyRule (loc, t)
- | IDENT "apply"; t = tactic_term ->
- G.Apply (loc, t)
- | IDENT "applyP"; t = tactic_term ->
- G.ApplyP (loc, t)
- | IDENT "applyS"; t = tactic_term ; params = auto_params ->
- G.ApplyS (loc, t, params)
- | IDENT "assumption" ->
- G.Assumption loc
- | IDENT "autobatch"; params = auto_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 N.UserInput
- | Some pattern -> pattern
- in
- G.Cases (loc, what, pattern, specs)
- | IDENT "clear"; ids = LIST1 IDENT ->
- G.Clear (loc, ids)
- | IDENT "clearbody"; id = IDENT ->
- G.ClearBody (loc,id)
- | IDENT "change"; what = pattern_spec; "with"; t = tactic_term ->
- 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
- G.Compose (loc, t1, t2, times, specs)
- | IDENT "constructor"; n = int ->
- G.Constructor (loc, n)
- | IDENT "contradiction" ->
- G.Contradiction loc
- | IDENT "cut"; t = tactic_term; ident = OPT [ "as"; id = IDENT -> id] ->
- 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
- G.Decompose (loc, idents)
- | IDENT "demodulate"; p = auto_params -> G.Demodulate (loc, p)
- | IDENT "destruct"; xts = OPT [ ts = tactic_term_list1 -> ts ] ->
- 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 N.UserInput
- | Some pattern -> pattern
- in
- G.Elim (loc, what, using, pattern, ispecs)
- | IDENT "elimType"; what = tactic_term; using = using;
- (num, idents) = intros_spec ->
- G.ElimType (loc, what, using, (num, idents))
- | IDENT "exact"; t = tactic_term ->
- G.Exact (loc, t)
- | IDENT "exists" ->
- 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
- raise (HExtlib.Localized (loc, CicNotationParser.Parse_error
- ("the pattern cannot specify the term to replace, only its"
- ^ " paths in the hypotheses and in the conclusion")))
- else
- G.Fold (loc, kind, t, p)
- | IDENT "fourier" ->
- 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
- G.FwdSimpl (loc, hyp, idents)
- | IDENT "generalize"; p=pattern_spec; id = OPT ["as" ; id = IDENT -> id] ->
- 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
- G.Intros (loc, (Some 1, idents))
- | IDENT "intros"; specs = intros_spec ->
- G.Intros (loc, specs)
- | IDENT "inversion"; t = tactic_term ->
- G.Inversion (loc, t)
- | IDENT "lapply";
- linear = OPT [ IDENT "linear" ];
- depth = OPT [ IDENT "depth"; SYMBOL "="; i = int -> i ];
- what = tactic_term;
- to_what = OPT [ "to" ; t = tactic_term_list1 -> t ];
- 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
- G.LApply (loc, linear, depth, to_what, what, ident)
- | IDENT "left" -> G.Left loc
- | IDENT "letin"; where = IDENT ; SYMBOL <:unicode<def>> ; t = tactic_term ->
- G.LetIn (loc, t, where)
- | kind = reduction_kind; p = pattern_spec ->
- G.Reduce (loc, kind, p)
- | IDENT "reflexivity" ->
- G.Reflexivity loc
- | IDENT "replace"; p = pattern_spec; "with"; t = tactic_term ->
- 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
- if pt <> None then
- raise
- (HExtlib.Localized (loc,
- (CicNotationParser.Parse_error
- "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
- G.Rewrite (loc, d, t, p, n)
- | IDENT "right" ->
- G.Right loc
- | IDENT "ring" ->
- G.Ring loc
- | IDENT "split" ->
- G.Split loc
- | IDENT "symmetry" ->
- G.Symmetry loc
- | IDENT "transitivity"; t = tactic_term ->
- G.Transitivity (loc, t)
- (* Produzioni Aggiunte *)
- | IDENT "assume" ; id = IDENT ; SYMBOL ":" ; t = tactic_term ->
- 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']->
- G.Suppose (loc, t, id, t1)
- | "let" ; id1 = IDENT ; SYMBOL ":" ; t1 = tactic_term ;
- IDENT "such" ; IDENT "that" ; t2=tactic_term ; LPAREN ;
- id2 = IDENT ; RPAREN ->
- G.ExistsElim (loc, `Auto (None,[]), 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 -> G.Bydone (loc, just)
- | BYC_weproved (ty,id,t1) ->
- G.By_just_we_proved(loc, just, ty, id, t1)
- | BYC_letsuchthat (id1,t1,id2,t2) ->
- G.ExistsElim (loc, just, id1, t1, id2, t2)
- | BYC_wehaveand (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']->
- 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 ->
- 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 ->
- 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 ->
- G.Byinduction(loc, t, id)
- | IDENT "the" ; IDENT "thesis" ; IDENT "becomes" ; t=tactic_term ->
- G.Thesisbecomes(loc, t)
- | IDENT "case" ; id = IDENT ; params=LIST0[LPAREN ; i=IDENT ;
- SYMBOL":" ; t=tactic_term ; RPAREN -> i,t] ->
- G.Case(loc,id,params)
- (* DO NOT FACTORIZE with the two following, camlp5 sucks*)
- | IDENT "conclude";
- termine = tactic_term;
- SYMBOL "=" ;
- t1=tactic_term ;
- t2 =
- [ IDENT "using"; t=tactic_term -> `Term t
- | IDENT "using"; IDENT "once"; term=tactic_term -> `SolveWith term
- | IDENT "proof" -> `Proof
- | params = auto_params -> `Auto params];
- cont = rewriting_step_continuation ->
- G.RewritingStep(loc, Some (None,termine), t1, t2, cont)
- | IDENT "obtain" ; name = IDENT;
- termine = tactic_term;
- SYMBOL "=" ;
- t1=tactic_term ;
- t2 =
- [ IDENT "using"; t=tactic_term -> `Term t
- | IDENT "using"; IDENT "once"; term=tactic_term -> `SolveWith term
- | IDENT "proof" -> `Proof
- | params = auto_params -> `Auto params];
- cont = rewriting_step_continuation ->
- G.RewritingStep(loc, Some (Some name,termine), t1, t2, cont)
- | SYMBOL "=" ;
- t1=tactic_term ;
- t2 =
- [ IDENT "using"; t=tactic_term -> `Term t
- | IDENT "using"; IDENT "once"; term=tactic_term -> `SolveWith term
- | IDENT "proof" -> `Proof
- | params = auto_params -> `Auto params];
- cont = rewriting_step_continuation ->
- G.RewritingStep(loc, None, t1, t2, cont)
- ]
-];
auto_fixed_param: [
[ IDENT "demod"
| IDENT "fast_paramod"
| IDENT "paramod"
- | IDENT "depth"
| IDENT "width"
| IDENT "size"
- | IDENT "timeout"
- | IDENT "library"
- | IDENT "type"
- | IDENT "all"
+ | IDENT "nohyps"
+(* | IDENT "timeout" *)
]
];
auto_params: [
i = auto_fixed_param -> i,""
| i = auto_fixed_param ; SYMBOL "="; v = [ v = int ->
string_of_int v | v = IDENT -> v ] -> i,v ];
- tl = OPT [ IDENT "by"; tl = tactic_term_list1 -> tl] -> tl,
- (* (match tl with Some l -> l | None -> []), *)
- params
- ]
-];
- nauto_params: [
- [ params =
- LIST0 [
- i = auto_fixed_param -> i,""
- | i = auto_fixed_param ; SYMBOL "="; v = [ v = int ->
- string_of_int v | v = IDENT -> v ] -> i,v ] ->
- params
+ just = OPT [ IDENT "by"; by =
+ [ univ = LIST0 tactic_term SEP SYMBOL "," -> `Univ univ
+ | SYMBOL "_" -> `Trace ] -> by ] -> just,params
]
];
- inline_params:[
- [ params = LIST0
- [ IDENT "prefix"; SYMBOL "="; prefix = QSTRING -> G.IPPrefix prefix
- | flavour = inline_flavour -> G.IPAs flavour
- | IDENT "coercions" -> G.IPCoercions
- | IDENT "debug"; SYMBOL "="; debug = int -> G.IPDebug debug
- | IDENT "procedural" -> G.IPProcedural
- | IDENT "nodefaults" -> G.IPNoDefaults
- | IDENT "depth"; SYMBOL "="; depth = int -> G.IPDepth depth
- | IDENT "level"; SYMBOL "="; level = int -> G.IPLevel level
- | IDENT "comments" -> G.IPComments
- | IDENT "cr" -> G.IPCR
- ] -> params
- ]
-];
+(* MATITA 1.0
by_continuation: [
[ WEPROVED; 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)
| WEPROVED; ty = tactic_term ; t1 = OPT [IDENT "that" ; IDENT "is" ; IDENT "equivalent" ; "to" ; t2 = tactic_term -> t2] ;
BYC_wehaveand (id1,t1,id2,t2)
]
];
+*)
+(* MATITA 1.0
rewriting_step_continuation : [
[ "done" -> true
| -> false
]
];
+*)
+(* MATITA 1.0
atomic_tactical:
[ "sequence" LEFTA
[ t1 = SELF; SYMBOL ";"; t2 = SELF ->
| tac = tactic -> tac
]
];
+*)
npunctuation_tactical:
[
[ SYMBOL "[" -> G.NBranch loc
| SYMBOL "." -> G.NDot loc
]
];
- punctuation_tactical:
- [
- [ 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:
+ nnon_punctuation_tactical:
[ "simple" NONA
- [ IDENT "focus"; goals = LIST1 int -> G.Focus (loc, goals)
- | IDENT "unfocus" -> G.Unfocus loc
- | IDENT "skip" -> G.Skip loc
+ [ IDENT "focus"; goals = LIST1 int -> G.NFocus (loc, goals)
+ | IDENT "unfocus" -> G.NUnfocus loc
+ | IDENT "skip" -> G.NSkip loc
]
];
ntheorem_flavour: [
- [ [ IDENT "ndefinition" ] -> `Definition
- | [ IDENT "nfact" ] -> `Fact
- | [ IDENT "nlemma" ] -> `Lemma
- | [ IDENT "nremark" ] -> `Remark
- | [ IDENT "ntheorem" ] -> `Theorem
- ]
- ];
- theorem_flavour: [
[ [ IDENT "definition" ] -> `Definition
| [ IDENT "fact" ] -> `Fact
| [ IDENT "lemma" ] -> `Lemma
- | [ IDENT "remark" ] -> `Remark
+ | [ IDENT "example" ] -> `Example
| [ IDENT "theorem" ] -> `Theorem
+ | [ IDENT "corollary" ] -> `Corollary
]
];
- inline_flavour: [
- [ attr = theorem_flavour -> attr
- | [ IDENT "axiom" ] -> `Axiom
- | [ IDENT "variant" ] -> `Variant
- ]
- ];
inductive_spec: [ [
fst_name = IDENT;
params = LIST0 protected_binder_vars;
let ident = "\\("^alpha^ident_cont^"*"^decoration^"*\\|_"^ident_cont^"+"^decoration^"*\\)" in
let rex = Str.regexp ("^"^ident^"$") in
if Str.string_match rex id 0 then
- if (try ignore (UriManager.uri_of_string uri); true
- with UriManager.IllFormedUri _ -> false) ||
- (try ignore (NReference.reference_of_string uri); true
+ if (try ignore (NReference.reference_of_string uri); true
with NReference.IllFormedReference _ -> false)
then
- L.Ident_alias (id, uri)
+ G.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
- L.Symbol_alias (symbol, instance, dsc)
+ G.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
- L.Number_alias (instance, dsc)
+ G.Number_alias (instance, dsc)
]
];
argument: [
p2 =
[ blob = UNPARSED_AST ->
add_raw_attribute ~text:(Printf.sprintf "@{%s}" blob)
- (CicNotationParser.parse_level2_ast
+ (CicNotationParser.parse_level2_ast lstatus
(Ulexing.from_utf8_string blob))
| blob = UNPARSED_META ->
add_raw_attribute ~text:(Printf.sprintf "${%s}" blob)
- (CicNotationParser.parse_level2_meta
+ (CicNotationParser.parse_level2_meta lstatus
(Ulexing.from_utf8_string blob))
] ->
let assoc =
in
let p1 =
add_raw_attribute ~text:s
- (CicNotationParser.parse_level1_pattern prec
+ (CicNotationParser.parse_level1_pattern lstatus prec
(Ulexing.from_utf8_string s))
in
(dir, p1, assoc, prec, p2)
]
];
level3_term: [
- [ u = URI -> N.UriPattern (UriManager.uri_of_string u)
- | r = NREF -> N.NRefPattern (NReference.reference_of_string r)
+ [ r = NREF -> N.NRefPattern (NReference.reference_of_string r)
| IMPLICIT -> N.ImplicitPattern
| id = IDENT -> N.VarPattern id
| LPAREN; terms = LIST1 SELF; RPAREN ->
include_command: [ [
IDENT "include" ; path = QSTRING ->
- loc,path,true,L.WithPreferences
- | IDENT "include" ; IDENT "source" ; path = QSTRING ->
- loc,path,false,L.WithPreferences
+ loc,path,G.WithPreferences
+ | IDENT "include" ; IDENT "alias"; path = QSTRING ->
+ loc,path,G.OnlyPreferences
| IDENT "include'" ; path = QSTRING ->
- loc,path,true,L.WithoutPreferences
+ loc,path,G.WithoutPreferences
]];
+ index: [[ b = OPT SYMBOL "-" -> match b with None -> true | _ -> false ]];
+
+ source: [[
+ src = OPT [ IDENT "implied" ] ->
+ match src with None -> `Provided | _ -> `Implied
+ ]];
+
grafite_ncommand: [ [
- IDENT "nqed" -> G.NQed loc
- | nflavour = ntheorem_flavour; name = IDENT; SYMBOL ":"; typ = term;
+ lc = lexicon_command -> lc
+ | IDENT "qed" ; i = index -> G.NQed (loc,i)
+ | IDENT "defined" ; i = index -> G.NQed (loc,i) (* FG: presentational qed for definitions *)
+ | src = source; nflavour = ntheorem_flavour; name = IDENT;
+ params = LIST0 protected_binder_vars; SYMBOL ":"; typ = term; (* FG: params added *)
body = OPT [ SYMBOL <:unicode<def>> (* ≝ *); body = term -> body ] ->
- G.NObj (loc, N.Theorem (nflavour, name, typ, body,`Regular))
- | nflavour = ntheorem_flavour; name = IDENT; SYMBOL <:unicode<def>> (* ≝ *);
+ let typ = shift_params `Forall params typ in
+ let body = match body with
+ | Some bo -> Some (shift_params `Lambda params bo)
+ | None -> None
+ in
+ let attrs = src, nflavour, `Regular in
+ G.NObj (loc, N.Theorem (name, typ, body, attrs),true)
+ | src = source; nflavour = ntheorem_flavour; name = IDENT;
+ params = LIST0 protected_binder_vars; SYMBOL <:unicode<def>> (* ≝ *); (* FG: params added *)
body = term ->
- G.NObj (loc, N.Theorem (nflavour, name, N.Implicit `JustOne, Some body,`Regular))
- | IDENT "naxiom"; name = IDENT; SYMBOL ":"; typ = term ->
- G.NObj (loc, N.Theorem (`Axiom, name, typ, None, `Regular))
- | IDENT "ndiscriminator" ; indty = tactic_term -> G.NDiscriminator (loc,indty)
- | IDENT "ninverter"; name = IDENT; IDENT "for" ; indty = tactic_term ;
- paramspec = OPT inverter_param_list ;
- outsort = OPT [ SYMBOL ":" ; outsort = term -> outsort ] ->
- G.NInverter (loc,name,indty,paramspec,outsort)
- | NLETCOREC ; defs = let_defs ->
- nmk_rec_corec `CoInductive defs loc
- | NLETREC ; defs = let_defs ->
- nmk_rec_corec `Inductive defs loc
- | IDENT "ninductive"; spec = inductive_spec ->
+ let body = shift_params `Lambda params body in
+ let attrs = src, nflavour, `Regular in
+ G.NObj (loc,
+ N.Theorem(name, N.Implicit `JustOne, Some body, attrs),
+ true)
+ | src = source; IDENT "axiom"; i = index; name = IDENT;
+ params = LIST0 protected_binder_vars; SYMBOL ":"; typ = term -> (* FG: params added *)
+ let typ = shift_params `Forall params typ in
+ let attrs = src, `Axiom, `Regular in
+ G.NObj (loc, N.Theorem (name, typ, None, attrs),i)
+ | src = source; IDENT "inductive"; spec = inductive_spec ->
let (params, ind_types) = spec in
- G.NObj (loc, N.Inductive (params, ind_types))
- | IDENT "ncoinductive"; spec = inductive_spec ->
+ G.NObj (loc, N.Inductive (params, ind_types, src),true)
+ | src = source; 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
- G.NObj (loc, N.Inductive (params, ind_types))
- | IDENT "universe"; IDENT "constraint"; u1 = tactic_term;
+ G.NObj (loc, N.Inductive (params, ind_types, src),true)
+ | src = source; IDENT "record" ; (params,name,ty,fields) = record_spec ->
+ G.NObj (loc, N.Record (params,name,ty,fields,src),true)
+(* FG: new syntax for inductive/coinductive definitions and statements *)
+ | src = source; IDENT "rec"; nflavour = ntheorem_flavour; defs = let_defs ->
+ nmk_rec_corec src nflavour `Inductive defs loc true
+ | src = source; IDENT "corec"; nflavour = ntheorem_flavour; defs = let_codefs ->
+ nmk_rec_corec src nflavour `CoInductive defs loc true
+(**)
+ | LETCOREC ; defs = let_codefs ->
+ nmk_rec_corec `Provided `Definition `CoInductive defs loc true
+ | LETREC ; defs = let_defs ->
+ nmk_rec_corec `Provided `Definition `Inductive defs loc true
+ | IDENT "discriminator" ; indty = tactic_term -> G.NDiscriminator (loc,indty)
+ | IDENT "inverter"; name = IDENT; IDENT "for" ; indty = tactic_term ;
+ paramspec = OPT inverter_param_list ;
+ outsort = OPT [ SYMBOL ":" ; outsort = term -> outsort ] ->
+ G.NInverter (loc,name,indty,paramspec,outsort)
+ | IDENT "universe"; cyclic = OPT [ IDENT "cyclic" -> () ] ; IDENT "constraint"; u1 = tactic_term;
SYMBOL <:unicode<lt>> ; u2 = tactic_term ->
+ let acyclic = match cyclic with None -> true | Some () -> false in
let urify = function
| NotationPt.AttributedTerm (_, NotationPt.Sort (`NType i)) ->
NUri.uri_of_string ("cic:/matita/pts/Type"^i^".univ")
in
let u1 = urify u1 in
let u2 = urify u2 in
- G.NUnivConstraint (loc,u1,u2)
+ G.NUnivConstraint (loc,acyclic,u1,u2)
| IDENT "unification"; IDENT "hint"; n = int; t = tactic_term ->
G.UnificationHint (loc, t, n)
- | IDENT "ncoercion"; name = IDENT; SYMBOL ":"; ty = term;
+ | IDENT "coercion"; name = IDENT;
+ compose = OPT [ IDENT "nocomposites" -> () ];
+ spec = OPT [ SYMBOL ":"; ty = term;
SYMBOL <:unicode<def>>; t = term; "on";
id = [ IDENT | PIDENT ]; SYMBOL ":"; source = term;
- "to"; target = term ->
- G.NCoercion(loc,name,t,ty,(id,source),target)
- | IDENT "nrecord" ; (params,name,ty,fields) = record_spec ->
- G.NObj (loc, N.Record (params,name,ty,fields))
- | IDENT "ncopy" ; s = IDENT; IDENT "from"; u = URI; "with";
+ "to"; target = term -> t,ty,(id,source),target ] ->
+ let compose = compose = None in
+ G.NCoercion(loc,name,compose,spec)
+ | IDENT "copy" ; s = IDENT; IDENT "from"; u = URI; "with";
m = LIST0 [ u1 = URI; SYMBOL <:unicode<mapsto>>; u2 = URI -> u1,u2 ] ->
G.NCopy (loc,s,NUri.uri_of_string u,
List.map (fun a,b -> NUri.uri_of_string a, NUri.uri_of_string b) m)
]];
- grafite_command: [ [
- IDENT "set"; n = QSTRING; v = QSTRING ->
- G.Set (loc, n, v)
- | IDENT "drop" -> G.Drop loc
- | IDENT "print"; s = IDENT -> G.Print (loc,s)
- ]];
lexicon_command: [ [
IDENT "alias" ; spec = alias_spec ->
- L.Alias (loc, spec)
+ G.Alias (loc, spec)
| IDENT "notation"; (dir, l1, assoc, prec, l2) = notation ->
- L.Notation (loc, dir, l1, assoc, prec, l2)
+ G.Notation (loc, dir, l1, assoc, prec, l2)
| IDENT "interpretation"; id = QSTRING;
(symbol, args, l3) = interpretation ->
- L.Interpretation (loc, id, (symbol, args), l3)
+ G.Interpretation (loc, id, (symbol, args), l3)
]];
executable: [
- [ cmd = grafite_command; SYMBOL "." -> G.Command (loc, cmd)
- | ncmd = grafite_ncommand; SYMBOL "." -> G.NCommand (loc, ncmd)
- | tac = atomic_tactical LEVEL "loops"; punct = punctuation_tactical ->
- G.Tactic (loc, Some tac, punct)
- | punct = punctuation_tactical -> G.Tactic (loc, None, punct)
- | tac = ntactic; OPT [ SYMBOL "#" ; SYMBOL "#" ] ;
- punct = punctuation_tactical ->
- cons_ntac tac (npunct_of_punct punct)
+ [ ncmd = grafite_ncommand; SYMBOL "." -> G.NCommand (loc, ncmd)
+ | punct = npunctuation_tactical -> G.NTactic (loc, [punct])
+ | tac = nnon_punctuation_tactical(*; punct = npunctuation_tactical*) ->
+ G.NTactic (loc, [tac])
+ | tac = ntactic (*; punct = npunctuation_tactical*) ->
+ tac
(*
- | tac = ntactic; punct = punctuation_tactical ->
- cons_ntac tac (npunct_of_punct punct)
+ | tac = nnon_punctuation_tactical;
+ punct = npunctuation_tactical ->
+ G.NTactic (loc, [tac; punct])
*)
- | SYMBOL "#" ; SYMBOL "#" ; punct = npunctuation_tactical ->
- G.NTactic (loc, [punct])
- | tac = non_punctuation_tactical; punct = punctuation_tactical ->
- G.NonPunctuationTactical (loc, tac, punct)
- | SYMBOL "#" ; SYMBOL "#" ; tac = non_punctuation_tactical;
- SYMBOL "#" ; SYMBOL "#" ; punct = punctuation_tactical ->
- G.NTactic (loc, [nnon_punct_of_punct tac; npunct_of_punct punct])
- | SYMBOL "#" ; SYMBOL "#" ; tac = non_punctuation_tactical;
- punct = punctuation_tactical ->
- G.NTactic (loc, [nnon_punct_of_punct tac; npunct_of_punct punct])
]
];
comment: [
]
];
statement: [
- [ ex = executable ->
- fun ?(never_include=false) ~include_paths status ->
- let stm = G.Executable (loc, ex) in
- !grafite_callback stm;
- status, LSome stm
- | com = comment ->
- fun ?(never_include=false) ~include_paths status ->
- let stm = G.Comment (loc, com) in
- !grafite_callback stm;
- status, LSome stm
- | (iloc,fname,normal,mode) = include_command ; SYMBOL "." ->
- fun ?(never_include=false) ~include_paths status ->
- let _root, buri, fullpath, _rrelpath =
- Librarian.baseuri_of_script ~include_paths fname in
- if never_include then raise (NoInclusionPerformed fullpath)
- else
- begin
- let stm =
- G.Executable
- (loc, G.Command (loc, G.Include (iloc,normal,`OldAndNew,fname))) in
- !grafite_callback stm;
- let status =
- LE.eval_command status (L.Include (iloc,buri,mode,fullpath)) in
- let stm =
- G.Executable
- (loc,G.Command (loc,G.Include (iloc,normal,`OldAndNew,buri)))
- in
- status, LSome stm
- end
- | scom = lexicon_command ; SYMBOL "." ->
- fun ?(never_include=false) ~include_paths status ->
- !lexicon_callback scom;
- let status = LE.eval_command status scom in
- status, LNone loc
+ [ ex = executable -> G.Executable (loc, ex)
+ | com = comment -> G.Comment (loc, com)
+ | (iloc,fname,mode) = include_command ; SYMBOL "." ->
+ G.Executable (loc,G.NCommand (loc,G.Include (iloc,mode,fname)))
| EOI -> raise End_of_file
]
];
-END
+ END;
(* }}} *)
+ statement
;;
-let _ = initialize_parser () ;;
-
-let exc_located_wrapper f =
- try
- f ()
- with
- | Stdpp.Exc_located (_, End_of_file) -> raise End_of_file
- | Stdpp.Exc_located (floc, Stream.Error msg) ->
- raise (HExtlib.Localized (floc,CicNotationParser.Parse_error msg))
- | Stdpp.Exc_located (floc, HExtlib.Localized(_,exn)) ->
- raise
- (HExtlib.Localized (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
- | Stdpp.Exc_located (floc, exn) ->
- raise
- (HExtlib.Localized (floc,CicNotationParser.Parse_error (Printexc.to_string exn)))
-
-let parse_statement lexbuf =
- exc_located_wrapper
- (fun () -> (Grammar.Entry.parse (Obj.magic !grafite_parser.statement) (Obj.magic lexbuf)))
+type db = GrafiteAst.statement Grammar.Entry.e ;;
-let statement () = Obj.magic !grafite_parser.statement
+class type g_status =
+ object
+ inherit CicNotationParser.g_status
+ method parser_db: db
+ end
-let history = ref [] ;;
+class virtual status =
+ object(self)
+ inherit CicNotationParser.status ~keywords:[]
+ val mutable db = None (* mutable only to initialize it :-( *)
+ method parser_db = match db with None -> assert false | Some x -> x
+ method set_parser_db v = {< db = Some v >}
+ method set_parser_status
+ : 'status. #g_status as 'status -> 'self
+ = fun o -> {< db = Some o#parser_db >}#set_notation_parser_status o
+ initializer
+ let grammar = CicNotationParser.level2_ast_grammar self in
+ db <- Some (mk_parser (Grammar.Entry.create grammar "statement") self)
+ end
-let push () =
- LexiconSync.push ();
- history := !grafite_parser :: !history;
- grafite_parser := initial_parser ();
- initialize_parser ()
+let extend status l1 action =
+ let status = CicNotationParser.extend status l1 action in
+ let grammar = CicNotationParser.level2_ast_grammar status in
+ status#set_parser_db
+ (mk_parser (Grammar.Entry.create grammar "statement") status)
;;
-let pop () =
- LexiconSync.pop ();
- match !history with
- | [] -> assert false
- | gp :: tail ->
- grafite_parser := gp;
- history := tail
-;;
-
-(* vim:set foldmethod=marker: *)
+let parse_statement status =
+ parse_statement status#parser_db
+(* vim:set foldmethod=marker: *)
projects / helm.git / blobdiff