wenzelm@18: (*  Title:      Pure/Syntax/syntax.ML
clasohm@0:     ID:         $Id$
clasohm@0:     Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@18: 
wenzelm@24263: Standard Isabelle syntax, based on arbitrary context-free grammars
wenzelm@24263: (specified by mixfix declarations).
clasohm@0: *)
clasohm@0: 
wenzelm@260: signature BASIC_SYNTAX =
wenzelm@2383: sig
wenzelm@260:   include AST0
wenzelm@556:   include SYN_TRANS0
wenzelm@556:   include MIXFIX0
wenzelm@260:   include PRINTER0
wenzelm@2383: end;
wenzelm@260: 
clasohm@0: signature SYNTAX =
wenzelm@2383: sig
wenzelm@260:   include AST1
clasohm@0:   include LEXICON0
wenzelm@237:   include SYN_EXT0
clasohm@0:   include TYPE_EXT0
wenzelm@556:   include SYN_TRANS1
wenzelm@556:   include MIXFIX1
clasohm@0:   include PRINTER0
wenzelm@1158:   datatype 'a trrule =
wenzelm@3526:     ParseRule of 'a * 'a |
wenzelm@3526:     PrintRule of 'a * 'a |
wenzelm@3526:     ParsePrintRule of 'a * 'a
wenzelm@556:   type syntax
wenzelm@17079:   val eq_syntax: syntax * syntax -> bool
wenzelm@14687:   val is_keyword: syntax -> string -> bool
wenzelm@20784:   type mode
wenzelm@24970:   val mode_default: mode
wenzelm@24970:   val mode_input: mode
wenzelm@25394:   val update_type_gram: (string * int * mixfix) list -> syntax -> syntax
wenzelm@25394:   val update_consts: string list -> syntax -> syntax
wenzelm@25394:   val update_trfuns:
wenzelm@15755:     (string * ((ast list -> ast) * stamp)) list *
wenzelm@15755:     (string * ((term list -> term) * stamp)) list *
wenzelm@15755:     (string * ((bool -> typ -> term list -> term) * stamp)) list *
wenzelm@15755:     (string * ((ast list -> ast) * stamp)) list -> syntax -> syntax
wenzelm@25394:   val update_advanced_trfuns:
wenzelm@21772:     (string * ((Proof.context -> ast list -> ast) * stamp)) list *
wenzelm@21772:     (string * ((Proof.context -> term list -> term) * stamp)) list *
wenzelm@21772:     (string * ((Proof.context -> bool -> typ -> term list -> term) * stamp)) list *
wenzelm@21772:     (string * ((Proof.context -> ast list -> ast) * stamp)) list -> syntax -> syntax
wenzelm@23660:   val extend_tokentrfuns: (string * string * (string -> output * int)) list -> syntax -> syntax
wenzelm@25394:   val update_const_gram: (string -> bool) ->
wenzelm@25387:     mode -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@19262:   val remove_const_gram: (string -> bool) ->
wenzelm@20784:     mode -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@25394:   val update_trrules: Proof.context -> (string -> bool) -> syntax ->
wenzelm@14904:     (string * string) trrule list -> syntax -> syntax
wenzelm@21772:   val remove_trrules: Proof.context -> (string -> bool) -> syntax ->
wenzelm@19262:     (string * string) trrule list -> syntax -> syntax
wenzelm@25394:   val update_trrules_i: ast trrule list -> syntax -> syntax
wenzelm@19262:   val remove_trrules_i: ast trrule list -> syntax -> syntax
wenzelm@4618:   val map_trrule: ('a -> 'b) -> 'a trrule -> 'b trrule
wenzelm@556:   val merge_syntaxes: syntax -> syntax -> syntax
wenzelm@18720:   val basic_syn: syntax
wenzelm@18720:   val basic_nonterms: string list
wenzelm@556:   val print_gram: syntax -> unit
wenzelm@556:   val print_trans: syntax -> unit
wenzelm@556:   val print_syntax: syntax -> unit
wenzelm@21772:   val read: Proof.context -> (string -> bool) -> syntax -> typ -> string -> term list
wenzelm@24372:   val standard_parse_term: Pretty.pp -> (term -> term Exn.result) ->
wenzelm@22703:     (((string * int) * sort) list -> string * int -> Term.sort) ->
wenzelm@22703:     (string -> string option) -> (string -> string option) ->
wenzelm@22703:     (typ -> typ) -> (sort -> sort) -> Proof.context ->
wenzelm@24372:     (string -> bool) -> syntax -> typ -> string -> term
wenzelm@25394:   val standard_parse_typ: Proof.context -> syntax ->
wenzelm@25394:     ((indexname * sort) list -> indexname -> sort) -> (sort -> sort) -> string -> typ
wenzelm@24278:   val standard_parse_sort: Proof.context -> syntax -> (sort -> sort) -> string -> sort
wenzelm@25394:   val standard_unparse_term: (string -> xstring) ->
wenzelm@25394:     Proof.context -> syntax -> bool -> term -> Pretty.T
wenzelm@24923:   val standard_unparse_typ: Proof.context -> syntax -> typ -> Pretty.T
wenzelm@24923:   val standard_unparse_sort: Proof.context -> syntax -> sort -> Pretty.T
clasohm@882:   val ambiguity_level: int ref
skalberg@14177:   val ambiguity_is_error: bool ref
wenzelm@24263:   val parse_sort: Proof.context -> string -> sort
wenzelm@24263:   val parse_typ: Proof.context -> string -> typ
wenzelm@24263:   val parse_term: Proof.context -> string -> term
wenzelm@24263:   val parse_prop: Proof.context -> string -> term
wenzelm@24768:   val unparse_sort: Proof.context -> sort -> Pretty.T
wenzelm@24923:   val unparse_classrel: Proof.context -> class list -> Pretty.T
wenzelm@24923:   val unparse_arity: Proof.context -> arity -> Pretty.T
wenzelm@24768:   val unparse_typ: Proof.context -> typ -> Pretty.T
wenzelm@24768:   val unparse_term: Proof.context -> term -> Pretty.T
wenzelm@24768:   val install_operations:
wenzelm@24768:    {parse_sort: Proof.context -> string -> sort,
wenzelm@24768:     parse_typ: Proof.context -> string -> typ,
wenzelm@24768:     parse_term: Proof.context -> string -> term,
wenzelm@24768:     parse_prop: Proof.context -> string -> term,
wenzelm@24768:     unparse_sort: Proof.context -> sort -> Pretty.T,
wenzelm@24768:     unparse_typ: Proof.context -> typ -> Pretty.T,
wenzelm@24768:     unparse_term: Proof.context -> term -> Pretty.T} -> unit
wenzelm@24768:   val print_checks: Proof.context -> unit
wenzelm@24768:   val add_typ_check: int -> string ->
wenzelm@25060:     (typ list -> Proof.context -> (typ list * Proof.context) option) ->
wenzelm@24768:     Context.generic -> Context.generic
wenzelm@24768:   val add_term_check: int -> string ->
wenzelm@25060:     (term list -> Proof.context -> (term list * Proof.context) option) ->
wenzelm@24768:     Context.generic -> Context.generic
wenzelm@24768:   val add_typ_uncheck: int -> string ->
wenzelm@25060:     (typ list -> Proof.context -> (typ list * Proof.context) option) ->
wenzelm@24768:     Context.generic -> Context.generic
wenzelm@24768:   val add_term_uncheck: int -> string ->
wenzelm@25060:     (term list -> Proof.context -> (term list * Proof.context) option) ->
wenzelm@24768:     Context.generic -> Context.generic
wenzelm@24488:   val check_sort: Proof.context -> sort -> sort
wenzelm@24512:   val check_typ: Proof.context -> typ -> typ
wenzelm@24512:   val check_term: Proof.context -> term -> term
wenzelm@24512:   val check_prop: Proof.context -> term -> term
wenzelm@24488:   val check_typs: Proof.context -> typ list -> typ list
wenzelm@24263:   val check_terms: Proof.context -> term list -> term list
wenzelm@24263:   val check_props: Proof.context -> term list -> term list
wenzelm@24923:   val uncheck_sort: Proof.context -> sort -> sort
wenzelm@24923:   val uncheck_arity: Proof.context -> arity -> arity
wenzelm@24923:   val uncheck_classrel: Proof.context -> class list -> class list
wenzelm@24768:   val uncheck_typs: Proof.context -> typ list -> typ list
wenzelm@24768:   val uncheck_terms: Proof.context -> term list -> term list
wenzelm@24263:   val read_sort: Proof.context -> string -> sort
wenzelm@24263:   val read_typ: Proof.context -> string -> typ
wenzelm@24488:   val read_term: Proof.context -> string -> term
wenzelm@24488:   val read_prop: Proof.context -> string -> term
wenzelm@24263:   val read_terms: Proof.context -> string list -> term list
wenzelm@24263:   val read_props: Proof.context -> string list -> term list
wenzelm@24709:   val read_sort_global: theory -> string -> sort
wenzelm@24709:   val read_typ_global: theory -> string -> typ
wenzelm@24709:   val read_term_global: theory -> string -> term
wenzelm@24709:   val read_prop_global: theory -> string -> term
wenzelm@24923:   val pretty_term: Proof.context -> term -> Pretty.T
wenzelm@24923:   val pretty_typ: Proof.context -> typ -> Pretty.T
wenzelm@24923:   val pretty_sort: Proof.context -> sort -> Pretty.T
wenzelm@24923:   val pretty_classrel: Proof.context -> class list -> Pretty.T
wenzelm@24923:   val pretty_arity: Proof.context -> arity -> Pretty.T
wenzelm@24923:   val string_of_term: Proof.context -> term -> string
wenzelm@24923:   val string_of_typ: Proof.context -> typ -> string
wenzelm@24923:   val string_of_sort: Proof.context -> sort -> string
wenzelm@24923:   val string_of_classrel: Proof.context -> class list -> string
wenzelm@24923:   val string_of_arity: Proof.context -> arity -> string
wenzelm@24970:   val pp: Proof.context -> Pretty.pp
wenzelm@2383: end;
clasohm@0: 
wenzelm@12094: structure Syntax: SYNTAX =
clasohm@0: struct
clasohm@0: 
wenzelm@237: (** tables of translation functions **)
wenzelm@237: 
wenzelm@5692: (* parse (ast) translations *)
wenzelm@5692: 
wenzelm@17412: fun lookup_tr tab c = Option.map fst (Symtab.lookup tab c);
wenzelm@237: 
wenzelm@23655: fun err_dup_trfun name c =
wenzelm@23655:   error ("More than one " ^ name ^ " for " ^ quote c);
wenzelm@237: 
wenzelm@21536: fun remove_trtab trfuns = fold (Symtab.remove SynExt.eq_trfun) trfuns;
wenzelm@21536: 
wenzelm@25394: fun update_trtab name trfuns tab = Symtab.extend (remove_trtab trfuns tab, trfuns)
wenzelm@23655:   handle Symtab.DUP c => err_dup_trfun name c;
wenzelm@237: 
wenzelm@15755: fun merge_trtabs name tab1 tab2 = Symtab.merge SynExt.eq_trfun (tab1, tab2)
wenzelm@23655:   handle Symtab.DUP c => err_dup_trfun name c;
wenzelm@237: 
wenzelm@237: 
wenzelm@5692: (* print (ast) translations *)
wenzelm@5692: 
wenzelm@18931: fun lookup_tr' tab c = map fst (Symtab.lookup_list tab c);
wenzelm@25394: fun update_tr'tab trfuns = fold_rev (Symtab.update_list SynExt.eq_trfun) trfuns;
wenzelm@18931: fun remove_tr'tab trfuns = fold (Symtab.remove_list SynExt.eq_trfun) trfuns;
wenzelm@18931: fun merge_tr'tabs tab1 tab2 = Symtab.merge_list SynExt.eq_trfun (tab1, tab2);
wenzelm@5692: 
wenzelm@5692: 
wenzelm@237: 
wenzelm@2700: (** tables of token translation functions **)
wenzelm@2700: 
wenzelm@2700: fun lookup_tokentr tabs modes =
wenzelm@19482:   let val trs = distinct (eq_fst (op =)) (maps (these o AList.lookup (op =) tabs) (modes @ [""]))
haftmann@17314:   in fn c => Option.map fst (AList.lookup (op =) trs c) end;
wenzelm@2700: 
wenzelm@2700: fun merge_tokentrtabs tabs1 tabs2 =
wenzelm@2700:   let
wenzelm@2700:     fun eq_tr ((c1, (_, s1)), (c2, (_, s2))) = c1 = c2 andalso s1 = s2;
wenzelm@2700: 
wenzelm@4703:     fun name (s, _) = implode (tl (Symbol.explode s));
wenzelm@2706: 
wenzelm@2700:     fun merge mode =
wenzelm@2700:       let
wenzelm@17213:         val trs1 = these (AList.lookup (op =) tabs1 mode);
wenzelm@17213:         val trs2 = these (AList.lookup (op =) tabs2 mode);
wenzelm@19046:         val trs = distinct eq_tr (trs1 @ trs2);
wenzelm@2700:       in
wenzelm@18964:         (case duplicates (eq_fst (op =)) trs of
wenzelm@2700:           [] => (mode, trs)
wenzelm@2700:         | dups => error ("More than one token translation function in mode " ^
wenzelm@2706:             quote mode ^ " for " ^ commas_quote (map name dups)))
wenzelm@2700:       end;
wenzelm@19046:   in map merge (distinct (op =) (map fst (tabs1 @ tabs2))) end;
wenzelm@2700: 
wenzelm@15755: fun extend_tokentrtab tokentrs tabs =
wenzelm@2700:   let
wenzelm@17213:     fun ins_tokentr (m, c, f) =
wenzelm@17213:       AList.default (op =) (m, [])
wenzelm@17213:       #> AList.map_entry (op =) m (cons ("_" ^ c, (f, stamp ())));
wenzelm@15759:   in merge_tokentrtabs tabs (fold ins_tokentr tokentrs []) end;
wenzelm@2700: 
wenzelm@2700: 
wenzelm@2700: 
wenzelm@237: (** tables of translation rules **)
wenzelm@237: 
wenzelm@5692: type ruletab = (Ast.ast * Ast.ast) list Symtab.table;
wenzelm@237: 
wenzelm@19482: fun dest_ruletab tab = maps snd (Symtab.dest tab);
wenzelm@237: 
wenzelm@237: 
wenzelm@25394: (* empty, update, merge ruletabs *)
wenzelm@237: 
wenzelm@25394: val update_ruletab = fold_rev (fn r => Symtab.update_list (op =) (Ast.head_of_rule r, r));
wenzelm@18931: val remove_ruletab = fold (fn r => Symtab.remove_list (op =) (Ast.head_of_rule r, r));
wenzelm@18931: fun merge_ruletabs tab1 tab2 = Symtab.merge_list (op =) (tab1, tab2);
clasohm@0: 
clasohm@0: 
clasohm@0: 
clasohm@0: (** datatype syntax **)
clasohm@0: 
wenzelm@237: datatype syntax =
wenzelm@237:   Syntax of {
wenzelm@15755:     input: SynExt.xprod list,
wenzelm@4703:     lexicon: Scan.lexicon,
wenzelm@5692:     gram: Parser.gram,
wenzelm@18:     consts: string list,
wenzelm@2913:     prmodes: string list,
wenzelm@21772:     parse_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) Symtab.table,
wenzelm@237:     parse_ruletab: ruletab,
wenzelm@21772:     parse_trtab: ((Proof.context -> term list -> term) * stamp) Symtab.table,
wenzelm@21772:     print_trtab: ((Proof.context -> bool -> typ -> term list -> term) * stamp) list Symtab.table,
wenzelm@237:     print_ruletab: ruletab,
wenzelm@21772:     print_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) list Symtab.table,
wenzelm@23660:     tokentrtab: (string * (string * ((string -> output * int) * stamp)) list) list,
wenzelm@17079:     prtabs: Printer.prtabs} * stamp;
clasohm@0: 
wenzelm@17079: fun eq_syntax (Syntax (_, s1), Syntax (_, s2)) = s1 = s2;
wenzelm@17079: 
wenzelm@17079: fun is_keyword (Syntax ({lexicon, ...}, _)) = Scan.is_literal lexicon o Symbol.explode;
wenzelm@14687: 
wenzelm@20784: type mode = string * bool;
wenzelm@24970: val mode_default = ("", true);
wenzelm@25122: val mode_input = (PrintMode.input, true);
wenzelm@15755: 
wenzelm@18: 
wenzelm@237: (* empty_syntax *)
wenzelm@18: 
wenzelm@17079: val empty_syntax = Syntax
wenzelm@17079:   ({input = [],
wenzelm@4703:     lexicon = Scan.empty_lexicon,
wenzelm@5692:     gram = Parser.empty_gram,
wenzelm@167:     consts = [],
wenzelm@2913:     prmodes = [],
wenzelm@5692:     parse_ast_trtab = Symtab.empty,
wenzelm@5692:     parse_ruletab = Symtab.empty,
wenzelm@5692:     parse_trtab = Symtab.empty,
wenzelm@5692:     print_trtab = Symtab.empty,
wenzelm@5692:     print_ruletab = Symtab.empty,
wenzelm@5692:     print_ast_trtab = Symtab.empty,
wenzelm@2700:     tokentrtab = [],
wenzelm@17079:     prtabs = Printer.empty_prtabs}, stamp ());
wenzelm@167: 
wenzelm@167: 
wenzelm@25394: (* update_syntax *)
wenzelm@167: 
wenzelm@25394: fun update_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
wenzelm@167:   let
wenzelm@15755:     val {input, lexicon, gram, consts = consts1, prmodes = prmodes1,
wenzelm@2366:       parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@2700:       print_ast_trtab, tokentrtab, prtabs} = tabs;
wenzelm@14904:     val SynExt.SynExt {xprods, consts = consts2, prmodes = prmodes2,
wenzelm@2913:       parse_ast_translation, parse_rules, parse_translation, print_translation, print_rules,
wenzelm@2700:       print_ast_translation, token_translation} = syn_ext;
wenzelm@25394:     val input' = if inout then fold (insert (op =)) xprods input else input;
wenzelm@25394:     val changed = length input <> length input';
wenzelm@19546:     fun if_inout xs = if inout then xs else [];
wenzelm@167:   in
wenzelm@17079:     Syntax
wenzelm@25394:     ({input = input',
wenzelm@25394:       lexicon = if changed then Scan.extend_lexicon (SynExt.delims_of xprods) lexicon else lexicon,
wenzelm@25394:       gram = if changed then Parser.extend_gram gram xprods else gram,
wenzelm@19546:       consts = Library.merge (op =) (consts1, filter_out NameSpace.is_qualified consts2),
wenzelm@18921:       prmodes = insert (op =) mode (Library.merge (op =) (prmodes1, prmodes2)),
wenzelm@167:       parse_ast_trtab =
wenzelm@25394:         update_trtab "parse ast translation" (if_inout parse_ast_translation) parse_ast_trtab,
wenzelm@25394:       parse_ruletab = update_ruletab (if_inout parse_rules) parse_ruletab,
wenzelm@25394:       parse_trtab = update_trtab "parse translation" (if_inout parse_translation) parse_trtab,
wenzelm@25394:       print_trtab = update_tr'tab print_translation print_trtab,
wenzelm@25394:       print_ruletab = update_ruletab print_rules print_ruletab,
wenzelm@25394:       print_ast_trtab = update_tr'tab print_ast_translation print_ast_trtab,
wenzelm@15755:       tokentrtab = extend_tokentrtab token_translation tokentrtab,
wenzelm@25394:       prtabs = Printer.update_prtabs mode xprods prtabs}, stamp ())
wenzelm@18:   end;
wenzelm@18: 
wenzelm@15755: 
wenzelm@15755: (* remove_syntax *)
wenzelm@15755: 
wenzelm@17079: fun remove_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
wenzelm@15755:   let
wenzelm@15755:     val SynExt.SynExt {xprods, consts = _, prmodes = _,
wenzelm@15755:       parse_ast_translation, parse_rules, parse_translation, print_translation, print_rules,
wenzelm@15755:       print_ast_translation, token_translation = _} = syn_ext;
wenzelm@15755:     val {input, lexicon, gram, consts, prmodes,
wenzelm@15755:       parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@15755:       print_ast_trtab, tokentrtab, prtabs} = tabs;
wenzelm@19300:     val input' = if inout then subtract (op =) xprods input else input;
wenzelm@25394:     val changed = length input <> length input';
wenzelm@19546:     fun if_inout xs = if inout then xs else [];
wenzelm@15755:   in
wenzelm@17079:     Syntax
wenzelm@17079:     ({input = input',
wenzelm@25387:       lexicon = if changed then Scan.make_lexicon (SynExt.delims_of input') else lexicon,
wenzelm@25387:       gram = if changed then Parser.make_gram input' else gram,
wenzelm@15755:       consts = consts,
wenzelm@15755:       prmodes = prmodes,
wenzelm@19546:       parse_ast_trtab = remove_trtab (if_inout parse_ast_translation) parse_ast_trtab,
wenzelm@19546:       parse_ruletab = remove_ruletab (if_inout parse_rules) parse_ruletab,
wenzelm@19546:       parse_trtab = remove_trtab (if_inout parse_translation) parse_trtab,
wenzelm@15755:       print_trtab = remove_tr'tab print_translation print_trtab,
wenzelm@15755:       print_ruletab = remove_ruletab print_rules print_ruletab,
wenzelm@15755:       print_ast_trtab = remove_tr'tab print_ast_translation print_ast_trtab,
wenzelm@15755:       tokentrtab = tokentrtab,
wenzelm@17079:       prtabs = Printer.remove_prtabs mode xprods prtabs}, stamp ())
wenzelm@15755:   end;
wenzelm@14904: 
wenzelm@18: 
wenzelm@237: (* merge_syntaxes *)
clasohm@0: 
wenzelm@17079: fun merge_syntaxes (Syntax (tabs1, _)) (Syntax (tabs2, _)) =
clasohm@0:   let
wenzelm@15755:     val {input = input1, lexicon = lexicon1, gram = gram1, consts = consts1,
wenzelm@15755:       prmodes = prmodes1, parse_ast_trtab = parse_ast_trtab1,
wenzelm@15755:       parse_ruletab = parse_ruletab1, parse_trtab = parse_trtab1,
wenzelm@15755:       print_trtab = print_trtab1, print_ruletab = print_ruletab1,
wenzelm@15755:       print_ast_trtab = print_ast_trtab1, tokentrtab = tokentrtab1, prtabs = prtabs1} = tabs1;
wenzelm@237: 
wenzelm@15755:     val {input = input2, lexicon = lexicon2, gram = gram2, consts = consts2,
wenzelm@15755:       prmodes = prmodes2, parse_ast_trtab = parse_ast_trtab2,
wenzelm@15755:       parse_ruletab = parse_ruletab2, parse_trtab = parse_trtab2,
wenzelm@15755:       print_trtab = print_trtab2, print_ruletab = print_ruletab2,
wenzelm@15755:       print_ast_trtab = print_ast_trtab2, tokentrtab = tokentrtab2, prtabs = prtabs2} = tabs2;
clasohm@0:   in
wenzelm@17079:     Syntax
wenzelm@18921:     ({input = Library.merge (op =) (input1, input2),
wenzelm@4703:       lexicon = Scan.merge_lexicons lexicon1 lexicon2,
wenzelm@5692:       gram = Parser.merge_grams gram1 gram2,
wenzelm@18428:       consts = sort_distinct string_ord (consts1 @ consts2),
wenzelm@18921:       prmodes = Library.merge (op =) (prmodes1, prmodes2),
wenzelm@237:       parse_ast_trtab =
wenzelm@15755:         merge_trtabs "parse ast translation" parse_ast_trtab1 parse_ast_trtab2,
wenzelm@237:       parse_ruletab = merge_ruletabs parse_ruletab1 parse_ruletab2,
wenzelm@15755:       parse_trtab = merge_trtabs "parse translation" parse_trtab1 parse_trtab2,
wenzelm@5692:       print_trtab = merge_tr'tabs print_trtab1 print_trtab2,
wenzelm@237:       print_ruletab = merge_ruletabs print_ruletab1 print_ruletab2,
wenzelm@5692:       print_ast_trtab = merge_tr'tabs print_ast_trtab1 print_ast_trtab2,
wenzelm@2700:       tokentrtab = merge_tokentrtabs tokentrtab1 tokentrtab2,
wenzelm@17079:       prtabs = Printer.merge_prtabs prtabs1 prtabs2}, stamp ())
clasohm@0:   end;
clasohm@0: 
clasohm@0: 
wenzelm@18720: (* basic syntax *)
wenzelm@260: 
wenzelm@18720: val basic_syn =
wenzelm@17168:   empty_syntax
wenzelm@25394:   |> update_syntax mode_default TypeExt.type_ext
wenzelm@25394:   |> update_syntax mode_default SynExt.pure_ext;
wenzelm@260: 
wenzelm@18720: val basic_nonterms =
wenzelm@18720:   (Lexicon.terminals @ [SynExt.logic, "type", "types", "sort", "classes",
wenzelm@18720:     SynExt.args, SynExt.cargs, "pttrn", "pttrns", "idt", "idts", "aprop",
wenzelm@22573:     "asms", SynExt.any_, SynExt.sprop, "num_const", "index", "struct"]);
wenzelm@18720: 
clasohm@0: 
wenzelm@4887: 
wenzelm@15759: (** print syntax **)
wenzelm@15759: 
wenzelm@15759: local
clasohm@0: 
wenzelm@260: fun pretty_strs_qs name strs =
berghofe@14598:   Pretty.strs (name :: map Library.quote (sort_strings strs));
clasohm@0: 
wenzelm@17079: fun pretty_gram (Syntax (tabs, _)) =
clasohm@0:   let
wenzelm@14904:     val {lexicon, prmodes, gram, prtabs, ...} = tabs;
wenzelm@2913:     val prmodes' = sort_strings (filter_out (equal "") prmodes);
clasohm@0:   in
wenzelm@8720:     [pretty_strs_qs "lexicon:" (Scan.dest_lexicon lexicon),
wenzelm@8720:       Pretty.big_list "prods:" (Parser.pretty_gram gram),
wenzelm@8720:       pretty_strs_qs "print modes:" prmodes']
clasohm@0:   end;
clasohm@0: 
wenzelm@17079: fun pretty_trans (Syntax (tabs, _)) =
clasohm@0:   let
wenzelm@260:     fun pretty_trtab name tab =
wenzelm@5692:       pretty_strs_qs name (Symtab.keys tab);
clasohm@0: 
wenzelm@260:     fun pretty_ruletab name tab =
wenzelm@5692:       Pretty.big_list name (map Ast.pretty_rule (dest_ruletab tab));
clasohm@0: 
berghofe@14598:     fun pretty_tokentr (mode, trs) = Pretty.strs (Library.quote mode ^ ":" :: map fst trs);
wenzelm@4703: 
wenzelm@237:     val {consts, parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab,
wenzelm@4703:       print_ruletab, print_ast_trtab, tokentrtab, ...} = tabs;
clasohm@0:   in
wenzelm@8720:     [pretty_strs_qs "consts:" consts,
wenzelm@8720:       pretty_trtab "parse_ast_translation:" parse_ast_trtab,
wenzelm@8720:       pretty_ruletab "parse_rules:" parse_ruletab,
wenzelm@8720:       pretty_trtab "parse_translation:" parse_trtab,
wenzelm@8720:       pretty_trtab "print_translation:" print_trtab,
wenzelm@8720:       pretty_ruletab "print_rules:" print_ruletab,
wenzelm@8720:       pretty_trtab "print_ast_translation:" print_ast_trtab,
wenzelm@8720:       Pretty.big_list "token_translation:" (map pretty_tokentr tokentrtab)]
clasohm@0:   end;
clasohm@0: 
wenzelm@15759: in
clasohm@0: 
wenzelm@15759: fun print_gram syn = Pretty.writeln (Pretty.chunks (pretty_gram syn));
wenzelm@15759: fun print_trans syn = Pretty.writeln (Pretty.chunks (pretty_trans syn));
wenzelm@15759: fun print_syntax syn = Pretty.writeln (Pretty.chunks (pretty_gram syn @ pretty_trans syn));
clasohm@0: 
wenzelm@15759: end;
clasohm@0: 
clasohm@0: 
clasohm@0: 
wenzelm@237: (** read **)
wenzelm@18: 
wenzelm@260: (* read_ast *)
wenzelm@260: 
clasohm@882: val ambiguity_level = ref 1;
wenzelm@24263: val ambiguity_is_error = ref false;
clasohm@882: 
wenzelm@21772: fun read_asts ctxt is_logtype (Syntax (tabs, _)) xids root str =
wenzelm@260:   let
wenzelm@14904:     val {lexicon, gram, parse_ast_trtab, ...} = tabs;
wenzelm@14904:     val root' = if root <> "prop" andalso is_logtype root then SynExt.logic else root;
wenzelm@4703:     val chars = Symbol.explode str;
wenzelm@5692:     val pts = Parser.parse gram root' (Lexicon.tokenize lexicon xids chars);
clasohm@330: 
wenzelm@12292:     fun show_pt pt =
wenzelm@21772:       Pretty.string_of (Ast.pretty_ast (hd (SynTrans.pts_to_asts ctxt (K NONE) [pt])));
wenzelm@260:   in
wenzelm@21962:     if length pts > ! ambiguity_level then
wenzelm@16613:       if ! ambiguity_is_error then error ("Ambiguous input " ^ quote str)
wenzelm@16661:       else (warning ("Ambiguous input " ^ quote str ^ "\n" ^
wenzelm@16716:           "produces " ^ string_of_int (length pts) ^ " parse trees.");
wenzelm@21962:          List.app (warning o show_pt) pts)
wenzelm@21962:     else ();
wenzelm@21772:     SynTrans.pts_to_asts ctxt (lookup_tr parse_ast_trtab) pts
wenzelm@260:   end;
wenzelm@260: 
wenzelm@260: 
wenzelm@237: (* read *)
clasohm@0: 
wenzelm@21772: fun read ctxt is_logtype (syn as Syntax (tabs, _)) ty str =
clasohm@0:   let
wenzelm@237:     val {parse_ruletab, parse_trtab, ...} = tabs;
wenzelm@21772:     val asts = read_asts ctxt is_logtype syn false (SynExt.typ_to_nonterm ty) str;
clasohm@0:   in
wenzelm@21772:     SynTrans.asts_to_terms ctxt (lookup_tr parse_trtab)
wenzelm@18931:       (map (Ast.normalize_ast (Symtab.lookup_list parse_ruletab)) asts)
clasohm@0:   end;
clasohm@0: 
clasohm@0: 
wenzelm@22703: (* read terms *)
wenzelm@22703: 
wenzelm@24372: (*brute-force disambiguation via type-inference*)
wenzelm@24372: fun disambig _ _ [t] = t
wenzelm@24372:   | disambig pp check ts =
wenzelm@24372:       let
wenzelm@24372:         val err_results = map check ts;
wenzelm@24372:         val errs = map_filter (fn Exn.Exn (ERROR msg) => SOME msg | _ => NONE) err_results;
wenzelm@24372:         val results = map_filter Exn.get_result err_results;
wenzelm@24372: 
wenzelm@24372:         val ambiguity = length ts;
wenzelm@24372:         fun ambig_msg () =
wenzelm@24372:           if ambiguity > 1 andalso ambiguity <= ! ambiguity_level then
wenzelm@24372:             "Got more than one parse tree.\n\
wenzelm@24372:             \Retry with smaller ambiguity_level for more information."
wenzelm@24372:           else "";
wenzelm@24372:       in
wenzelm@24372:         if null results then cat_error (ambig_msg ()) (cat_lines errs)
wenzelm@24372:         else if length results = 1 then
wenzelm@24372:           (if ambiguity > ! ambiguity_level then
wenzelm@24372:             warning "Fortunately, only one parse tree is type correct.\n\
wenzelm@24372:               \You may still want to disambiguate your grammar or your input."
wenzelm@24372:           else (); hd results)
wenzelm@24372:         else cat_error (ambig_msg ()) ("More than one term is type correct:\n" ^
wenzelm@24372:           cat_lines (map (Pretty.string_of_term pp) ts))
wenzelm@24372:       end;
wenzelm@24372: 
wenzelm@24372: fun standard_parse_term pp check get_sort map_const map_free map_type map_sort
wenzelm@24372:     ctxt is_logtype syn ty str =
wenzelm@24372:   read ctxt is_logtype syn ty str
wenzelm@24372:   |> map (TypeExt.decode_term get_sort map_const map_free map_type map_sort)
wenzelm@24372:   |> disambig (Printer.pp_show_brackets pp) check;
wenzelm@22703: 
wenzelm@22703: 
wenzelm@237: (* read types *)
clasohm@0: 
wenzelm@24278: fun standard_parse_typ ctxt syn get_sort map_sort str =
wenzelm@21772:   (case read ctxt (K false) syn SynExt.typeT str of
wenzelm@22703:     [t] => TypeExt.typ_of_term (get_sort (TypeExt.term_sorts map_sort t)) map_sort t
wenzelm@8894:   | _ => error "read_typ: ambiguous syntax");
wenzelm@144: 
wenzelm@144: 
wenzelm@8894: (* read sorts *)
wenzelm@8894: 
wenzelm@24278: fun standard_parse_sort ctxt syn map_sort str =
wenzelm@21772:   (case read ctxt (K false) syn TypeExt.sortT str of
wenzelm@22703:     [t] => TypeExt.sort_of_term map_sort t
wenzelm@8894:   | _ => error "read_sort: ambiguous syntax");
wenzelm@8894: 
wenzelm@8894: 
wenzelm@18: 
wenzelm@1158: (** prepare translation rules **)
wenzelm@1158: 
wenzelm@1158: datatype 'a trrule =
wenzelm@3526:   ParseRule of 'a * 'a |
wenzelm@3526:   PrintRule of 'a * 'a |
wenzelm@3526:   ParsePrintRule of 'a * 'a;
wenzelm@888: 
wenzelm@4618: fun map_trrule f (ParseRule (x, y)) = ParseRule (f x, f y)
wenzelm@4618:   | map_trrule f (PrintRule (x, y)) = PrintRule (f x, f y)
wenzelm@4618:   | map_trrule f (ParsePrintRule (x, y)) = ParsePrintRule (f x, f y);
wenzelm@1158: 
skalberg@15531: fun parse_rule (ParseRule pats) = SOME pats
skalberg@15531:   | parse_rule (PrintRule _) = NONE
skalberg@15531:   | parse_rule (ParsePrintRule pats) = SOME pats;
wenzelm@1158: 
skalberg@15531: fun print_rule (ParseRule _) = NONE
skalberg@15531:   | print_rule (PrintRule pats) = SOME (swap pats)
skalberg@15531:   | print_rule (ParsePrintRule pats) = SOME (swap pats);
wenzelm@1158: 
wenzelm@1158: 
wenzelm@19262: local
wenzelm@19262: 
wenzelm@1158: fun check_rule (rule as (lhs, rhs)) =
wenzelm@5692:   (case Ast.rule_error rule of
skalberg@15531:     SOME msg =>
wenzelm@1158:       error ("Error in syntax translation rule: " ^ msg ^ "\n" ^
wenzelm@5692:         Ast.str_of_ast lhs ^ "  ->  " ^ Ast.str_of_ast rhs)
skalberg@15531:   | NONE => rule);
wenzelm@888: 
wenzelm@21772: fun read_pattern ctxt is_logtype syn (root, str) =
wenzelm@18:   let
wenzelm@17079:     val Syntax ({consts, ...}, _) = syn;
wenzelm@18: 
wenzelm@5692:     fun constify (ast as Ast.Constant _) = ast
wenzelm@5692:       | constify (ast as Ast.Variable x) =
wenzelm@20664:           if member (op =) consts x orelse NameSpace.is_qualified x then Ast.Constant x
wenzelm@3830:           else ast
wenzelm@5692:       | constify (Ast.Appl asts) = Ast.Appl (map constify asts);
wenzelm@18:   in
wenzelm@21772:     (case read_asts ctxt is_logtype syn true root str of
wenzelm@888:       [ast] => constify ast
wenzelm@888:     | _ => error ("Syntactically ambiguous input: " ^ quote str))
wenzelm@18678:   end handle ERROR msg =>
wenzelm@18678:     cat_error msg ("The error(s) above occurred in translation pattern " ^
wenzelm@888:       quote str);
clasohm@0: 
wenzelm@1158: fun prep_rules rd_pat raw_rules =
wenzelm@4618:   let val rules = map (map_trrule rd_pat) raw_rules in
wenzelm@19482:     (map check_rule (map_filter parse_rule rules),
wenzelm@19482:       map check_rule (map_filter print_rule rules))
wenzelm@1158:   end
wenzelm@18: 
wenzelm@19262: in
wenzelm@19262: 
wenzelm@19262: val cert_rules = prep_rules I;
wenzelm@19262: 
wenzelm@21772: fun read_rules ctxt is_logtype syn =
wenzelm@21772:   prep_rules (read_pattern ctxt is_logtype syn);
wenzelm@19262: 
wenzelm@19262: end;
wenzelm@19262: 
wenzelm@18: 
wenzelm@18: 
wenzelm@24923: (** unparse terms, typs, sorts **)
wenzelm@18: 
wenzelm@24923: local
wenzelm@24923: 
wenzelm@24923: fun unparse_t t_to_ast prt_t markup ctxt (syn as Syntax (tabs, _)) curried t =
clasohm@0:   let
wenzelm@2700:     val {print_trtab, print_ruletab, print_ast_trtab, tokentrtab, prtabs, ...} = tabs;
wenzelm@21772:     val ast = t_to_ast ctxt (lookup_tr' print_trtab) t;
clasohm@0:   in
wenzelm@23631:     Pretty.markup markup (prt_t ctxt curried prtabs (lookup_tr' print_ast_trtab)
wenzelm@24613:       (lookup_tokentr tokentrtab (print_mode_value ()))
wenzelm@23631:       (Ast.normalize_ast (Symtab.lookup_list print_ruletab) ast))
clasohm@0:   end;
clasohm@0: 
wenzelm@24923: in
wenzelm@24923: 
wenzelm@24923: fun standard_unparse_term extern =
wenzelm@24923:   unparse_t Printer.term_to_ast (Printer.pretty_term_ast extern) Markup.term;
wenzelm@24923: 
wenzelm@24923: fun standard_unparse_typ ctxt syn =
wenzelm@24923:   unparse_t Printer.typ_to_ast Printer.pretty_typ_ast Markup.typ ctxt syn false;
wenzelm@24923: 
wenzelm@24923: fun standard_unparse_sort ctxt syn =
wenzelm@24923:   unparse_t Printer.sort_to_ast Printer.pretty_typ_ast Markup.sort ctxt syn false;
wenzelm@24923: 
wenzelm@24923: end;
clasohm@0: 
clasohm@0: 
clasohm@0: 
wenzelm@19262: (** modify syntax **)
wenzelm@383: 
wenzelm@25394: fun ext_syntax f decls = update_syntax mode_default (f decls);
wenzelm@383: 
wenzelm@25394: val update_type_gram       = ext_syntax Mixfix.syn_ext_types;
wenzelm@25394: val update_consts          = ext_syntax SynExt.syn_ext_const_names;
wenzelm@25394: val update_trfuns          = ext_syntax SynExt.syn_ext_trfuns;
wenzelm@25394: val update_advanced_trfuns = ext_syntax SynExt.syn_ext_advanced_trfuns;
wenzelm@16613: val extend_tokentrfuns     = ext_syntax SynExt.syn_ext_tokentrfuns;
wenzelm@5692: 
wenzelm@25394: fun update_const_gram is_logtype prmode decls =
wenzelm@25394:   update_syntax prmode (Mixfix.syn_ext_consts is_logtype decls);
wenzelm@25387: 
wenzelm@15755: fun remove_const_gram is_logtype prmode decls =
wenzelm@15755:   remove_syntax prmode (Mixfix.syn_ext_consts is_logtype decls);
wenzelm@15755: 
wenzelm@25394: fun update_trrules ctxt is_logtype syn =
wenzelm@21772:   ext_syntax SynExt.syn_ext_rules o read_rules ctxt is_logtype syn;
wenzelm@19262: 
wenzelm@21772: fun remove_trrules ctxt is_logtype syn =
wenzelm@24970:   remove_syntax mode_default o SynExt.syn_ext_rules o read_rules ctxt is_logtype syn;
wenzelm@19262: 
wenzelm@25394: val update_trrules_i = ext_syntax SynExt.syn_ext_rules o cert_rules;
wenzelm@24970: val remove_trrules_i = remove_syntax mode_default o SynExt.syn_ext_rules o cert_rules;
wenzelm@5692: 
wenzelm@5692: 
wenzelm@24263: 
wenzelm@24768: (** inner syntax operations **)
wenzelm@24263: 
wenzelm@24768: (* (un)parsing *)
wenzelm@24263: 
wenzelm@24263: local
wenzelm@24768:   type operations =
wenzelm@24768:    {parse_sort: Proof.context -> string -> sort,
wenzelm@24768:     parse_typ: Proof.context -> string -> typ,
wenzelm@24768:     parse_term: Proof.context -> string -> term,
wenzelm@24768:     parse_prop: Proof.context -> string -> term,
wenzelm@24768:     unparse_sort: Proof.context -> sort -> Pretty.T,
wenzelm@24768:     unparse_typ: Proof.context -> typ -> Pretty.T,
wenzelm@24768:     unparse_term: Proof.context -> term -> Pretty.T};
wenzelm@24768: 
wenzelm@24768:   val operations = ref (NONE: operations option);
wenzelm@24768: 
wenzelm@24768:   fun operation which ctxt x =
wenzelm@24768:     (case ! operations of
wenzelm@24768:       NONE => error "Inner syntax operations not yet installed"
wenzelm@24768:     | SOME ops => which ops ctxt x);
wenzelm@24263: in
wenzelm@24263: 
wenzelm@24768: val parse_sort = operation #parse_sort;
wenzelm@24768: val parse_typ = operation #parse_typ;
wenzelm@24768: val parse_term = operation #parse_term;
wenzelm@24768: val parse_prop = operation #parse_prop;
wenzelm@24768: val unparse_sort = operation #unparse_sort;
wenzelm@24768: val unparse_typ = operation #unparse_typ;
wenzelm@24768: val unparse_term = operation #unparse_term;
wenzelm@24768: 
wenzelm@24768: fun install_operations ops = CRITICAL (fn () =>
wenzelm@24768:   if is_some (! operations) then error "Inner syntax operations already installed"
wenzelm@24768:   else operations := SOME ops);
wenzelm@24768: 
wenzelm@24263: end;
wenzelm@24263: 
wenzelm@24263: 
wenzelm@24768: (* context-sensitive (un)checking *)
wenzelm@24263: 
wenzelm@24488: local
wenzelm@24488: 
wenzelm@24768: type key = int * bool;
wenzelm@25060: type 'a check = 'a list -> Proof.context -> ('a list * Proof.context) option;
wenzelm@24768: 
wenzelm@24488: structure Checks = GenericDataFun
wenzelm@24263: (
wenzelm@24488:   type T =
wenzelm@24768:     ((key * ((string * typ check) * stamp) list) list *
wenzelm@24768:      (key * ((string * term check) * stamp) list) list);
wenzelm@24488:   val empty = ([], []);
wenzelm@24263:   val extend = I;
wenzelm@24488:   fun merge _ ((typ_checks1, term_checks1), (typ_checks2, term_checks2)) : T =
wenzelm@24768:     (AList.join (op =) (K (Library.merge (eq_snd (op =)))) (typ_checks1, typ_checks2),
wenzelm@24768:      AList.join (op =) (K (Library.merge (eq_snd (op =)))) (term_checks1, term_checks2));
wenzelm@24263: );
wenzelm@24263: 
wenzelm@24768: fun gen_add which (key: key) name f =
wenzelm@24768:   Checks.map (which (AList.map_default op = (key, []) (cons ((name, f), stamp ()))));
wenzelm@24768: 
wenzelm@25060: fun check_stage fs = perhaps_loop (perhaps_apply (map uncurry fs));
wenzelm@25060: 
wenzelm@25060: fun gen_check which uncheck ctxt0 xs0 =
wenzelm@24263:   let
wenzelm@24768:     val funs = which (Checks.get (Context.Proof ctxt0))
wenzelm@24768:       |> map_filter (fn ((i, u), fs) => if uncheck = u then SOME (i, map (snd o fst) fs) else NONE)
wenzelm@25060:       |> Library.sort (int_ord o pairself fst) |> map snd
wenzelm@25060:       |> not uncheck ? map rev;
wenzelm@25060:     val check_all = perhaps_apply (map check_stage funs);
wenzelm@25060:   in #1 (perhaps check_all (xs0, ctxt0)) end;
wenzelm@24768: 
wenzelm@24768: fun map_sort f S =
wenzelm@24768:   (case f (TFree ("", S)) of
wenzelm@24768:     TFree ("", S') => S'
wenzelm@24923:   | _ => raise TYPE ("map_sort", [TFree ("", S)], []));
wenzelm@24488: 
wenzelm@24488: in
wenzelm@24263: 
wenzelm@24768: fun print_checks ctxt =
wenzelm@24768:   let
wenzelm@24768:     fun split_checks checks =
wenzelm@24768:       List.partition (fn ((_, un), _) => not un) checks
wenzelm@24768:       |> pairself (map (fn ((i, _), fs) => (i, map (fst o fst) fs))
wenzelm@24768:           #> sort (int_ord o pairself fst));
wenzelm@24768:     fun pretty_checks kind checks =
wenzelm@24768:       checks |> map (fn (i, names) => Pretty.block
wenzelm@24768:         [Pretty.str (kind ^ " (stage " ^ signed_string_of_int i ^ "):"),
wenzelm@24768:           Pretty.brk 1, Pretty.strs names]);
wenzelm@24768: 
wenzelm@24768:     val (typs, terms) = Checks.get (Context.Proof ctxt);
wenzelm@24768:     val (typ_checks, typ_unchecks) = split_checks typs;
wenzelm@24768:     val (term_checks, term_unchecks) = split_checks terms;
wenzelm@24768:   in
wenzelm@24768:     pretty_checks "typ_checks" typ_checks @
wenzelm@24768:     pretty_checks "term_checks" term_checks @
wenzelm@24768:     pretty_checks "typ_unchecks" typ_unchecks @
wenzelm@24768:     pretty_checks "term_unchecks" term_unchecks
wenzelm@24768:   end |> Pretty.chunks |> Pretty.writeln;
wenzelm@24768: 
wenzelm@24768: fun add_typ_check stage = gen_add apfst (stage, false);
wenzelm@24768: fun add_term_check stage = gen_add apsnd (stage, false);
wenzelm@24768: fun add_typ_uncheck stage = gen_add apfst (stage, true);
wenzelm@24768: fun add_term_uncheck stage = gen_add apsnd (stage, true);
wenzelm@24768: 
wenzelm@25060: val check_typs = gen_check fst false;
wenzelm@25060: val check_terms = gen_check snd false;
wenzelm@24680: fun check_props ctxt = map (TypeInfer.constrain propT) #> check_terms ctxt;
wenzelm@24488: 
wenzelm@24512: val check_typ = singleton o check_typs;
wenzelm@24512: val check_term = singleton o check_terms;
wenzelm@24512: val check_prop = singleton o check_props;
wenzelm@24768: val check_sort = map_sort o check_typ;
wenzelm@24263: 
wenzelm@25060: val uncheck_typs = gen_check fst true;
wenzelm@25060: val uncheck_terms = gen_check snd true;
wenzelm@24768: val uncheck_sort = map_sort o singleton o uncheck_typs;
wenzelm@24488: 
wenzelm@24488: end;
wenzelm@24488: 
wenzelm@24263: 
wenzelm@24923: (* derived operations for classrel and arity *)
wenzelm@24923: 
wenzelm@24923: val uncheck_classrel = map o singleton o uncheck_sort;
wenzelm@24923: 
wenzelm@24923: fun unparse_classrel ctxt cs = Pretty.block (flat
wenzelm@24923:   (separate [Pretty.str " <", Pretty.brk 1] (map (single o unparse_sort ctxt o single) cs)));
wenzelm@24923: 
wenzelm@24923: fun uncheck_arity ctxt (a, Ss, S) =
wenzelm@24923:   let
wenzelm@24923:     val T = Type (a, replicate (length Ss) dummyT);
wenzelm@24923:     val a' =
wenzelm@24923:       (case singleton (uncheck_typs ctxt) T of
wenzelm@24923:         Type (a', _) => a'
wenzelm@24923:       | T => raise TYPE ("uncheck_arity", [T], []));
wenzelm@24923:     val Ss' = map (uncheck_sort ctxt) Ss;
wenzelm@24923:     val S' = uncheck_sort ctxt S;
wenzelm@24923:   in (a', Ss', S') end;
wenzelm@24923: 
wenzelm@24923: fun unparse_arity ctxt (a, Ss, S) =
wenzelm@24923:   let
wenzelm@25043:     val prtT = unparse_typ ctxt (Type (a, []));
wenzelm@24923:     val dom =
wenzelm@24923:       if null Ss then []
wenzelm@24923:       else [Pretty.list "(" ")" (map (unparse_sort ctxt) Ss), Pretty.brk 1];
wenzelm@25043:   in Pretty.block ([prtT, Pretty.str " ::", Pretty.brk 1] @ dom @ [unparse_sort ctxt S]) end;
wenzelm@24923: 
wenzelm@24923: 
wenzelm@24923: (* read = parse + check *)
wenzelm@24263: 
wenzelm@24263: fun read_sort ctxt = parse_sort ctxt #> check_sort ctxt;
wenzelm@24263: fun read_typ ctxt = parse_typ ctxt #> singleton (check_typs ctxt);
wenzelm@24263: 
wenzelm@24263: fun read_terms ctxt = map (parse_term ctxt) #> check_terms ctxt;
wenzelm@24263: fun read_props ctxt = map (parse_prop ctxt) #> check_props ctxt;
wenzelm@24263: 
wenzelm@24263: val read_term = singleton o read_terms;
wenzelm@24263: val read_prop = singleton o read_props;
wenzelm@24263: 
wenzelm@24709: val read_sort_global = read_sort o ProofContext.init;
wenzelm@24709: val read_typ_global = read_typ o ProofContext.init;
wenzelm@24709: val read_term_global = read_term o ProofContext.init;
wenzelm@24709: val read_prop_global = read_prop o ProofContext.init;
wenzelm@24278: 
wenzelm@24263: 
wenzelm@24923: (* pretty = uncheck + unparse *)
wenzelm@24923: 
wenzelm@24923: fun pretty_sort ctxt = uncheck_sort ctxt #> unparse_sort ctxt;
wenzelm@24923: fun pretty_classrel ctxt = uncheck_classrel ctxt #> unparse_classrel ctxt;
wenzelm@24923: fun pretty_arity ctxt = uncheck_arity ctxt #> unparse_arity ctxt;
wenzelm@24923: fun pretty_typ ctxt = singleton (uncheck_typs ctxt) #> unparse_typ ctxt;
wenzelm@24923: fun pretty_term ctxt = singleton (uncheck_terms ctxt) #> unparse_term ctxt;
wenzelm@24923: 
wenzelm@24923: val string_of_sort = Pretty.string_of oo pretty_sort;
wenzelm@24923: val string_of_classrel = Pretty.string_of oo pretty_classrel;
wenzelm@24923: val string_of_arity = Pretty.string_of oo pretty_arity;
wenzelm@24923: val string_of_typ = Pretty.string_of oo pretty_typ;
wenzelm@24923: val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@24923: 
wenzelm@24970: (*pp operations -- deferred evaluation*)
wenzelm@24970: fun pp ctxt = Pretty.pp
wenzelm@24970:  (fn x => pretty_term ctxt x,
wenzelm@24970:   fn x => pretty_typ ctxt x,
wenzelm@24970:   fn x => pretty_sort ctxt x,
wenzelm@24970:   fn x => pretty_classrel ctxt x,
wenzelm@24970:   fn x => pretty_arity ctxt x);
wenzelm@24923: 
wenzelm@15833: (*export parts of internal Syntax structures*)
wenzelm@15833: open Lexicon SynExt Ast Parser TypeExt SynTrans Mixfix Printer;
wenzelm@2366: 
clasohm@0: end;
wenzelm@5692: 
wenzelm@5692: structure BasicSyntax: BASIC_SYNTAX = Syntax;
wenzelm@5692: open BasicSyntax;
wenzelm@23923: 
wenzelm@23923: structure Hidden = struct end;
wenzelm@23923: structure Ast = Hidden;
wenzelm@23923: structure SynExt = Hidden;
wenzelm@23923: structure Parser = Hidden;
wenzelm@23923: structure TypeExt = Hidden;
wenzelm@23923: structure SynTrans = Hidden;
wenzelm@23923: structure Mixfix = Hidden;
wenzelm@23923: structure Printer = Hidden;