X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2Focaml%2Fcic_disambiguation%2FcicTextualParser2.ml;h=8eca106304e96def0c883fa11885889751abcfcd;hb=7a72e5c5129c814e567f03e14d752eff4086fb52;hp=0ac8ab38072ec67a81e5567412ebafc5604d2180;hpb=d4a5f73930368705b8ce07c11ecff94e04465acb;p=helm.git diff --git a/helm/ocaml/cic_disambiguation/cicTextualParser2.ml b/helm/ocaml/cic_disambiguation/cicTextualParser2.ml index 0ac8ab380..8eca10630 100644 --- a/helm/ocaml/cic_disambiguation/cicTextualParser2.ml +++ b/helm/ocaml/cic_disambiguation/cicTextualParser2.ml @@ -31,99 +31,170 @@ let debug_print s = prerr_endline "" end + (** if set to true each number will have a different insance number and can + * thus be interpreted differently than others *) +let use_fresh_num_instances = false + open Printf +open DisambiguateTypes exception Parse_error of string -let grammar = Grammar.gcreate CicTextualLexer2.lex +let fresh_num_instance = + let n = ref 0 in + if use_fresh_num_instances then + (fun () -> incr n; !n) + else + (fun () -> 0) + +let choice_of_uri (uri: string) = + let cic = HelmLibraryObjects.term_of_uri (UriManager.uri_of_string uri) in + (uri, (fun _ _ _ -> cic)) + +let grammar = Grammar.gcreate CicTextualLexer2.cic_lexer let term = Grammar.Entry.create grammar "term" -(* let tactic = Grammar.Entry.create grammar "tactic" *) -(* let tactical = Grammar.Entry.create grammar "tactical" *) +let term0 = Grammar.Entry.create grammar "term0" +let tactic = Grammar.Entry.create grammar "tactic" +let tactical = Grammar.Entry.create grammar "tactical" +let tactical0 = Grammar.Entry.create grammar "tactical0" +let command = Grammar.Entry.create grammar "command" -let return_term loc term = CicTextualParser2Ast.LocatedTerm (loc, term) -(* let return_term loc term = term *) +let return_term loc term = CicAst.AttributedTerm (`Loc loc, term) +let return_tactic loc tactic = TacticAst.LocatedTactic (loc, tactic) +let return_tactical loc tactical = TacticAst.LocatedTactical (loc, tactical) +let return_command loc cmd = cmd let fail (x, y) msg = failwith (Printf.sprintf "Error at characters %d - %d: %s" x y msg) +let name_of_string = function + | "_" -> Cic.Anonymous + | s -> Cic.Name s + EXTEND - GLOBAL: term; + GLOBAL: term term0 tactic tactical tactical0 command; + int: [ + [ num = NUM -> + try + int_of_string num + with Failure _ -> + let (x, y) = loc in + raise (Parse_error (sprintf + "integer literal expected at characters %d-%d" x y)) + ] + ]; meta_subst: [ [ s = SYMBOL "_" -> None | t = term -> Some t ] ]; binder: [ [ SYMBOL <:unicode> (* λ *) -> `Lambda - | SYMBOL <:unicode> (* π *) -> `Pi + | SYMBOL <:unicode> (* Π *) -> `Pi | SYMBOL <:unicode> (* ∃ *) -> `Exists - | SYMBOL <:unicode> (* ∀ *) -> `Forall + | SYMBOL <:unicode> (* ∀ *) -> `Forall ] + ]; + sort: [ + [ "Prop" -> `Prop + | "Set" -> `Set + | "Type" -> `Type + | "CProp" -> `CProp ] + ]; + typed_name: [ + [ PAREN "("; i = IDENT; SYMBOL ":"; typ = term; PAREN ")" -> + (name_of_string i, Some typ) + | i = IDENT -> (name_of_string i, None) ] ]; substituted_name: [ (* a subs.name is an explicit substitution subject *) [ s = [ IDENT | SYMBOL ]; subst = OPT [ SYMBOL "\subst"; (* to avoid catching frequent "a [1]" cases *) - LPAREN "["; + PAREN "["; substs = LIST1 [ i = IDENT; SYMBOL <:unicode> (* ≔ *); t = term -> (i, t) ] SEP SYMBOL ";"; - RPAREN "]" -> + PAREN "]" -> substs ] -> - (match subst with - | Some l -> CicTextualParser2Ast.Ident (s, l) - | None -> CicTextualParser2Ast.Ident (s, [])) + CicAst.Ident (s, subst) ] ]; name: [ (* as substituted_name with no explicit substitution *) [ s = [ IDENT | SYMBOL ] -> s ] ]; pattern: [ - [ n = name -> [n] - | LPAREN "("; names = LIST1 name; RPAREN ")" -> names ] + [ n = name -> (n, []) + | PAREN "("; head = name; vars = LIST1 typed_name; PAREN ")" -> + (head, vars) + ] ]; + term0: [ [ t = term; EOI -> return_term loc t ] ]; term: - [ "arrow" RIGHTA - [ t1 = term; SYMBOL <:unicode>; t2 = term -> - return_term loc - (CicTextualParser2Ast.Binder (`Pi, Cic.Anonymous, Some t1, t2)) - ] - | "eq" LEFTA - [ t1 = term; SYMBOL "="; t2 = term -> - return_term loc (CicTextualParser2Ast.Appl_symbol ("eq", 0, [t1; t2])) + [ "letin" NONA + (* actually "in" and "and" are _not_ keywords. Parsing works anyway + * since applications are required to be bound by parens *) + [ "let"; var = typed_name; + SYMBOL "="; (* SYMBOL <:unicode> (* ≝ *); *) + t1 = term; + IDENT "in"; t2 = term -> + return_term loc (CicAst.LetIn (var, t1, t2)) + | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ]; + defs = LIST1 [ + var = typed_name; + index = OPT [ PAREN "("; index = NUM; PAREN ")" -> + int_of_string index + ]; + SYMBOL "="; (* SYMBOL <:unicode> (* ≝ *); *) + t1 = term -> + (var, t1, (match index with None -> 0 | Some i -> i)) + ] SEP (IDENT "and"); + IDENT "in"; body = term -> + return_term loc (CicAst.LetRec (ind_kind, defs, body)) ] - | "add" LEFTA [ (* nothing here by default *) ] - | "mult" LEFTA [ (* nothing here by default *) ] - | "inv" NONA [ (* nothing here by default *) ] - | "simple" NONA + | "binder" RIGHTA [ - b = binder; vars = LIST1 IDENT SEP SYMBOL ","; - typ = OPT [ SYMBOL ":"; t = term -> t ]; + b = binder; + (vars, typ) = + [ vars = LIST1 IDENT SEP SYMBOL ","; + typ = OPT [ SYMBOL ":"; t = term -> t ] -> (vars, typ) + | PAREN "("; vars = LIST1 IDENT SEP SYMBOL ","; + typ = OPT [ SYMBOL ":"; t = term -> t ]; PAREN ")" -> (vars, typ) + ]; SYMBOL "."; body = term -> let binder = List.fold_right (fun var body -> - let name = - match var with - | "_" -> Cic.Anonymous - | var -> Cic.Name var - in - CicTextualParser2Ast.Binder (b, name, typ, body)) + let name = name_of_string var in + CicAst.Binder (b, (name, typ), body)) vars body in return_term loc binder - | sort_kind = [ - "Prop" -> `Prop | "Set" -> `Set | "Type" -> `Type | "CProp" -> `CProp - ] -> - CicTextualParser2Ast.Sort sort_kind + | t1 = term; SYMBOL <:unicode> (* → *); t2 = term -> + return_term loc + (CicAst.Binder (`Pi, (Cic.Anonymous, Some t1), t2)) + ] + | "logic_add" LEFTA [ (* nothing here by default *) ] + | "logic_mult" LEFTA [ (* nothing here by default *) ] + | "logic_inv" NONA [ (* nothing here by default *) ] + | "relop" LEFTA + [ t1 = term; SYMBOL "="; t2 = term -> + return_term loc (CicAst.Appl [CicAst.Symbol ("eq", 0); t1; t2]) + ] + | "add" LEFTA [ (* nothing here by default *) ] + | "mult" LEFTA [ (* nothing here by default *) ] + | "power" LEFTA [ (* nothing here by default *) ] + | "inv" NONA [ (* nothing here by default *) ] + | "simple" NONA + [ sort = sort -> CicAst.Sort sort | n = substituted_name -> return_term loc n - | LPAREN "("; head = term; args = LIST1 term; RPAREN ")" -> - return_term loc (CicTextualParser2Ast.Appl (head :: args)) - | i = NUM -> return_term loc (CicTextualParser2Ast.Num (i, 0)) + | PAREN "("; head = term; args = LIST1 term; PAREN ")" -> + return_term loc (CicAst.Appl (head :: args)) + | i = NUM -> return_term loc (CicAst.Num (i, (fresh_num_instance ()))) + | IMPLICIT -> return_term loc CicAst.Implicit | m = META; substs = [ - LPAREN "["; substs = LIST0 meta_subst SEP SYMBOL ";" ; RPAREN "]" -> + PAREN "["; substs = LIST0 meta_subst SEP SYMBOL ";" ; PAREN "]" -> substs ] -> let index = @@ -132,43 +203,243 @@ EXTEND with Failure "int_of_string" -> fail loc ("Invalid meta variable number: " ^ m) in - return_term loc (CicTextualParser2Ast.Meta (index, substs)) - (* actually "in" and "and" are _not_ keywords. Parsing works anyway - * since applications are required to be bound by parens *) - | "let"; name = IDENT; SYMBOL <:unicode> (* ≝ *); t1 = term; - IDENT "in"; t2 = term -> - return_term loc (CicTextualParser2Ast.LetIn (name, t1, t2)) - | "let"; ind_kind = [ "corec" -> `CoInductive | "rec"-> `Inductive ]; - defs = LIST1 [ - name = IDENT; - index = OPT [ LPAREN "("; index = INT; RPAREN ")" -> - int_of_string index - ]; - typ = OPT [ SYMBOL ":"; typ = term -> typ ]; - SYMBOL <:unicode> (* ≝ *); t1 = term -> - (name, t1, typ, (match index with None -> 1 | Some i -> i)) - ] SEP (IDENT "and"); - IDENT "in"; body = term -> - return_term loc (CicTextualParser2Ast.LetRec (ind_kind, defs, body)) - | outtyp = OPT [ LPAREN "["; typ = term; RPAREN "]" -> typ ]; + return_term loc (CicAst.Meta (index, substs)) + | outtyp = OPT [ PAREN "["; typ = term; PAREN "]" -> typ ]; "match"; t = term; - SYMBOL ":"; indty = IDENT; + indty_ident = OPT [ SYMBOL ":"; id = IDENT -> id ]; "with"; - LPAREN "["; + PAREN "["; patterns = LIST0 [ - p = pattern; SYMBOL <:unicode> (* ⇒ *); t = term -> (p, t) + lhs = pattern; SYMBOL <:unicode> (* ⇒ *); rhs = term -> + ((lhs: CicAst.case_pattern), rhs) ] SEP SYMBOL "|"; - RPAREN "]" -> - return_term loc (CicTextualParser2Ast.Case (t, indty, outtyp, patterns)) - | LPAREN "("; t = term; RPAREN ")" -> return_term loc t + PAREN "]" -> + return_term loc + (CicAst.Case (t, indty_ident, outtyp, patterns)) + | PAREN "("; t1 = term; SYMBOL ":"; t2 = term; PAREN ")" -> + return_term loc (CicAst.Appl [CicAst.Symbol ("cast", 0); t1; t2]) + | PAREN "("; t = term; PAREN ")" -> return_term loc t ] ]; + tactic_where: [ + [ where = OPT [ IDENT "in"; ident = IDENT -> ident ] -> where ] + ]; + tactic_term: [ [ t = term -> t ] ]; + ident_list0: [ + [ PAREN "["; idents = LIST0 IDENT SEP SYMBOL ";"; PAREN "]" -> idents ] + ]; + ident_list1: [ + [ PAREN "["; idents = LIST1 IDENT SEP SYMBOL ";"; PAREN "]" -> idents ] + ]; + reduction_kind: [ + [ "reduce" -> `Reduce + | "simpl" -> `Simpl + | "whd" -> `Whd ] + ]; + tactic: [ + [ [ IDENT "absurd" | IDENT "Absurd" ] -> return_tactic loc TacticAst.Absurd + | [ IDENT "apply" | IDENT "Apply" ]; + t = tactic_term -> return_tactic loc (TacticAst.Apply t) + | [ IDENT "assumption" | IDENT "Assumption" ] -> + return_tactic loc TacticAst.Assumption + | [ IDENT "change" | IDENT "Change" ]; + t1 = tactic_term; "with"; t2 = tactic_term; + where = tactic_where -> + return_tactic loc (TacticAst.Change (t1, t2, where)) + (* TODO Change_pattern *) + | [ IDENT "contradiction" | IDENT "Contradiction" ] -> + return_tactic loc TacticAst.Contradiction + | [ IDENT "cut" | IDENT "Cut" ]; + t = tactic_term -> return_tactic loc (TacticAst.Cut t) + | [ IDENT "decompose" | IDENT "Decompose" ]; + principles = ident_list1; where = IDENT -> + return_tactic loc (TacticAst.Decompose (where, principles)) + | [ IDENT "discriminate" | IDENT "Discriminate" ]; + hyp = IDENT -> + return_tactic loc (TacticAst.Discriminate hyp) + | [ IDENT "elim" | IDENT "Elim" ]; IDENT "type"; + t = tactic_term -> + return_tactic loc (TacticAst.ElimType t) + | [ IDENT "elim" | IDENT "Elim" ]; + t1 = tactic_term; + using = OPT [ "using"; using = tactic_term -> using ] -> + return_tactic loc (TacticAst.Elim (t1, using)) + | [ IDENT "exact" | IDENT "Exact" ]; t = tactic_term -> + return_tactic loc (TacticAst.Exact t) + | [ IDENT "exists" | IDENT "Exists" ] -> + return_tactic loc TacticAst.Exists + | [ IDENT "fold" | IDENT "Fold" ]; + kind = reduction_kind; t = tactic_term -> + return_tactic loc (TacticAst.Fold (kind, t)) + | [ IDENT "fourier" | IDENT "Fourier" ] -> + return_tactic loc TacticAst.Fourier + | [ IDENT "injection" | IDENT "Injection" ]; ident = IDENT -> + return_tactic loc (TacticAst.Injection ident) + | [ IDENT "intros" | IDENT "Intros" ]; + num = OPT [ num = int -> num ]; + idents = OPT ident_list0 -> + let idents = match idents with None -> [] | Some idents -> idents in + return_tactic loc (TacticAst.Intros (num, idents)) + | [ IDENT "left" | IDENT "Left" ] -> return_tactic loc TacticAst.Left + | [ "let" | "Let" ]; + t = tactic_term; IDENT "in"; where = IDENT -> + return_tactic loc (TacticAst.LetIn (t, where)) + (* TODO Reduce *) + | [ IDENT "reflexivity" | IDENT "Reflexivity" ] -> + return_tactic loc TacticAst.Reflexivity + | [ IDENT "replace" | IDENT "Replace" ]; + t1 = tactic_term; "with"; t2 = tactic_term -> + return_tactic loc (TacticAst.Replace (t1, t2)) + (* TODO Rewrite *) + (* TODO Replace_pattern *) + | [ IDENT "right" | IDENT "Right" ] -> return_tactic loc TacticAst.Right + | [ IDENT "ring" | IDENT "Ring" ] -> return_tactic loc TacticAst.Ring + | [ IDENT "split" | IDENT "Split" ] -> return_tactic loc TacticAst.Split + | [ IDENT "symmetry" | IDENT "Symmetry" ] -> + return_tactic loc TacticAst.Symmetry + | [ IDENT "transitivity" | IDENT "Transitivity" ]; + t = tactic_term -> + return_tactic loc (TacticAst.Transitivity t) + ] + ]; + tactical0: [ [ t = tactical; SYMBOL "." -> t ] ]; + tactical: + [ "sequence" LEFTA + [ tactics = LIST1 NEXT SEP SYMBOL ";" -> + return_tactical loc (TacticAst.Seq tactics) + ] + | "then" NONA + [ tac = tactical; + PAREN "["; tacs = LIST0 tactical SEP SYMBOL ";"; PAREN "]" -> + return_tactical loc (TacticAst.Then (tac, tacs)) + ] + | "loops" RIGHTA + [ [ IDENT "do" | IDENT "Do" ]; count = int; tac = tactical -> + return_tactical loc (TacticAst.Do (count, tac)) + | [ IDENT "repeat" | IDENT "Repeat" ]; tac = tactical -> + return_tactical loc (TacticAst.Repeat tac) + ] + | "simple" NONA + [ [ IDENT "tries" | IDENT "Tries" ]; + PAREN "["; tacs = LIST0 tactical SEP SYMBOL ";"; PAREN "]" -> + return_tactical loc (TacticAst.Tries tacs) + | [ IDENT "try" | IDENT "Try" ]; tac = NEXT -> + return_tactical loc (TacticAst.Try tac) + | [ IDENT "fail" | IDENT "Fail" ] -> return_tactical loc TacticAst.Fail + | [ IDENT "id" | IDENT "Id" ] -> return_tactical loc TacticAst.IdTac + | PAREN "("; tac = tactical; PAREN ")" -> return_tactical loc tac + | tac = tactic -> return_tactical loc (TacticAst.Tactic tac) + | cmd = command -> return_tactical loc (TacticAst.Command cmd) + ] + ]; + theorem_flavour: [ (* all flavours but Goal *) + [ [ IDENT "definition" | IDENT "Definition" ] -> `Definition + | [ IDENT "fact" | IDENT "Fact" ] -> `Fact + | [ IDENT "lemma" | IDENT "Lemma" ] -> `Lemma + | [ IDENT "remark" | IDENT "Remark" ] -> `Remark + | [ IDENT "theorem" | IDENT "Theorem" ] -> `Theorem + ] + ]; + command: [ + [ [ IDENT "proof" | IDENT "Proof" ] -> return_command loc TacticAst.Proof + | [ IDENT "quit" | IDENT "Quit" ] -> return_command loc TacticAst.Quit + | [ IDENT "qed" | IDENT "Qed" ] -> + return_command loc (TacticAst.Qed None) + | [ IDENT "save" | IDENT "Save" ]; name = IDENT -> + return_command loc (TacticAst.Qed (Some name)) + | flavour = theorem_flavour; name = OPT IDENT; SYMBOL ":"; typ = term; + body = OPT [ SYMBOL <:unicode> (* ≝ *); body = term -> body ] -> + return_command loc (TacticAst.Theorem (flavour, name, typ, body)) + | [ IDENT "goal" | IDENT "Goal" ]; typ = term; + body = OPT [ SYMBOL <:unicode> (* ≝ *); body = term -> body ] -> + return_command loc (TacticAst.Theorem (`Goal, None, typ, body)) + ] + ]; END -let parse_term stream = +let exc_located_wrapper f = try - Grammar.Entry.parse term stream + Lazy.force f with Stdpp.Exc_located ((x, y), exn) -> raise (Parse_error (sprintf "parse error at characters %d-%d: %s" x y (Printexc.to_string exn))) +let parse_term stream = + exc_located_wrapper (lazy (Grammar.Entry.parse term0 stream)) +let parse_tactic stream = + exc_located_wrapper (lazy (Grammar.Entry.parse tactic stream)) +let parse_tactical stream = + exc_located_wrapper (lazy (Grammar.Entry.parse tactical0 stream)) + +(**/**) + +(** {2 Interface for gTopLevel} *) + +module EnvironmentP3 = + struct + type t = environment + + let empty = "" + + let aliases_grammar = Grammar.gcreate CicTextualLexer2.cic_lexer + let aliases = Grammar.Entry.create aliases_grammar "aliases" + + let to_string env = + let aliases = + Environment.fold + (fun domain_item (dsc, _) acc -> + let s = + match domain_item with + | Id id -> sprintf "alias id %s = %s" id dsc + | Symbol (symb, instance) -> + sprintf "alias symbol \"%s\" (instance %d) = \"%s\"" + symb instance dsc + | Num instance -> + sprintf "alias num (instance %d) = \"%s\"" instance dsc + in + s :: acc) + env [] + in + String.concat "\n" (List.sort compare aliases) + + EXTEND + GLOBAL: aliases; + aliases: [ (* build an environment from an aliases list *) + [ aliases = LIST0 alias; EOI -> + List.fold_left + (fun env (domain_item, codomain_item) -> + Environment.add domain_item codomain_item env) + Environment.empty aliases + ] + ]; + alias: [ (* return a pair from an alias *) + [ IDENT "alias"; + choice = + [ IDENT "id"; id = IDENT; SYMBOL "="; uri = URI -> + (Id id, choice_of_uri uri) + | IDENT "symbol"; symbol = QSTRING; + PAREN "("; IDENT "instance"; instance = NUM; PAREN ")"; + SYMBOL "="; dsc = QSTRING -> + (Symbol (symbol, int_of_string instance), + DisambiguateChoices.lookup_symbol_by_dsc symbol dsc) + | IDENT "num"; + PAREN "("; IDENT "instance"; instance = NUM; PAREN ")"; + SYMBOL "="; dsc = QSTRING -> + (Num (int_of_string instance), + DisambiguateChoices.lookup_num_by_dsc dsc) + ] -> choice ] + ]; + END + + let of_string s = + if s = empty then + Environment.empty + else + try + Grammar.Entry.parse aliases (Stream.of_string s) + with Stdpp.Exc_located ((x, y), exn) -> + raise (Parse_error (sprintf "parse error at characters %d-%d: %s" x y + (Printexc.to_string exn))) + end + +(* vim:set encoding=utf8: *)