src/Pure/Syntax/syntax.ML
author wenzelm
Mon Mar 01 17:07:36 2010 +0100 (2010-03-01)
changeset 35412 b8dead547d9e
parent 35394 11f58c600707
child 35429 afa8cf9e63d8
permissions -rw-r--r--
more uniform treatment of syntax for types vs. consts;
wenzelm@18
     1
(*  Title:      Pure/Syntax/syntax.ML
clasohm@0
     2
    Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@18
     3
wenzelm@24263
     4
Standard Isabelle syntax, based on arbitrary context-free grammars
wenzelm@24263
     5
(specified by mixfix declarations).
clasohm@0
     6
*)
clasohm@0
     7
wenzelm@260
     8
signature BASIC_SYNTAX =
wenzelm@2383
     9
sig
wenzelm@260
    10
  include AST0
wenzelm@556
    11
  include SYN_TRANS0
wenzelm@556
    12
  include MIXFIX0
wenzelm@260
    13
  include PRINTER0
wenzelm@2383
    14
end;
wenzelm@260
    15
clasohm@0
    16
signature SYNTAX =
wenzelm@2383
    17
sig
wenzelm@260
    18
  include AST1
clasohm@0
    19
  include LEXICON0
wenzelm@237
    20
  include SYN_EXT0
clasohm@0
    21
  include TYPE_EXT0
wenzelm@556
    22
  include SYN_TRANS1
wenzelm@556
    23
  include MIXFIX1
clasohm@0
    24
  include PRINTER0
wenzelm@556
    25
  type syntax
wenzelm@17079
    26
  val eq_syntax: syntax * syntax -> bool
wenzelm@14687
    27
  val is_keyword: syntax -> string -> bool
wenzelm@20784
    28
  type mode
wenzelm@24970
    29
  val mode_default: mode
wenzelm@24970
    30
  val mode_input: mode
wenzelm@26951
    31
  val merge_syntaxes: syntax -> syntax -> syntax
wenzelm@26951
    32
  val basic_syn: syntax
wenzelm@26951
    33
  val basic_nonterms: string list
wenzelm@26951
    34
  val print_gram: syntax -> unit
wenzelm@26951
    35
  val print_trans: syntax -> unit
wenzelm@26951
    36
  val print_syntax: syntax -> unit
wenzelm@26951
    37
  val guess_infix: syntax -> string -> mixfix option
wenzelm@30573
    38
  val read_token: string -> Symbol_Pos.T list * Position.T
wenzelm@32738
    39
  val ambiguity_is_error: bool Unsynchronized.ref
wenzelm@32738
    40
  val ambiguity_level: int Unsynchronized.ref
wenzelm@32738
    41
  val ambiguity_limit: int Unsynchronized.ref
wenzelm@26951
    42
  val standard_parse_term: Pretty.pp -> (term -> string option) ->
wenzelm@26951
    43
    (((string * int) * sort) list -> string * int -> Term.sort) ->
wenzelm@27195
    44
    (string -> bool * string) -> (string -> string option) ->
wenzelm@26951
    45
    (typ -> typ) -> (sort -> sort) -> Proof.context ->
wenzelm@30573
    46
    (string -> bool) -> syntax -> typ -> Symbol_Pos.T list * Position.T -> term
wenzelm@26951
    47
  val standard_parse_typ: Proof.context -> syntax ->
wenzelm@27786
    48
    ((indexname * sort) list -> indexname -> sort) -> (sort -> sort) ->
wenzelm@30573
    49
    Symbol_Pos.T list * Position.T -> typ
wenzelm@27786
    50
  val standard_parse_sort: Proof.context -> syntax -> (sort -> sort) ->
wenzelm@30573
    51
    Symbol_Pos.T list * Position.T -> sort
wenzelm@26951
    52
  datatype 'a trrule =
wenzelm@26951
    53
    ParseRule of 'a * 'a |
wenzelm@26951
    54
    PrintRule of 'a * 'a |
wenzelm@26951
    55
    ParsePrintRule of 'a * 'a
wenzelm@26951
    56
  val map_trrule: ('a -> 'b) -> 'a trrule -> 'b trrule
wenzelm@35111
    57
  val is_const: syntax -> string -> bool
wenzelm@26951
    58
  val standard_unparse_term: (string -> xstring) ->
wenzelm@26951
    59
    Proof.context -> syntax -> bool -> term -> Pretty.T
wenzelm@26951
    60
  val standard_unparse_typ: Proof.context -> syntax -> typ -> Pretty.T
wenzelm@26951
    61
  val standard_unparse_sort: Proof.context -> syntax -> sort -> Pretty.T
wenzelm@25394
    62
  val update_consts: string list -> syntax -> syntax
wenzelm@25394
    63
  val update_trfuns:
wenzelm@15755
    64
    (string * ((ast list -> ast) * stamp)) list *
wenzelm@15755
    65
    (string * ((term list -> term) * stamp)) list *
wenzelm@15755
    66
    (string * ((bool -> typ -> term list -> term) * stamp)) list *
wenzelm@15755
    67
    (string * ((ast list -> ast) * stamp)) list -> syntax -> syntax
wenzelm@25394
    68
  val update_advanced_trfuns:
wenzelm@21772
    69
    (string * ((Proof.context -> ast list -> ast) * stamp)) list *
wenzelm@21772
    70
    (string * ((Proof.context -> term list -> term) * stamp)) list *
wenzelm@21772
    71
    (string * ((Proof.context -> bool -> typ -> term list -> term) * stamp)) list *
wenzelm@21772
    72
    (string * ((Proof.context -> ast list -> ast) * stamp)) list -> syntax -> syntax
wenzelm@26704
    73
  val extend_tokentrfuns: (string * string * (Proof.context -> string -> Pretty.T)) list ->
wenzelm@26704
    74
    syntax -> syntax
wenzelm@35412
    75
  val update_type_gram: bool -> mode -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@35412
    76
  val update_const_gram: bool -> (string -> bool) ->
wenzelm@20784
    77
    mode -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@25394
    78
  val update_trrules: Proof.context -> (string -> bool) -> syntax ->
wenzelm@14904
    79
    (string * string) trrule list -> syntax -> syntax
wenzelm@21772
    80
  val remove_trrules: Proof.context -> (string -> bool) -> syntax ->
wenzelm@19262
    81
    (string * string) trrule list -> syntax -> syntax
wenzelm@25394
    82
  val update_trrules_i: ast trrule list -> syntax -> syntax
wenzelm@19262
    83
  val remove_trrules_i: ast trrule list -> syntax -> syntax
wenzelm@30573
    84
  val parse_token: Markup.T -> string -> Symbol_Pos.T list * Position.T
wenzelm@24263
    85
  val parse_sort: Proof.context -> string -> sort
wenzelm@24263
    86
  val parse_typ: Proof.context -> string -> typ
wenzelm@24263
    87
  val parse_term: Proof.context -> string -> term
wenzelm@24263
    88
  val parse_prop: Proof.context -> string -> term
wenzelm@24768
    89
  val unparse_sort: Proof.context -> sort -> Pretty.T
wenzelm@24923
    90
  val unparse_classrel: Proof.context -> class list -> Pretty.T
wenzelm@24923
    91
  val unparse_arity: Proof.context -> arity -> Pretty.T
wenzelm@24768
    92
  val unparse_typ: Proof.context -> typ -> Pretty.T
wenzelm@24768
    93
  val unparse_term: Proof.context -> term -> Pretty.T
wenzelm@24768
    94
  val install_operations:
wenzelm@24768
    95
   {parse_sort: Proof.context -> string -> sort,
wenzelm@24768
    96
    parse_typ: Proof.context -> string -> typ,
wenzelm@24768
    97
    parse_term: Proof.context -> string -> term,
wenzelm@24768
    98
    parse_prop: Proof.context -> string -> term,
wenzelm@24768
    99
    unparse_sort: Proof.context -> sort -> Pretty.T,
wenzelm@24768
   100
    unparse_typ: Proof.context -> typ -> Pretty.T,
wenzelm@24768
   101
    unparse_term: Proof.context -> term -> Pretty.T} -> unit
wenzelm@24768
   102
  val print_checks: Proof.context -> unit
wenzelm@24768
   103
  val add_typ_check: int -> string ->
wenzelm@25060
   104
    (typ list -> Proof.context -> (typ list * Proof.context) option) ->
wenzelm@24768
   105
    Context.generic -> Context.generic
wenzelm@24768
   106
  val add_term_check: int -> string ->
wenzelm@25060
   107
    (term list -> Proof.context -> (term list * Proof.context) option) ->
wenzelm@24768
   108
    Context.generic -> Context.generic
wenzelm@24768
   109
  val add_typ_uncheck: int -> string ->
wenzelm@25060
   110
    (typ list -> Proof.context -> (typ list * Proof.context) option) ->
wenzelm@24768
   111
    Context.generic -> Context.generic
wenzelm@24768
   112
  val add_term_uncheck: int -> string ->
wenzelm@25060
   113
    (term list -> Proof.context -> (term list * Proof.context) option) ->
wenzelm@24768
   114
    Context.generic -> Context.generic
wenzelm@24488
   115
  val check_sort: Proof.context -> sort -> sort
wenzelm@24512
   116
  val check_typ: Proof.context -> typ -> typ
wenzelm@24512
   117
  val check_term: Proof.context -> term -> term
wenzelm@24512
   118
  val check_prop: Proof.context -> term -> term
wenzelm@24488
   119
  val check_typs: Proof.context -> typ list -> typ list
wenzelm@24263
   120
  val check_terms: Proof.context -> term list -> term list
wenzelm@24263
   121
  val check_props: Proof.context -> term list -> term list
wenzelm@24923
   122
  val uncheck_sort: Proof.context -> sort -> sort
wenzelm@24923
   123
  val uncheck_arity: Proof.context -> arity -> arity
wenzelm@24923
   124
  val uncheck_classrel: Proof.context -> class list -> class list
wenzelm@24768
   125
  val uncheck_typs: Proof.context -> typ list -> typ list
wenzelm@24768
   126
  val uncheck_terms: Proof.context -> term list -> term list
wenzelm@24263
   127
  val read_sort: Proof.context -> string -> sort
wenzelm@24263
   128
  val read_typ: Proof.context -> string -> typ
wenzelm@24488
   129
  val read_term: Proof.context -> string -> term
wenzelm@24488
   130
  val read_prop: Proof.context -> string -> term
wenzelm@24263
   131
  val read_terms: Proof.context -> string list -> term list
wenzelm@24263
   132
  val read_props: Proof.context -> string list -> term list
wenzelm@24709
   133
  val read_sort_global: theory -> string -> sort
wenzelm@24709
   134
  val read_typ_global: theory -> string -> typ
wenzelm@24709
   135
  val read_term_global: theory -> string -> term
wenzelm@24709
   136
  val read_prop_global: theory -> string -> term
wenzelm@24923
   137
  val pretty_term: Proof.context -> term -> Pretty.T
wenzelm@24923
   138
  val pretty_typ: Proof.context -> typ -> Pretty.T
wenzelm@24923
   139
  val pretty_sort: Proof.context -> sort -> Pretty.T
wenzelm@24923
   140
  val pretty_classrel: Proof.context -> class list -> Pretty.T
wenzelm@24923
   141
  val pretty_arity: Proof.context -> arity -> Pretty.T
wenzelm@24923
   142
  val string_of_term: Proof.context -> term -> string
wenzelm@24923
   143
  val string_of_typ: Proof.context -> typ -> string
wenzelm@24923
   144
  val string_of_sort: Proof.context -> sort -> string
wenzelm@24923
   145
  val string_of_classrel: Proof.context -> class list -> string
wenzelm@24923
   146
  val string_of_arity: Proof.context -> arity -> string
wenzelm@26951
   147
  val is_pretty_global: Proof.context -> bool
wenzelm@26951
   148
  val set_pretty_global: bool -> Proof.context -> Proof.context
wenzelm@26951
   149
  val init_pretty_global: theory -> Proof.context
wenzelm@26951
   150
  val pretty_term_global: theory -> term -> Pretty.T
wenzelm@26951
   151
  val pretty_typ_global: theory -> typ -> Pretty.T
wenzelm@26951
   152
  val pretty_sort_global: theory -> sort -> Pretty.T
wenzelm@26951
   153
  val string_of_term_global: theory -> term -> string
wenzelm@26951
   154
  val string_of_typ_global: theory -> typ -> string
wenzelm@26951
   155
  val string_of_sort_global: theory -> sort -> string
wenzelm@24970
   156
  val pp: Proof.context -> Pretty.pp
wenzelm@26951
   157
  val pp_global: theory -> Pretty.pp
wenzelm@2383
   158
end;
clasohm@0
   159
wenzelm@12094
   160
structure Syntax: SYNTAX =
clasohm@0
   161
struct
clasohm@0
   162
wenzelm@237
   163
(** tables of translation functions **)
wenzelm@237
   164
wenzelm@5692
   165
(* parse (ast) translations *)
wenzelm@5692
   166
wenzelm@17412
   167
fun lookup_tr tab c = Option.map fst (Symtab.lookup tab c);
wenzelm@237
   168
wenzelm@23655
   169
fun err_dup_trfun name c =
wenzelm@23655
   170
  error ("More than one " ^ name ^ " for " ^ quote c);
wenzelm@237
   171
wenzelm@21536
   172
fun remove_trtab trfuns = fold (Symtab.remove SynExt.eq_trfun) trfuns;
wenzelm@21536
   173
haftmann@29004
   174
fun update_trtab name trfuns tab = fold Symtab.update_new trfuns (remove_trtab trfuns tab)
wenzelm@23655
   175
  handle Symtab.DUP c => err_dup_trfun name c;
wenzelm@237
   176
wenzelm@15755
   177
fun merge_trtabs name tab1 tab2 = Symtab.merge SynExt.eq_trfun (tab1, tab2)
wenzelm@23655
   178
  handle Symtab.DUP c => err_dup_trfun name c;
wenzelm@237
   179
wenzelm@237
   180
wenzelm@5692
   181
(* print (ast) translations *)
wenzelm@5692
   182
wenzelm@18931
   183
fun lookup_tr' tab c = map fst (Symtab.lookup_list tab c);
wenzelm@25394
   184
fun update_tr'tab trfuns = fold_rev (Symtab.update_list SynExt.eq_trfun) trfuns;
wenzelm@18931
   185
fun remove_tr'tab trfuns = fold (Symtab.remove_list SynExt.eq_trfun) trfuns;
wenzelm@18931
   186
fun merge_tr'tabs tab1 tab2 = Symtab.merge_list SynExt.eq_trfun (tab1, tab2);
wenzelm@5692
   187
wenzelm@5692
   188
wenzelm@237
   189
wenzelm@2700
   190
(** tables of token translation functions **)
wenzelm@2700
   191
wenzelm@2700
   192
fun lookup_tokentr tabs modes =
wenzelm@19482
   193
  let val trs = distinct (eq_fst (op =)) (maps (these o AList.lookup (op =) tabs) (modes @ [""]))
haftmann@17314
   194
  in fn c => Option.map fst (AList.lookup (op =) trs c) end;
wenzelm@2700
   195
wenzelm@2700
   196
fun merge_tokentrtabs tabs1 tabs2 =
wenzelm@2700
   197
  let
wenzelm@2700
   198
    fun eq_tr ((c1, (_, s1)), (c2, (_, s2))) = c1 = c2 andalso s1 = s2;
wenzelm@2700
   199
wenzelm@4703
   200
    fun name (s, _) = implode (tl (Symbol.explode s));
wenzelm@2706
   201
wenzelm@2700
   202
    fun merge mode =
wenzelm@2700
   203
      let
wenzelm@17213
   204
        val trs1 = these (AList.lookup (op =) tabs1 mode);
wenzelm@17213
   205
        val trs2 = these (AList.lookup (op =) tabs2 mode);
wenzelm@19046
   206
        val trs = distinct eq_tr (trs1 @ trs2);
wenzelm@2700
   207
      in
wenzelm@18964
   208
        (case duplicates (eq_fst (op =)) trs of
wenzelm@2700
   209
          [] => (mode, trs)
wenzelm@2700
   210
        | dups => error ("More than one token translation function in mode " ^
wenzelm@2706
   211
            quote mode ^ " for " ^ commas_quote (map name dups)))
wenzelm@2700
   212
      end;
wenzelm@19046
   213
  in map merge (distinct (op =) (map fst (tabs1 @ tabs2))) end;
wenzelm@2700
   214
wenzelm@15755
   215
fun extend_tokentrtab tokentrs tabs =
wenzelm@2700
   216
  let
wenzelm@17213
   217
    fun ins_tokentr (m, c, f) =
wenzelm@17213
   218
      AList.default (op =) (m, [])
wenzelm@17213
   219
      #> AList.map_entry (op =) m (cons ("_" ^ c, (f, stamp ())));
wenzelm@15759
   220
  in merge_tokentrtabs tabs (fold ins_tokentr tokentrs []) end;
wenzelm@2700
   221
wenzelm@2700
   222
wenzelm@2700
   223
wenzelm@237
   224
(** tables of translation rules **)
wenzelm@237
   225
wenzelm@5692
   226
type ruletab = (Ast.ast * Ast.ast) list Symtab.table;
wenzelm@237
   227
wenzelm@19482
   228
fun dest_ruletab tab = maps snd (Symtab.dest tab);
wenzelm@237
   229
wenzelm@237
   230
wenzelm@25394
   231
(* empty, update, merge ruletabs *)
wenzelm@237
   232
wenzelm@25394
   233
val update_ruletab = fold_rev (fn r => Symtab.update_list (op =) (Ast.head_of_rule r, r));
wenzelm@18931
   234
val remove_ruletab = fold (fn r => Symtab.remove_list (op =) (Ast.head_of_rule r, r));
wenzelm@18931
   235
fun merge_ruletabs tab1 tab2 = Symtab.merge_list (op =) (tab1, tab2);
clasohm@0
   236
clasohm@0
   237
clasohm@0
   238
clasohm@0
   239
(** datatype syntax **)
clasohm@0
   240
wenzelm@237
   241
datatype syntax =
wenzelm@237
   242
  Syntax of {
wenzelm@15755
   243
    input: SynExt.xprod list,
wenzelm@4703
   244
    lexicon: Scan.lexicon,
wenzelm@5692
   245
    gram: Parser.gram,
wenzelm@18
   246
    consts: string list,
wenzelm@2913
   247
    prmodes: string list,
wenzelm@21772
   248
    parse_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) Symtab.table,
wenzelm@237
   249
    parse_ruletab: ruletab,
wenzelm@21772
   250
    parse_trtab: ((Proof.context -> term list -> term) * stamp) Symtab.table,
wenzelm@21772
   251
    print_trtab: ((Proof.context -> bool -> typ -> term list -> term) * stamp) list Symtab.table,
wenzelm@237
   252
    print_ruletab: ruletab,
wenzelm@21772
   253
    print_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) list Symtab.table,
wenzelm@26704
   254
    tokentrtab: (string * (string * ((Proof.context -> string -> Pretty.T) * stamp)) list) list,
wenzelm@17079
   255
    prtabs: Printer.prtabs} * stamp;
clasohm@0
   256
wenzelm@17079
   257
fun eq_syntax (Syntax (_, s1), Syntax (_, s2)) = s1 = s2;
wenzelm@17079
   258
wenzelm@17079
   259
fun is_keyword (Syntax ({lexicon, ...}, _)) = Scan.is_literal lexicon o Symbol.explode;
wenzelm@14687
   260
wenzelm@20784
   261
type mode = string * bool;
wenzelm@24970
   262
val mode_default = ("", true);
wenzelm@25122
   263
val mode_input = (PrintMode.input, true);
wenzelm@15755
   264
wenzelm@18
   265
wenzelm@237
   266
(* empty_syntax *)
wenzelm@18
   267
wenzelm@17079
   268
val empty_syntax = Syntax
wenzelm@17079
   269
  ({input = [],
wenzelm@4703
   270
    lexicon = Scan.empty_lexicon,
wenzelm@5692
   271
    gram = Parser.empty_gram,
wenzelm@167
   272
    consts = [],
wenzelm@2913
   273
    prmodes = [],
wenzelm@5692
   274
    parse_ast_trtab = Symtab.empty,
wenzelm@5692
   275
    parse_ruletab = Symtab.empty,
wenzelm@5692
   276
    parse_trtab = Symtab.empty,
wenzelm@5692
   277
    print_trtab = Symtab.empty,
wenzelm@5692
   278
    print_ruletab = Symtab.empty,
wenzelm@5692
   279
    print_ast_trtab = Symtab.empty,
wenzelm@2700
   280
    tokentrtab = [],
wenzelm@17079
   281
    prtabs = Printer.empty_prtabs}, stamp ());
wenzelm@167
   282
wenzelm@167
   283
wenzelm@25394
   284
(* update_syntax *)
wenzelm@167
   285
wenzelm@25394
   286
fun update_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
wenzelm@167
   287
  let
wenzelm@15755
   288
    val {input, lexicon, gram, consts = consts1, prmodes = prmodes1,
wenzelm@2366
   289
      parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@2700
   290
      print_ast_trtab, tokentrtab, prtabs} = tabs;
wenzelm@14904
   291
    val SynExt.SynExt {xprods, consts = consts2, prmodes = prmodes2,
wenzelm@2913
   292
      parse_ast_translation, parse_rules, parse_translation, print_translation, print_rules,
wenzelm@2700
   293
      print_ast_translation, token_translation} = syn_ext;
wenzelm@25394
   294
    val input' = if inout then fold (insert (op =)) xprods input else input;
wenzelm@25394
   295
    val changed = length input <> length input';
wenzelm@19546
   296
    fun if_inout xs = if inout then xs else [];
wenzelm@167
   297
  in
wenzelm@17079
   298
    Syntax
wenzelm@25394
   299
    ({input = input',
wenzelm@27768
   300
      lexicon =
wenzelm@27768
   301
        if changed then fold Scan.extend_lexicon (SynExt.delims_of xprods) lexicon else lexicon,
wenzelm@25394
   302
      gram = if changed then Parser.extend_gram gram xprods else gram,
wenzelm@35263
   303
      consts = Library.merge (op =) (consts1, filter_out (can Lexicon.unmark_const) consts2),
wenzelm@18921
   304
      prmodes = insert (op =) mode (Library.merge (op =) (prmodes1, prmodes2)),
wenzelm@167
   305
      parse_ast_trtab =
wenzelm@25394
   306
        update_trtab "parse ast translation" (if_inout parse_ast_translation) parse_ast_trtab,
wenzelm@25394
   307
      parse_ruletab = update_ruletab (if_inout parse_rules) parse_ruletab,
wenzelm@25394
   308
      parse_trtab = update_trtab "parse translation" (if_inout parse_translation) parse_trtab,
wenzelm@25394
   309
      print_trtab = update_tr'tab print_translation print_trtab,
wenzelm@25394
   310
      print_ruletab = update_ruletab print_rules print_ruletab,
wenzelm@25394
   311
      print_ast_trtab = update_tr'tab print_ast_translation print_ast_trtab,
wenzelm@15755
   312
      tokentrtab = extend_tokentrtab token_translation tokentrtab,
wenzelm@25394
   313
      prtabs = Printer.update_prtabs mode xprods prtabs}, stamp ())
wenzelm@18
   314
  end;
wenzelm@18
   315
wenzelm@15755
   316
wenzelm@15755
   317
(* remove_syntax *)
wenzelm@15755
   318
wenzelm@17079
   319
fun remove_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
wenzelm@15755
   320
  let
wenzelm@15755
   321
    val SynExt.SynExt {xprods, consts = _, prmodes = _,
wenzelm@15755
   322
      parse_ast_translation, parse_rules, parse_translation, print_translation, print_rules,
wenzelm@15755
   323
      print_ast_translation, token_translation = _} = syn_ext;
wenzelm@15755
   324
    val {input, lexicon, gram, consts, prmodes,
wenzelm@15755
   325
      parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@15755
   326
      print_ast_trtab, tokentrtab, prtabs} = tabs;
wenzelm@19300
   327
    val input' = if inout then subtract (op =) xprods input else input;
wenzelm@25394
   328
    val changed = length input <> length input';
wenzelm@19546
   329
    fun if_inout xs = if inout then xs else [];
wenzelm@15755
   330
  in
wenzelm@17079
   331
    Syntax
wenzelm@17079
   332
    ({input = input',
wenzelm@25387
   333
      lexicon = if changed then Scan.make_lexicon (SynExt.delims_of input') else lexicon,
wenzelm@25387
   334
      gram = if changed then Parser.make_gram input' else gram,
wenzelm@15755
   335
      consts = consts,
wenzelm@15755
   336
      prmodes = prmodes,
wenzelm@19546
   337
      parse_ast_trtab = remove_trtab (if_inout parse_ast_translation) parse_ast_trtab,
wenzelm@19546
   338
      parse_ruletab = remove_ruletab (if_inout parse_rules) parse_ruletab,
wenzelm@19546
   339
      parse_trtab = remove_trtab (if_inout parse_translation) parse_trtab,
wenzelm@15755
   340
      print_trtab = remove_tr'tab print_translation print_trtab,
wenzelm@15755
   341
      print_ruletab = remove_ruletab print_rules print_ruletab,
wenzelm@15755
   342
      print_ast_trtab = remove_tr'tab print_ast_translation print_ast_trtab,
wenzelm@15755
   343
      tokentrtab = tokentrtab,
wenzelm@17079
   344
      prtabs = Printer.remove_prtabs mode xprods prtabs}, stamp ())
wenzelm@15755
   345
  end;
wenzelm@14904
   346
wenzelm@18
   347
wenzelm@237
   348
(* merge_syntaxes *)
clasohm@0
   349
wenzelm@17079
   350
fun merge_syntaxes (Syntax (tabs1, _)) (Syntax (tabs2, _)) =
clasohm@0
   351
  let
wenzelm@15755
   352
    val {input = input1, lexicon = lexicon1, gram = gram1, consts = consts1,
wenzelm@15755
   353
      prmodes = prmodes1, parse_ast_trtab = parse_ast_trtab1,
wenzelm@15755
   354
      parse_ruletab = parse_ruletab1, parse_trtab = parse_trtab1,
wenzelm@15755
   355
      print_trtab = print_trtab1, print_ruletab = print_ruletab1,
wenzelm@15755
   356
      print_ast_trtab = print_ast_trtab1, tokentrtab = tokentrtab1, prtabs = prtabs1} = tabs1;
wenzelm@237
   357
wenzelm@15755
   358
    val {input = input2, lexicon = lexicon2, gram = gram2, consts = consts2,
wenzelm@15755
   359
      prmodes = prmodes2, parse_ast_trtab = parse_ast_trtab2,
wenzelm@15755
   360
      parse_ruletab = parse_ruletab2, parse_trtab = parse_trtab2,
wenzelm@15755
   361
      print_trtab = print_trtab2, print_ruletab = print_ruletab2,
wenzelm@15755
   362
      print_ast_trtab = print_ast_trtab2, tokentrtab = tokentrtab2, prtabs = prtabs2} = tabs2;
clasohm@0
   363
  in
wenzelm@17079
   364
    Syntax
wenzelm@18921
   365
    ({input = Library.merge (op =) (input1, input2),
wenzelm@27768
   366
      lexicon = Scan.merge_lexicons (lexicon1, lexicon2),
wenzelm@5692
   367
      gram = Parser.merge_grams gram1 gram2,
wenzelm@18428
   368
      consts = sort_distinct string_ord (consts1 @ consts2),
wenzelm@18921
   369
      prmodes = Library.merge (op =) (prmodes1, prmodes2),
wenzelm@237
   370
      parse_ast_trtab =
wenzelm@15755
   371
        merge_trtabs "parse ast translation" parse_ast_trtab1 parse_ast_trtab2,
wenzelm@237
   372
      parse_ruletab = merge_ruletabs parse_ruletab1 parse_ruletab2,
wenzelm@15755
   373
      parse_trtab = merge_trtabs "parse translation" parse_trtab1 parse_trtab2,
wenzelm@5692
   374
      print_trtab = merge_tr'tabs print_trtab1 print_trtab2,
wenzelm@237
   375
      print_ruletab = merge_ruletabs print_ruletab1 print_ruletab2,
wenzelm@5692
   376
      print_ast_trtab = merge_tr'tabs print_ast_trtab1 print_ast_trtab2,
wenzelm@2700
   377
      tokentrtab = merge_tokentrtabs tokentrtab1 tokentrtab2,
wenzelm@17079
   378
      prtabs = Printer.merge_prtabs prtabs1 prtabs2}, stamp ())
clasohm@0
   379
  end;
clasohm@0
   380
clasohm@0
   381
wenzelm@18720
   382
(* basic syntax *)
wenzelm@260
   383
wenzelm@18720
   384
val basic_syn =
wenzelm@17168
   385
  empty_syntax
wenzelm@25394
   386
  |> update_syntax mode_default TypeExt.type_ext
wenzelm@25394
   387
  |> update_syntax mode_default SynExt.pure_ext;
wenzelm@260
   388
wenzelm@18720
   389
val basic_nonterms =
wenzelm@18720
   390
  (Lexicon.terminals @ [SynExt.logic, "type", "types", "sort", "classes",
wenzelm@18720
   391
    SynExt.args, SynExt.cargs, "pttrn", "pttrns", "idt", "idts", "aprop",
wenzelm@30189
   392
    "asms", SynExt.any, SynExt.sprop, "num_const", "float_const",
nipkow@28904
   393
    "index", "struct"]);
wenzelm@18720
   394
clasohm@0
   395
wenzelm@4887
   396
wenzelm@15759
   397
(** print syntax **)
wenzelm@15759
   398
wenzelm@15759
   399
local
clasohm@0
   400
wenzelm@260
   401
fun pretty_strs_qs name strs =
wenzelm@28840
   402
  Pretty.strs (name :: map quote (sort_strings strs));
clasohm@0
   403
wenzelm@17079
   404
fun pretty_gram (Syntax (tabs, _)) =
clasohm@0
   405
  let
wenzelm@32784
   406
    val {lexicon, prmodes, gram, ...} = tabs;
wenzelm@28375
   407
    val prmodes' = sort_strings (filter_out (fn s => s = "") prmodes);
clasohm@0
   408
  in
wenzelm@8720
   409
    [pretty_strs_qs "lexicon:" (Scan.dest_lexicon lexicon),
wenzelm@8720
   410
      Pretty.big_list "prods:" (Parser.pretty_gram gram),
wenzelm@8720
   411
      pretty_strs_qs "print modes:" prmodes']
clasohm@0
   412
  end;
clasohm@0
   413
wenzelm@17079
   414
fun pretty_trans (Syntax (tabs, _)) =
clasohm@0
   415
  let
wenzelm@260
   416
    fun pretty_trtab name tab =
wenzelm@5692
   417
      pretty_strs_qs name (Symtab.keys tab);
clasohm@0
   418
wenzelm@260
   419
    fun pretty_ruletab name tab =
wenzelm@5692
   420
      Pretty.big_list name (map Ast.pretty_rule (dest_ruletab tab));
clasohm@0
   421
wenzelm@28840
   422
    fun pretty_tokentr (mode, trs) = Pretty.strs (quote mode ^ ":" :: map fst trs);
wenzelm@4703
   423
wenzelm@237
   424
    val {consts, parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab,
wenzelm@4703
   425
      print_ruletab, print_ast_trtab, tokentrtab, ...} = tabs;
clasohm@0
   426
  in
wenzelm@8720
   427
    [pretty_strs_qs "consts:" consts,
wenzelm@8720
   428
      pretty_trtab "parse_ast_translation:" parse_ast_trtab,
wenzelm@8720
   429
      pretty_ruletab "parse_rules:" parse_ruletab,
wenzelm@8720
   430
      pretty_trtab "parse_translation:" parse_trtab,
wenzelm@8720
   431
      pretty_trtab "print_translation:" print_trtab,
wenzelm@8720
   432
      pretty_ruletab "print_rules:" print_ruletab,
wenzelm@8720
   433
      pretty_trtab "print_ast_translation:" print_ast_trtab,
wenzelm@8720
   434
      Pretty.big_list "token_translation:" (map pretty_tokentr tokentrtab)]
clasohm@0
   435
  end;
clasohm@0
   436
wenzelm@15759
   437
in
clasohm@0
   438
wenzelm@15759
   439
fun print_gram syn = Pretty.writeln (Pretty.chunks (pretty_gram syn));
wenzelm@15759
   440
fun print_trans syn = Pretty.writeln (Pretty.chunks (pretty_trans syn));
wenzelm@15759
   441
fun print_syntax syn = Pretty.writeln (Pretty.chunks (pretty_gram syn @ pretty_trans syn));
clasohm@0
   442
wenzelm@15759
   443
end;
clasohm@0
   444
clasohm@0
   445
wenzelm@26951
   446
(* reconstructing infixes -- educated guessing *)
wenzelm@26951
   447
wenzelm@26951
   448
fun guess_infix (Syntax ({gram, ...}, _)) c =
wenzelm@26951
   449
  (case Parser.guess_infix_lr gram c of
wenzelm@26951
   450
    SOME (s, l, r, j) => SOME
wenzelm@35130
   451
     (if l then Mixfix.Infixl (s, j)
wenzelm@35130
   452
      else if r then Mixfix.Infixr (s, j)
wenzelm@35130
   453
      else Mixfix.Infix (s, j))
wenzelm@26951
   454
  | NONE => NONE);
wenzelm@26951
   455
wenzelm@26951
   456
clasohm@0
   457
wenzelm@237
   458
(** read **)
wenzelm@18
   459
wenzelm@27786
   460
(* read token -- with optional YXML encoding of position *)
wenzelm@27786
   461
wenzelm@27786
   462
fun read_token str =
wenzelm@27786
   463
  let val (text, pos) =
wenzelm@27803
   464
    (case YXML.parse str handle Fail msg => error msg of
wenzelm@27803
   465
      XML.Elem ("token", props, [XML.Text text]) => (text, Position.of_properties props)
wenzelm@27803
   466
    | XML.Elem ("token", props, []) => ("", Position.of_properties props)
wenzelm@27803
   467
    | XML.Text text => (text, Position.none)
wenzelm@27803
   468
    | _ => (str, Position.none))
wenzelm@30573
   469
  in (Symbol_Pos.explode (text, pos), pos) end;
wenzelm@27786
   470
wenzelm@27786
   471
wenzelm@260
   472
(* read_ast *)
wenzelm@260
   473
wenzelm@32738
   474
val ambiguity_is_error = Unsynchronized.ref false;
wenzelm@32738
   475
val ambiguity_level = Unsynchronized.ref 1;
wenzelm@32738
   476
val ambiguity_limit = Unsynchronized.ref 10;
clasohm@882
   477
wenzelm@27786
   478
fun ambiguity_msg pos = "Parse error: ambiguous syntax" ^ Position.str_of pos;
wenzelm@27786
   479
wenzelm@27786
   480
fun read_asts ctxt is_logtype (Syntax (tabs, _)) xids root (syms, pos) =
wenzelm@260
   481
  let
wenzelm@14904
   482
    val {lexicon, gram, parse_ast_trtab, ...} = tabs;
wenzelm@27889
   483
    val toks = Lexicon.tokenize lexicon xids syms;
wenzelm@28413
   484
    val _ = List.app Lexicon.report_token toks;
wenzelm@27889
   485
wenzelm@14904
   486
    val root' = if root <> "prop" andalso is_logtype root then SynExt.logic else root;
wenzelm@27889
   487
    val pts = Parser.parse gram root' (filter Lexicon.is_proper toks);
wenzelm@25993
   488
    val len = length pts;
clasohm@330
   489
wenzelm@25993
   490
    val limit = ! ambiguity_limit;
wenzelm@12292
   491
    fun show_pt pt =
wenzelm@21772
   492
      Pretty.string_of (Ast.pretty_ast (hd (SynTrans.pts_to_asts ctxt (K NONE) [pt])));
wenzelm@260
   493
  in
wenzelm@25993
   494
    if len <= ! ambiguity_level then ()
wenzelm@27786
   495
    else if ! ambiguity_is_error then error (ambiguity_msg pos)
wenzelm@25993
   496
    else
wenzelm@25993
   497
      (warning (cat_lines
wenzelm@33919
   498
        (("Ambiguous input" ^ Position.str_of pos ^
wenzelm@27786
   499
          "\nproduces " ^ string_of_int len ^ " parse trees" ^
wenzelm@25993
   500
          (if len <= limit then "" else " (" ^ string_of_int limit ^ " displayed)") ^ ":") ::
haftmann@33957
   501
          map show_pt (take limit pts))));
wenzelm@21772
   502
    SynTrans.pts_to_asts ctxt (lookup_tr parse_ast_trtab) pts
wenzelm@260
   503
  end;
wenzelm@260
   504
wenzelm@260
   505
wenzelm@237
   506
(* read *)
clasohm@0
   507
wenzelm@27786
   508
fun read ctxt is_logtype (syn as Syntax (tabs, _)) ty inp =
clasohm@0
   509
  let
wenzelm@237
   510
    val {parse_ruletab, parse_trtab, ...} = tabs;
wenzelm@27786
   511
    val asts = read_asts ctxt is_logtype syn false (SynExt.typ_to_nonterm ty) inp;
clasohm@0
   512
  in
wenzelm@21772
   513
    SynTrans.asts_to_terms ctxt (lookup_tr parse_trtab)
wenzelm@18931
   514
      (map (Ast.normalize_ast (Symtab.lookup_list parse_ruletab)) asts)
clasohm@0
   515
  end;
clasohm@0
   516
clasohm@0
   517
wenzelm@22703
   518
(* read terms *)
wenzelm@22703
   519
wenzelm@24372
   520
(*brute-force disambiguation via type-inference*)
wenzelm@24372
   521
fun disambig _ _ [t] = t
wenzelm@24372
   522
  | disambig pp check ts =
wenzelm@24372
   523
      let
wenzelm@25993
   524
        val level = ! ambiguity_level;
wenzelm@25993
   525
        val limit = ! ambiguity_limit;
wenzelm@24372
   526
wenzelm@24372
   527
        val ambiguity = length ts;
wenzelm@24372
   528
        fun ambig_msg () =
wenzelm@25993
   529
          if ambiguity > 1 andalso ambiguity <= level then
wenzelm@24372
   530
            "Got more than one parse tree.\n\
wenzelm@25993
   531
            \Retry with smaller Syntax.ambiguity_level for more information."
wenzelm@24372
   532
          else "";
wenzelm@25993
   533
wenzelm@35394
   534
        val errs = Par_List.map check ts;
wenzelm@25993
   535
        val results = map_filter (fn (t, NONE) => SOME t | _ => NONE) (ts ~~ errs);
wenzelm@25993
   536
        val len = length results;
wenzelm@24372
   537
      in
wenzelm@25476
   538
        if null results then cat_error (ambig_msg ()) (cat_lines (map_filter I errs))
wenzelm@25993
   539
        else if len = 1 then
wenzelm@25993
   540
          (if ambiguity > level then
wenzelm@24372
   541
            warning "Fortunately, only one parse tree is type correct.\n\
wenzelm@24372
   542
              \You may still want to disambiguate your grammar or your input."
wenzelm@24372
   543
          else (); hd results)
wenzelm@25993
   544
        else cat_error (ambig_msg ()) (cat_lines
wenzelm@25993
   545
          (("Ambiguous input, " ^ string_of_int len ^ " terms are type correct" ^
wenzelm@25993
   546
            (if len <= limit then "" else " (" ^ string_of_int limit ^ " displayed)") ^ ":") ::
haftmann@33957
   547
            map (Pretty.string_of_term pp) (take limit results)))
wenzelm@24372
   548
      end;
wenzelm@24372
   549
wenzelm@24372
   550
fun standard_parse_term pp check get_sort map_const map_free map_type map_sort
wenzelm@27786
   551
    ctxt is_logtype syn ty (syms, pos) =
wenzelm@27786
   552
  read ctxt is_logtype syn ty (syms, pos)
wenzelm@24372
   553
  |> map (TypeExt.decode_term get_sort map_const map_free map_type map_sort)
wenzelm@24372
   554
  |> disambig (Printer.pp_show_brackets pp) check;
wenzelm@22703
   555
wenzelm@22703
   556
wenzelm@237
   557
(* read types *)
clasohm@0
   558
wenzelm@27786
   559
fun standard_parse_typ ctxt syn get_sort map_sort (syms, pos) =
wenzelm@27786
   560
  (case read ctxt (K false) syn SynExt.typeT (syms, pos) of
wenzelm@22703
   561
    [t] => TypeExt.typ_of_term (get_sort (TypeExt.term_sorts map_sort t)) map_sort t
wenzelm@27786
   562
  | _ => error (ambiguity_msg pos));
wenzelm@144
   563
wenzelm@144
   564
wenzelm@8894
   565
(* read sorts *)
wenzelm@8894
   566
wenzelm@27786
   567
fun standard_parse_sort ctxt syn map_sort (syms, pos) =
wenzelm@27786
   568
  (case read ctxt (K false) syn TypeExt.sortT (syms, pos) of
wenzelm@22703
   569
    [t] => TypeExt.sort_of_term map_sort t
wenzelm@27786
   570
  | _ => error (ambiguity_msg pos));
wenzelm@8894
   571
wenzelm@8894
   572
wenzelm@18
   573
wenzelm@1158
   574
(** prepare translation rules **)
wenzelm@1158
   575
wenzelm@1158
   576
datatype 'a trrule =
wenzelm@3526
   577
  ParseRule of 'a * 'a |
wenzelm@3526
   578
  PrintRule of 'a * 'a |
wenzelm@3526
   579
  ParsePrintRule of 'a * 'a;
wenzelm@888
   580
wenzelm@4618
   581
fun map_trrule f (ParseRule (x, y)) = ParseRule (f x, f y)
wenzelm@4618
   582
  | map_trrule f (PrintRule (x, y)) = PrintRule (f x, f y)
wenzelm@4618
   583
  | map_trrule f (ParsePrintRule (x, y)) = ParsePrintRule (f x, f y);
wenzelm@1158
   584
skalberg@15531
   585
fun parse_rule (ParseRule pats) = SOME pats
skalberg@15531
   586
  | parse_rule (PrintRule _) = NONE
skalberg@15531
   587
  | parse_rule (ParsePrintRule pats) = SOME pats;
wenzelm@1158
   588
skalberg@15531
   589
fun print_rule (ParseRule _) = NONE
skalberg@15531
   590
  | print_rule (PrintRule pats) = SOME (swap pats)
skalberg@15531
   591
  | print_rule (ParsePrintRule pats) = SOME (swap pats);
wenzelm@1158
   592
wenzelm@1158
   593
wenzelm@35111
   594
fun is_const (Syntax ({consts, ...}, _)) c = member (op =) consts c;
wenzelm@35111
   595
wenzelm@19262
   596
local
wenzelm@19262
   597
wenzelm@1158
   598
fun check_rule (rule as (lhs, rhs)) =
wenzelm@5692
   599
  (case Ast.rule_error rule of
skalberg@15531
   600
    SOME msg =>
wenzelm@1158
   601
      error ("Error in syntax translation rule: " ^ msg ^ "\n" ^
wenzelm@5692
   602
        Ast.str_of_ast lhs ^ "  ->  " ^ Ast.str_of_ast rhs)
skalberg@15531
   603
  | NONE => rule);
wenzelm@888
   604
wenzelm@21772
   605
fun read_pattern ctxt is_logtype syn (root, str) =
wenzelm@18
   606
  let
wenzelm@5692
   607
    fun constify (ast as Ast.Constant _) = ast
wenzelm@5692
   608
      | constify (ast as Ast.Variable x) =
wenzelm@35111
   609
          if is_const syn x orelse Long_Name.is_qualified x then Ast.Constant x
wenzelm@3830
   610
          else ast
wenzelm@5692
   611
      | constify (Ast.Appl asts) = Ast.Appl (map constify asts);
wenzelm@27786
   612
wenzelm@27786
   613
    val (syms, pos) = read_token str;
wenzelm@18
   614
  in
wenzelm@27786
   615
    (case read_asts ctxt is_logtype syn true root (syms, pos) of
wenzelm@888
   616
      [ast] => constify ast
wenzelm@27786
   617
    | _ => error (ambiguity_msg pos))
wenzelm@27786
   618
  end;
clasohm@0
   619
wenzelm@1158
   620
fun prep_rules rd_pat raw_rules =
wenzelm@4618
   621
  let val rules = map (map_trrule rd_pat) raw_rules in
wenzelm@19482
   622
    (map check_rule (map_filter parse_rule rules),
wenzelm@19482
   623
      map check_rule (map_filter print_rule rules))
wenzelm@1158
   624
  end
wenzelm@18
   625
wenzelm@19262
   626
in
wenzelm@19262
   627
wenzelm@19262
   628
val cert_rules = prep_rules I;
wenzelm@19262
   629
wenzelm@21772
   630
fun read_rules ctxt is_logtype syn =
wenzelm@21772
   631
  prep_rules (read_pattern ctxt is_logtype syn);
wenzelm@19262
   632
wenzelm@19262
   633
end;
wenzelm@19262
   634
wenzelm@18
   635
wenzelm@18
   636
wenzelm@24923
   637
(** unparse terms, typs, sorts **)
wenzelm@18
   638
wenzelm@24923
   639
local
wenzelm@24923
   640
wenzelm@32784
   641
fun unparse_t t_to_ast prt_t markup ctxt (Syntax (tabs, _)) curried t =
clasohm@0
   642
  let
wenzelm@2700
   643
    val {print_trtab, print_ruletab, print_ast_trtab, tokentrtab, prtabs, ...} = tabs;
wenzelm@21772
   644
    val ast = t_to_ast ctxt (lookup_tr' print_trtab) t;
clasohm@0
   645
  in
wenzelm@23631
   646
    Pretty.markup markup (prt_t ctxt curried prtabs (lookup_tr' print_ast_trtab)
wenzelm@24613
   647
      (lookup_tokentr tokentrtab (print_mode_value ()))
wenzelm@23631
   648
      (Ast.normalize_ast (Symtab.lookup_list print_ruletab) ast))
clasohm@0
   649
  end;
clasohm@0
   650
wenzelm@24923
   651
in
wenzelm@24923
   652
wenzelm@24923
   653
fun standard_unparse_term extern =
wenzelm@24923
   654
  unparse_t Printer.term_to_ast (Printer.pretty_term_ast extern) Markup.term;
wenzelm@24923
   655
wenzelm@24923
   656
fun standard_unparse_typ ctxt syn =
wenzelm@24923
   657
  unparse_t Printer.typ_to_ast Printer.pretty_typ_ast Markup.typ ctxt syn false;
wenzelm@24923
   658
wenzelm@24923
   659
fun standard_unparse_sort ctxt syn =
wenzelm@24923
   660
  unparse_t Printer.sort_to_ast Printer.pretty_typ_ast Markup.sort ctxt syn false;
wenzelm@24923
   661
wenzelm@24923
   662
end;
clasohm@0
   663
clasohm@0
   664
clasohm@0
   665
wenzelm@19262
   666
(** modify syntax **)
wenzelm@383
   667
wenzelm@25394
   668
fun ext_syntax f decls = update_syntax mode_default (f decls);
wenzelm@383
   669
wenzelm@35412
   670
val update_consts = ext_syntax SynExt.syn_ext_const_names;
wenzelm@35412
   671
val update_trfuns = ext_syntax SynExt.syn_ext_trfuns;
wenzelm@25394
   672
val update_advanced_trfuns = ext_syntax SynExt.syn_ext_advanced_trfuns;
wenzelm@35412
   673
val extend_tokentrfuns = ext_syntax SynExt.syn_ext_tokentrfuns;
wenzelm@5692
   674
wenzelm@35412
   675
fun update_type_gram add prmode decls =
wenzelm@35412
   676
  (if add then update_syntax else remove_syntax) prmode (Mixfix.syn_ext_types decls);
wenzelm@25387
   677
wenzelm@35412
   678
fun update_const_gram add is_logtype prmode decls =
wenzelm@35412
   679
  (if add then update_syntax else remove_syntax) prmode (Mixfix.syn_ext_consts is_logtype decls);
wenzelm@15755
   680
wenzelm@25394
   681
fun update_trrules ctxt is_logtype syn =
wenzelm@21772
   682
  ext_syntax SynExt.syn_ext_rules o read_rules ctxt is_logtype syn;
wenzelm@19262
   683
wenzelm@21772
   684
fun remove_trrules ctxt is_logtype syn =
wenzelm@24970
   685
  remove_syntax mode_default o SynExt.syn_ext_rules o read_rules ctxt is_logtype syn;
wenzelm@19262
   686
wenzelm@25394
   687
val update_trrules_i = ext_syntax SynExt.syn_ext_rules o cert_rules;
wenzelm@24970
   688
val remove_trrules_i = remove_syntax mode_default o SynExt.syn_ext_rules o cert_rules;
wenzelm@5692
   689
wenzelm@5692
   690
wenzelm@24263
   691
wenzelm@24768
   692
(** inner syntax operations **)
wenzelm@24263
   693
wenzelm@24768
   694
(* (un)parsing *)
wenzelm@24263
   695
wenzelm@28413
   696
fun parse_token markup str =
wenzelm@27822
   697
  let
wenzelm@27822
   698
    val (syms, pos) = read_token str;
wenzelm@28413
   699
    val _ = Position.report markup pos;
wenzelm@27822
   700
  in (syms, pos) end;
wenzelm@27822
   701
wenzelm@24263
   702
local
wenzelm@24768
   703
  type operations =
wenzelm@24768
   704
   {parse_sort: Proof.context -> string -> sort,
wenzelm@24768
   705
    parse_typ: Proof.context -> string -> typ,
wenzelm@24768
   706
    parse_term: Proof.context -> string -> term,
wenzelm@24768
   707
    parse_prop: Proof.context -> string -> term,
wenzelm@24768
   708
    unparse_sort: Proof.context -> sort -> Pretty.T,
wenzelm@24768
   709
    unparse_typ: Proof.context -> typ -> Pretty.T,
wenzelm@24768
   710
    unparse_term: Proof.context -> term -> Pretty.T};
wenzelm@24768
   711
wenzelm@32738
   712
  val operations = Unsynchronized.ref (NONE: operations option);
wenzelm@24768
   713
wenzelm@24768
   714
  fun operation which ctxt x =
wenzelm@24768
   715
    (case ! operations of
wenzelm@24768
   716
      NONE => error "Inner syntax operations not yet installed"
wenzelm@24768
   717
    | SOME ops => which ops ctxt x);
wenzelm@24263
   718
in
wenzelm@24263
   719
wenzelm@24768
   720
val parse_sort = operation #parse_sort;
wenzelm@24768
   721
val parse_typ = operation #parse_typ;
wenzelm@24768
   722
val parse_term = operation #parse_term;
wenzelm@24768
   723
val parse_prop = operation #parse_prop;
wenzelm@24768
   724
val unparse_sort = operation #unparse_sort;
wenzelm@24768
   725
val unparse_typ = operation #unparse_typ;
wenzelm@24768
   726
val unparse_term = operation #unparse_term;
wenzelm@24768
   727
wenzelm@24768
   728
fun install_operations ops = CRITICAL (fn () =>
wenzelm@24768
   729
  if is_some (! operations) then error "Inner syntax operations already installed"
wenzelm@24768
   730
  else operations := SOME ops);
wenzelm@24768
   731
wenzelm@24263
   732
end;
wenzelm@24263
   733
wenzelm@24263
   734
wenzelm@24768
   735
(* context-sensitive (un)checking *)
wenzelm@24263
   736
wenzelm@24488
   737
local
wenzelm@24488
   738
wenzelm@24768
   739
type key = int * bool;
wenzelm@25060
   740
type 'a check = 'a list -> Proof.context -> ('a list * Proof.context) option;
wenzelm@24768
   741
wenzelm@33519
   742
structure Checks = Generic_Data
wenzelm@24263
   743
(
wenzelm@24488
   744
  type T =
wenzelm@24768
   745
    ((key * ((string * typ check) * stamp) list) list *
wenzelm@24768
   746
     (key * ((string * term check) * stamp) list) list);
wenzelm@24488
   747
  val empty = ([], []);
wenzelm@24263
   748
  val extend = I;
wenzelm@33519
   749
  fun merge ((typ_checks1, term_checks1), (typ_checks2, term_checks2)) : T =
wenzelm@24768
   750
    (AList.join (op =) (K (Library.merge (eq_snd (op =)))) (typ_checks1, typ_checks2),
wenzelm@24768
   751
     AList.join (op =) (K (Library.merge (eq_snd (op =)))) (term_checks1, term_checks2));
wenzelm@24263
   752
);
wenzelm@24263
   753
wenzelm@24768
   754
fun gen_add which (key: key) name f =
wenzelm@24768
   755
  Checks.map (which (AList.map_default op = (key, []) (cons ((name, f), stamp ()))));
wenzelm@24768
   756
wenzelm@25060
   757
fun check_stage fs = perhaps_loop (perhaps_apply (map uncurry fs));
wenzelm@25060
   758
wenzelm@25060
   759
fun gen_check which uncheck ctxt0 xs0 =
wenzelm@24263
   760
  let
wenzelm@24768
   761
    val funs = which (Checks.get (Context.Proof ctxt0))
wenzelm@24768
   762
      |> map_filter (fn ((i, u), fs) => if uncheck = u then SOME (i, map (snd o fst) fs) else NONE)
wenzelm@25060
   763
      |> Library.sort (int_ord o pairself fst) |> map snd
wenzelm@25060
   764
      |> not uncheck ? map rev;
wenzelm@25060
   765
    val check_all = perhaps_apply (map check_stage funs);
wenzelm@25060
   766
  in #1 (perhaps check_all (xs0, ctxt0)) end;
wenzelm@24768
   767
wenzelm@24768
   768
fun map_sort f S =
wenzelm@24768
   769
  (case f (TFree ("", S)) of
wenzelm@24768
   770
    TFree ("", S') => S'
wenzelm@24923
   771
  | _ => raise TYPE ("map_sort", [TFree ("", S)], []));
wenzelm@24488
   772
wenzelm@24488
   773
in
wenzelm@24263
   774
wenzelm@24768
   775
fun print_checks ctxt =
wenzelm@24768
   776
  let
wenzelm@24768
   777
    fun split_checks checks =
wenzelm@24768
   778
      List.partition (fn ((_, un), _) => not un) checks
wenzelm@24768
   779
      |> pairself (map (fn ((i, _), fs) => (i, map (fst o fst) fs))
wenzelm@24768
   780
          #> sort (int_ord o pairself fst));
wenzelm@24768
   781
    fun pretty_checks kind checks =
wenzelm@24768
   782
      checks |> map (fn (i, names) => Pretty.block
wenzelm@24768
   783
        [Pretty.str (kind ^ " (stage " ^ signed_string_of_int i ^ "):"),
wenzelm@24768
   784
          Pretty.brk 1, Pretty.strs names]);
wenzelm@24768
   785
wenzelm@24768
   786
    val (typs, terms) = Checks.get (Context.Proof ctxt);
wenzelm@24768
   787
    val (typ_checks, typ_unchecks) = split_checks typs;
wenzelm@24768
   788
    val (term_checks, term_unchecks) = split_checks terms;
wenzelm@24768
   789
  in
wenzelm@24768
   790
    pretty_checks "typ_checks" typ_checks @
wenzelm@24768
   791
    pretty_checks "term_checks" term_checks @
wenzelm@24768
   792
    pretty_checks "typ_unchecks" typ_unchecks @
wenzelm@24768
   793
    pretty_checks "term_unchecks" term_unchecks
wenzelm@24768
   794
  end |> Pretty.chunks |> Pretty.writeln;
wenzelm@24768
   795
wenzelm@24768
   796
fun add_typ_check stage = gen_add apfst (stage, false);
wenzelm@24768
   797
fun add_term_check stage = gen_add apsnd (stage, false);
wenzelm@24768
   798
fun add_typ_uncheck stage = gen_add apfst (stage, true);
wenzelm@24768
   799
fun add_term_uncheck stage = gen_add apsnd (stage, true);
wenzelm@24768
   800
wenzelm@25060
   801
val check_typs = gen_check fst false;
wenzelm@25060
   802
val check_terms = gen_check snd false;
wenzelm@27265
   803
fun check_props ctxt = map (TypeExt.type_constraint propT) #> check_terms ctxt;
wenzelm@24488
   804
wenzelm@24512
   805
val check_typ = singleton o check_typs;
wenzelm@24512
   806
val check_term = singleton o check_terms;
wenzelm@24512
   807
val check_prop = singleton o check_props;
wenzelm@24768
   808
val check_sort = map_sort o check_typ;
wenzelm@24263
   809
wenzelm@25060
   810
val uncheck_typs = gen_check fst true;
wenzelm@25060
   811
val uncheck_terms = gen_check snd true;
wenzelm@24768
   812
val uncheck_sort = map_sort o singleton o uncheck_typs;
wenzelm@24488
   813
wenzelm@24488
   814
end;
wenzelm@24488
   815
wenzelm@24263
   816
wenzelm@24923
   817
(* derived operations for classrel and arity *)
wenzelm@24923
   818
wenzelm@24923
   819
val uncheck_classrel = map o singleton o uncheck_sort;
wenzelm@24923
   820
wenzelm@24923
   821
fun unparse_classrel ctxt cs = Pretty.block (flat
wenzelm@24923
   822
  (separate [Pretty.str " <", Pretty.brk 1] (map (single o unparse_sort ctxt o single) cs)));
wenzelm@24923
   823
wenzelm@24923
   824
fun uncheck_arity ctxt (a, Ss, S) =
wenzelm@24923
   825
  let
wenzelm@24923
   826
    val T = Type (a, replicate (length Ss) dummyT);
wenzelm@24923
   827
    val a' =
wenzelm@24923
   828
      (case singleton (uncheck_typs ctxt) T of
wenzelm@24923
   829
        Type (a', _) => a'
wenzelm@24923
   830
      | T => raise TYPE ("uncheck_arity", [T], []));
wenzelm@24923
   831
    val Ss' = map (uncheck_sort ctxt) Ss;
wenzelm@24923
   832
    val S' = uncheck_sort ctxt S;
wenzelm@24923
   833
  in (a', Ss', S') end;
wenzelm@24923
   834
wenzelm@24923
   835
fun unparse_arity ctxt (a, Ss, S) =
wenzelm@24923
   836
  let
wenzelm@25043
   837
    val prtT = unparse_typ ctxt (Type (a, []));
wenzelm@24923
   838
    val dom =
wenzelm@24923
   839
      if null Ss then []
wenzelm@24923
   840
      else [Pretty.list "(" ")" (map (unparse_sort ctxt) Ss), Pretty.brk 1];
wenzelm@25043
   841
  in Pretty.block ([prtT, Pretty.str " ::", Pretty.brk 1] @ dom @ [unparse_sort ctxt S]) end;
wenzelm@24923
   842
wenzelm@24923
   843
wenzelm@24923
   844
(* read = parse + check *)
wenzelm@24263
   845
wenzelm@24263
   846
fun read_sort ctxt = parse_sort ctxt #> check_sort ctxt;
wenzelm@24263
   847
fun read_typ ctxt = parse_typ ctxt #> singleton (check_typs ctxt);
wenzelm@24263
   848
wenzelm@24263
   849
fun read_terms ctxt = map (parse_term ctxt) #> check_terms ctxt;
wenzelm@24263
   850
fun read_props ctxt = map (parse_prop ctxt) #> check_props ctxt;
wenzelm@24263
   851
wenzelm@24263
   852
val read_term = singleton o read_terms;
wenzelm@24263
   853
val read_prop = singleton o read_props;
wenzelm@24263
   854
wenzelm@24709
   855
val read_sort_global = read_sort o ProofContext.init;
wenzelm@24709
   856
val read_typ_global = read_typ o ProofContext.init;
wenzelm@24709
   857
val read_term_global = read_term o ProofContext.init;
wenzelm@24709
   858
val read_prop_global = read_prop o ProofContext.init;
wenzelm@24278
   859
wenzelm@24263
   860
wenzelm@24923
   861
(* pretty = uncheck + unparse *)
wenzelm@24923
   862
wenzelm@26951
   863
fun pretty_term ctxt = singleton (uncheck_terms ctxt) #> unparse_term ctxt;
wenzelm@26951
   864
fun pretty_typ ctxt = singleton (uncheck_typs ctxt) #> unparse_typ ctxt;
wenzelm@24923
   865
fun pretty_sort ctxt = uncheck_sort ctxt #> unparse_sort ctxt;
wenzelm@24923
   866
fun pretty_classrel ctxt = uncheck_classrel ctxt #> unparse_classrel ctxt;
wenzelm@24923
   867
fun pretty_arity ctxt = uncheck_arity ctxt #> unparse_arity ctxt;
wenzelm@24923
   868
wenzelm@26951
   869
val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@26951
   870
val string_of_typ = Pretty.string_of oo pretty_typ;
wenzelm@24923
   871
val string_of_sort = Pretty.string_of oo pretty_sort;
wenzelm@24923
   872
val string_of_classrel = Pretty.string_of oo pretty_classrel;
wenzelm@24923
   873
val string_of_arity = Pretty.string_of oo pretty_arity;
wenzelm@26951
   874
wenzelm@26951
   875
wenzelm@26951
   876
(* global pretty printing *)
wenzelm@26951
   877
wenzelm@33519
   878
structure PrettyGlobal = Proof_Data(type T = bool fun init _ = false);
wenzelm@26951
   879
val is_pretty_global = PrettyGlobal.get;
wenzelm@26951
   880
val set_pretty_global = PrettyGlobal.put;
wenzelm@26951
   881
val init_pretty_global = set_pretty_global true o ProofContext.init;
wenzelm@24923
   882
wenzelm@26951
   883
val pretty_term_global = pretty_term o init_pretty_global;
wenzelm@26951
   884
val pretty_typ_global = pretty_typ o init_pretty_global;
wenzelm@26951
   885
val pretty_sort_global = pretty_sort o init_pretty_global;
wenzelm@26951
   886
wenzelm@26951
   887
val string_of_term_global = string_of_term o init_pretty_global;
wenzelm@26951
   888
val string_of_typ_global = string_of_typ o init_pretty_global;
wenzelm@26951
   889
val string_of_sort_global = string_of_sort o init_pretty_global;
wenzelm@26951
   890
wenzelm@26951
   891
wenzelm@26951
   892
(* pp operations -- deferred evaluation *)
wenzelm@26951
   893
wenzelm@24970
   894
fun pp ctxt = Pretty.pp
wenzelm@24970
   895
 (fn x => pretty_term ctxt x,
wenzelm@24970
   896
  fn x => pretty_typ ctxt x,
wenzelm@24970
   897
  fn x => pretty_sort ctxt x,
wenzelm@24970
   898
  fn x => pretty_classrel ctxt x,
wenzelm@24970
   899
  fn x => pretty_arity ctxt x);
wenzelm@24923
   900
wenzelm@26951
   901
fun pp_global thy = Pretty.pp
wenzelm@26951
   902
 (fn x => pretty_term_global thy x,
wenzelm@26951
   903
  fn x => pretty_typ_global thy x,
wenzelm@26951
   904
  fn x => pretty_sort_global thy x,
wenzelm@26951
   905
  fn x => pretty_classrel (init_pretty_global thy) x,
wenzelm@26951
   906
  fn x => pretty_arity (init_pretty_global thy) x);
wenzelm@26951
   907
haftmann@26678
   908
wenzelm@15833
   909
(*export parts of internal Syntax structures*)
wenzelm@15833
   910
open Lexicon SynExt Ast Parser TypeExt SynTrans Mixfix Printer;
wenzelm@2366
   911
clasohm@0
   912
end;
wenzelm@5692
   913
wenzelm@35130
   914
structure Basic_Syntax: BASIC_SYNTAX = Syntax;
wenzelm@35130
   915
open Basic_Syntax;
wenzelm@23923
   916
wenzelm@26684
   917
forget_structure "Ast";
wenzelm@26684
   918
forget_structure "SynExt";
wenzelm@26684
   919
forget_structure "Parser";
wenzelm@26684
   920
forget_structure "TypeExt";
wenzelm@26684
   921
forget_structure "SynTrans";
wenzelm@26684
   922
forget_structure "Mixfix";
wenzelm@26684
   923
forget_structure "Printer";