src/Pure/Syntax/syntax.ML
author wenzelm
Fri Dec 13 17:34:32 1996 +0100 (1996-12-13)
changeset 2383 4127499d9b52
parent 2366 a163d2be1bb5
child 2504 f5e2288c2697
permissions -rw-r--r--
added extend_trfunsT;
removed test: prtabs_of;
removed chartrans;
wenzelm@18
     1
(*  Title:      Pure/Syntax/syntax.ML
clasohm@0
     2
    ID:         $Id$
clasohm@0
     3
    Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@18
     4
wenzelm@18
     5
Root of Isabelle's syntax module.
clasohm@0
     6
*)
clasohm@0
     7
wenzelm@556
     8
infix |-> <-| <->;
wenzelm@556
     9
wenzelm@260
    10
signature BASIC_SYNTAX =
wenzelm@2383
    11
sig
wenzelm@260
    12
  include AST0
wenzelm@556
    13
  include SYN_TRANS0
wenzelm@556
    14
  include MIXFIX0
wenzelm@260
    15
  include PRINTER0
wenzelm@2383
    16
end;
wenzelm@260
    17
clasohm@0
    18
signature SYNTAX =
wenzelm@2383
    19
sig
wenzelm@260
    20
  include AST1
clasohm@0
    21
  include LEXICON0
wenzelm@237
    22
  include SYN_EXT0
clasohm@0
    23
  include TYPE_EXT0
wenzelm@556
    24
  include SYN_TRANS1
wenzelm@556
    25
  include MIXFIX1
clasohm@0
    26
  include PRINTER0
wenzelm@1158
    27
  datatype 'a trrule =
paulson@2287
    28
    |-> of 'a * 'a |
paulson@2287
    29
    <-| of 'a * 'a |
paulson@2287
    30
    <-> of 'a * 'a
wenzelm@556
    31
  type syntax
wenzelm@556
    32
  val extend_log_types: syntax -> string list -> syntax
wenzelm@556
    33
  val extend_type_gram: syntax -> (string * int * mixfix) list -> syntax
wenzelm@2366
    34
  val extend_const_gram: syntax -> string * bool -> (string * typ * mixfix) list -> syntax
wenzelm@556
    35
  val extend_consts: syntax -> string list -> syntax
wenzelm@556
    36
  val extend_trfuns: syntax ->
wenzelm@556
    37
    (string * (ast list -> ast)) list *
wenzelm@556
    38
    (string * (term list -> term)) list *
wenzelm@556
    39
    (string * (term list -> term)) list *
wenzelm@556
    40
    (string * (ast list -> ast)) list -> syntax
wenzelm@2383
    41
  val extend_trfunsT: syntax -> (string * (typ -> term list -> term)) list -> syntax
wenzelm@1158
    42
  val extend_trrules: syntax -> (string * string) trrule list -> syntax
wenzelm@1158
    43
  val extend_trrules_i: syntax -> ast trrule list -> syntax
wenzelm@556
    44
  val merge_syntaxes: syntax -> syntax -> syntax
wenzelm@556
    45
  val type_syn: syntax
clasohm@764
    46
  val pure_syn: syntax
wenzelm@556
    47
  val print_gram: syntax -> unit
wenzelm@556
    48
  val print_trans: syntax -> unit
wenzelm@556
    49
  val print_syntax: syntax -> unit
wenzelm@556
    50
  val test_read: syntax -> string -> string -> unit
clasohm@624
    51
  val read: syntax -> typ -> string -> term list
wenzelm@556
    52
  val read_typ: syntax -> (indexname -> sort) -> string -> typ
wenzelm@556
    53
  val simple_read_typ: string -> typ
clasohm@922
    54
  val pretty_term: bool -> syntax -> term -> Pretty.T
wenzelm@556
    55
  val pretty_typ: syntax -> typ -> Pretty.T
clasohm@922
    56
  val string_of_term: bool -> syntax -> term -> string
wenzelm@556
    57
  val string_of_typ: syntax -> typ -> string
wenzelm@556
    58
  val simple_string_of_typ: typ -> string
wenzelm@556
    59
  val simple_pprint_typ: typ -> pprint_args -> unit
clasohm@882
    60
  val ambiguity_level: int ref
wenzelm@2383
    61
end;
clasohm@0
    62
paulson@1511
    63
structure Syntax : SYNTAX =
clasohm@0
    64
struct
clasohm@0
    65
paulson@1511
    66
open Lexicon SynExt Ast Parser TypeExt SynTrans Mixfix Printer;
wenzelm@237
    67
wenzelm@237
    68
wenzelm@237
    69
(** tables of translation functions **)
wenzelm@237
    70
wenzelm@237
    71
(*the ref serves as unique id*)
wenzelm@2383
    72
(*does not subsume typed print translations*)
wenzelm@237
    73
type 'a trtab = (('a list -> 'a) * unit ref) Symtab.table;
wenzelm@237
    74
wenzelm@383
    75
val dest_trtab = Symtab.dest;
wenzelm@237
    76
wenzelm@237
    77
fun lookup_trtab tab c =
wenzelm@237
    78
  apsome fst (Symtab.lookup (tab, c));
clasohm@0
    79
clasohm@0
    80
wenzelm@237
    81
(* empty, extend, merge trtabs *)
wenzelm@237
    82
wenzelm@383
    83
fun err_dup_trfuns name cs =
wenzelm@383
    84
  error ("More than one " ^ name ^ " for " ^ commas_quote cs);
wenzelm@237
    85
wenzelm@237
    86
val empty_trtab = Symtab.null;
wenzelm@237
    87
wenzelm@237
    88
fun extend_trtab tab trfuns name =
wenzelm@383
    89
  Symtab.extend_new (tab, map (fn (c, f) => (c, (f, ref ()))) trfuns)
wenzelm@383
    90
    handle Symtab.DUPS cs => err_dup_trfuns name cs;
wenzelm@237
    91
wenzelm@237
    92
fun merge_trtabs tab1 tab2 name =
wenzelm@237
    93
  Symtab.merge eq_snd (tab1, tab2)
wenzelm@383
    94
    handle Symtab.DUPS cs => err_dup_trfuns name cs;
wenzelm@237
    95
wenzelm@237
    96
wenzelm@237
    97
wenzelm@237
    98
(** tables of translation rules **)
wenzelm@237
    99
wenzelm@237
   100
type ruletab = (ast * ast) list Symtab.table;
wenzelm@237
   101
wenzelm@383
   102
fun dest_ruletab tab = flat (map snd (Symtab.dest tab));
wenzelm@237
   103
wenzelm@237
   104
wenzelm@237
   105
(* lookup_ruletab *)
wenzelm@237
   106
wenzelm@237
   107
fun lookup_ruletab tab =
wenzelm@237
   108
  if Symtab.is_null tab then None
wenzelm@237
   109
  else Some (fn a => Symtab.lookup_multi (tab, a));
wenzelm@237
   110
wenzelm@237
   111
wenzelm@237
   112
(* empty, extend, merge ruletabs *)
wenzelm@237
   113
wenzelm@237
   114
val empty_ruletab = Symtab.null;
wenzelm@237
   115
wenzelm@237
   116
fun extend_ruletab tab rules =
wenzelm@237
   117
  generic_extend (op =) Symtab.dest_multi Symtab.make_multi tab
wenzelm@237
   118
    (map (fn r => (head_of_rule r, r)) (distinct rules));
wenzelm@237
   119
wenzelm@237
   120
fun merge_ruletabs tab1 tab2 =
wenzelm@237
   121
  generic_merge (op =) Symtab.dest_multi Symtab.make_multi tab1 tab2;
clasohm@0
   122
clasohm@0
   123
clasohm@0
   124
clasohm@0
   125
(** datatype syntax **)
clasohm@0
   126
wenzelm@237
   127
datatype syntax =
wenzelm@237
   128
  Syntax of {
wenzelm@18
   129
    lexicon: lexicon,
clasohm@764
   130
    logtypes: string list,
wenzelm@18
   131
    gram: gram,
wenzelm@18
   132
    consts: string list,
wenzelm@237
   133
    parse_ast_trtab: ast trtab,
wenzelm@237
   134
    parse_ruletab: ruletab,
wenzelm@237
   135
    parse_trtab: term trtab,
wenzelm@2383
   136
    print_trtab: ((typ -> term list -> term) * unit ref) Symtab.table,
wenzelm@237
   137
    print_ruletab: ruletab,
wenzelm@237
   138
    print_ast_trtab: ast trtab,
wenzelm@2202
   139
    prtabs: prtabs};
clasohm@0
   140
wenzelm@18
   141
wenzelm@237
   142
(* empty_syntax *)
wenzelm@18
   143
wenzelm@237
   144
val empty_syntax =
wenzelm@237
   145
  Syntax {
wenzelm@167
   146
    lexicon = empty_lexicon,
clasohm@764
   147
    logtypes = [],
wenzelm@171
   148
    gram = empty_gram,
wenzelm@167
   149
    consts = [],
wenzelm@237
   150
    parse_ast_trtab = empty_trtab,
wenzelm@237
   151
    parse_ruletab = empty_ruletab,
wenzelm@237
   152
    parse_trtab = empty_trtab,
wenzelm@237
   153
    print_trtab = empty_trtab,
wenzelm@237
   154
    print_ruletab = empty_ruletab,
wenzelm@237
   155
    print_ast_trtab = empty_trtab,
wenzelm@2202
   156
    prtabs = empty_prtabs};
wenzelm@167
   157
wenzelm@167
   158
wenzelm@237
   159
(* extend_syntax *)
wenzelm@167
   160
wenzelm@2366
   161
fun extend_syntax (mode, inout) (Syntax tabs) syn_ext =
wenzelm@167
   162
  let
wenzelm@2383
   163
    val {lexicon, logtypes = logtypes1, gram, consts = consts1,
wenzelm@2366
   164
      parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@2366
   165
      print_ast_trtab, prtabs} = tabs;
clasohm@764
   166
    val SynExt {logtypes = logtypes2, xprods, consts = consts2, parse_ast_translation,
wenzelm@167
   167
      parse_rules, parse_translation, print_translation, print_rules,
wenzelm@237
   168
      print_ast_translation} = syn_ext;
wenzelm@167
   169
  in
wenzelm@237
   170
    Syntax {
wenzelm@2366
   171
      lexicon = if inout then extend_lexicon lexicon (delims_of xprods) else lexicon,
clasohm@764
   172
      logtypes = extend_list logtypes1 logtypes2,
wenzelm@2366
   173
      gram = if inout then extend_gram gram xprods else gram,
wenzelm@167
   174
      consts = consts2 union consts1,
wenzelm@167
   175
      parse_ast_trtab =
wenzelm@167
   176
        extend_trtab parse_ast_trtab parse_ast_translation "parse ast translation",
wenzelm@167
   177
      parse_ruletab = extend_ruletab parse_ruletab parse_rules,
wenzelm@167
   178
      parse_trtab = extend_trtab parse_trtab parse_translation "parse translation",
wenzelm@167
   179
      print_trtab = extend_trtab print_trtab print_translation "print translation",
wenzelm@167
   180
      print_ruletab = extend_ruletab print_ruletab print_rules,
wenzelm@237
   181
      print_ast_trtab =
wenzelm@237
   182
        extend_trtab print_ast_trtab print_ast_translation "print ast translation",
wenzelm@2383
   183
      prtabs = extend_prtabs prtabs mode xprods}
wenzelm@18
   184
  end;
wenzelm@18
   185
wenzelm@18
   186
wenzelm@237
   187
(* merge_syntaxes *)
clasohm@0
   188
wenzelm@237
   189
fun merge_syntaxes (Syntax tabs1) (Syntax tabs2) =
clasohm@0
   190
  let
wenzelm@2383
   191
    val {lexicon = lexicon1, logtypes = logtypes1, gram = gram1,
wenzelm@2366
   192
      consts = consts1, parse_ast_trtab = parse_ast_trtab1, parse_ruletab = parse_ruletab1,
wenzelm@237
   193
      parse_trtab = parse_trtab1, print_trtab = print_trtab1,
wenzelm@237
   194
      print_ruletab = print_ruletab1, print_ast_trtab = print_ast_trtab1,
wenzelm@2202
   195
      prtabs = prtabs1} = tabs1;
wenzelm@237
   196
wenzelm@2383
   197
    val {lexicon = lexicon2, logtypes = logtypes2, gram = gram2,
wenzelm@2366
   198
      consts = consts2, parse_ast_trtab = parse_ast_trtab2, parse_ruletab = parse_ruletab2,
wenzelm@237
   199
      parse_trtab = parse_trtab2, print_trtab = print_trtab2,
wenzelm@237
   200
      print_ruletab = print_ruletab2, print_ast_trtab = print_ast_trtab2,
wenzelm@2202
   201
      prtabs = prtabs2} = tabs2;
clasohm@0
   202
  in
wenzelm@237
   203
    Syntax {
wenzelm@237
   204
      lexicon = merge_lexicons lexicon1 lexicon2,
clasohm@764
   205
      logtypes = merge_lists logtypes1 logtypes2,
wenzelm@237
   206
      gram = merge_grams gram1 gram2,
wenzelm@237
   207
      consts = merge_lists consts1 consts2,
wenzelm@237
   208
      parse_ast_trtab =
wenzelm@237
   209
        merge_trtabs parse_ast_trtab1 parse_ast_trtab2 "parse ast translation",
wenzelm@237
   210
      parse_ruletab = merge_ruletabs parse_ruletab1 parse_ruletab2,
wenzelm@237
   211
      parse_trtab = merge_trtabs parse_trtab1 parse_trtab2 "parse translation",
wenzelm@237
   212
      print_trtab = merge_trtabs print_trtab1 print_trtab2 "print translation",
wenzelm@237
   213
      print_ruletab = merge_ruletabs print_ruletab1 print_ruletab2,
wenzelm@237
   214
      print_ast_trtab =
wenzelm@237
   215
        merge_trtabs print_ast_trtab1 print_ast_trtab2 "print ast translation",
wenzelm@2383
   216
      prtabs = merge_prtabs prtabs1 prtabs2}
clasohm@0
   217
  end;
clasohm@0
   218
clasohm@0
   219
wenzelm@260
   220
(* type_syn *)
wenzelm@260
   221
wenzelm@2366
   222
val type_syn = extend_syntax ("", true) empty_syntax type_ext;
wenzelm@2366
   223
val pure_syn = extend_syntax ("", true) type_syn pure_ext;
wenzelm@260
   224
clasohm@0
   225
wenzelm@237
   226
(** inspect syntax **)
clasohm@0
   227
wenzelm@260
   228
fun pretty_strs_qs name strs =
wenzelm@260
   229
  Pretty.strs (name :: map quote (sort_strings strs));
clasohm@0
   230
wenzelm@18
   231
wenzelm@18
   232
(* print_gram *)
clasohm@0
   233
wenzelm@237
   234
fun print_gram (Syntax tabs) =
clasohm@0
   235
  let
wenzelm@2383
   236
    val {lexicon, logtypes, gram, prtabs, ...} = tabs;
clasohm@0
   237
  in
wenzelm@260
   238
    Pretty.writeln (pretty_strs_qs "lexicon:" (dest_lexicon lexicon));
clasohm@764
   239
    Pretty.writeln (Pretty.strs ("logtypes:" :: logtypes));
wenzelm@2202
   240
    Pretty.writeln (Pretty.big_list "prods:" (pretty_gram gram));
wenzelm@2383
   241
    Pretty.writeln (pretty_strs_qs "print modes:" (prmodes_of prtabs))
clasohm@0
   242
  end;
clasohm@0
   243
clasohm@0
   244
wenzelm@18
   245
(* print_trans *)
clasohm@0
   246
wenzelm@237
   247
fun print_trans (Syntax tabs) =
clasohm@0
   248
  let
wenzelm@260
   249
    fun pretty_trtab name tab =
wenzelm@260
   250
      pretty_strs_qs name (map fst (dest_trtab tab));
clasohm@0
   251
wenzelm@260
   252
    fun pretty_ruletab name tab =
wenzelm@260
   253
      Pretty.big_list name (map pretty_rule (dest_ruletab tab));
clasohm@0
   254
wenzelm@237
   255
    val {consts, parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab,
wenzelm@237
   256
      print_ruletab, print_ast_trtab, ...} = tabs;
clasohm@0
   257
  in
wenzelm@260
   258
    Pretty.writeln (pretty_strs_qs "consts:" consts);
wenzelm@260
   259
    Pretty.writeln (pretty_trtab "parse_ast_translation:" parse_ast_trtab);
wenzelm@260
   260
    Pretty.writeln (pretty_ruletab "parse_rules:" parse_ruletab);
wenzelm@260
   261
    Pretty.writeln (pretty_trtab "parse_translation:" parse_trtab);
wenzelm@260
   262
    Pretty.writeln (pretty_trtab "print_translation:" print_trtab);
wenzelm@260
   263
    Pretty.writeln (pretty_ruletab "print_rules:" print_ruletab);
wenzelm@260
   264
    Pretty.writeln (pretty_trtab "print_ast_translation:" print_ast_trtab)
clasohm@0
   265
  end;
clasohm@0
   266
clasohm@0
   267
clasohm@0
   268
(* print_syntax *)
clasohm@0
   269
wenzelm@237
   270
fun print_syntax syn = (print_gram syn; print_trans syn);
clasohm@0
   271
clasohm@0
   272
clasohm@0
   273
wenzelm@237
   274
(** read **)
wenzelm@18
   275
wenzelm@237
   276
(* test_read *)
wenzelm@18
   277
wenzelm@237
   278
fun test_read (Syntax tabs) root str =
wenzelm@18
   279
  let
wenzelm@237
   280
    val {lexicon, gram, parse_ast_trtab, parse_ruletab, ...} = tabs;
wenzelm@18
   281
wenzelm@2366
   282
    val chars = SymbolFont.read_charnames (explode str);
wenzelm@2366
   283
    val toks = tokenize lexicon false chars;
clasohm@624
   284
    val _ = writeln ("tokens: " ^ space_implode " " (map display_token toks));
wenzelm@18
   285
wenzelm@383
   286
    fun show_pt pt =
wenzelm@383
   287
      let
wenzelm@383
   288
        val raw_ast = pt_to_ast (K None) pt;
wenzelm@383
   289
        val _ = writeln ("raw: " ^ str_of_ast raw_ast);
wenzelm@383
   290
        val pre_ast = pt_to_ast (lookup_trtab parse_ast_trtab) pt;
wenzelm@383
   291
        val _ = normalize true true (lookup_ruletab parse_ruletab) pre_ast;
wenzelm@383
   292
      in () end;
wenzelm@383
   293
  in
wenzelm@383
   294
    seq show_pt (parse gram root toks)
wenzelm@383
   295
  end;
wenzelm@18
   296
wenzelm@18
   297
wenzelm@260
   298
(* read_ast *)
wenzelm@260
   299
clasohm@882
   300
val ambiguity_level = ref 1;
clasohm@882
   301
clasohm@865
   302
fun read_asts (Syntax tabs) xids root str =
wenzelm@260
   303
  let
clasohm@764
   304
    val {lexicon, gram, parse_ast_trtab, logtypes, ...} = tabs;
clasohm@764
   305
    val root' = if root mem logtypes then logic else root;
wenzelm@2366
   306
    val chars = SymbolFont.read_charnames (explode str);
wenzelm@2366
   307
    val pts = parse gram root' (tokenize lexicon xids chars);
clasohm@330
   308
clasohm@624
   309
    fun show_pt pt = writeln (str_of_ast (pt_to_ast (K None) pt));
wenzelm@260
   310
  in
wenzelm@888
   311
    if length pts > ! ambiguity_level then
berghofe@1580
   312
      (warning ("Ambiguous input " ^ quote str);
clasohm@882
   313
       writeln "produces the following parse trees:";
clasohm@882
   314
       seq show_pt pts)
clasohm@624
   315
    else ();
clasohm@624
   316
    map (pt_to_ast (lookup_trtab parse_ast_trtab)) pts
wenzelm@260
   317
  end;
wenzelm@260
   318
wenzelm@260
   319
wenzelm@237
   320
(* read *)
clasohm@0
   321
wenzelm@237
   322
fun read (syn as Syntax tabs) ty str =
clasohm@0
   323
  let
wenzelm@237
   324
    val {parse_ruletab, parse_trtab, ...} = tabs;
clasohm@865
   325
    val asts = read_asts syn false (typ_to_nonterm ty) str;
clasohm@0
   326
  in
clasohm@624
   327
    map (ast_to_term (lookup_trtab parse_trtab))
clasohm@624
   328
      (map (normalize_ast (lookup_ruletab parse_ruletab)) asts)
clasohm@0
   329
  end;
clasohm@0
   330
clasohm@0
   331
wenzelm@237
   332
(* read types *)
clasohm@0
   333
wenzelm@237
   334
fun read_typ syn def_sort str =
wenzelm@888
   335
  (case read syn typeT str of
wenzelm@888
   336
    [t] => typ_of_term (raw_term_sorts t) def_sort t
wenzelm@888
   337
  | _ => sys_error "read_typ: ambiguous type syntax");
wenzelm@144
   338
wenzelm@237
   339
fun simple_read_typ str = read_typ type_syn (K []) str;
wenzelm@144
   340
wenzelm@144
   341
wenzelm@18
   342
wenzelm@1158
   343
(** prepare translation rules **)
wenzelm@1158
   344
wenzelm@1158
   345
datatype 'a trrule =
wenzelm@888
   346
  op |-> of 'a * 'a |
wenzelm@888
   347
  op <-| of 'a * 'a |
wenzelm@888
   348
  op <-> of 'a * 'a;
wenzelm@888
   349
wenzelm@1158
   350
fun map_rule f (x |-> y) = (f x |-> f y)
wenzelm@1158
   351
  | map_rule f (x <-| y) = (f x <-| f y)
wenzelm@1158
   352
  | map_rule f (x <-> y) = (f x <-> f y);
wenzelm@1158
   353
wenzelm@1158
   354
fun right_rule (pat1 |-> pat2) = Some (pat1, pat2)
wenzelm@1158
   355
  | right_rule (pat1 <-| pat2) = None
wenzelm@1158
   356
  | right_rule (pat1 <-> pat2) = Some (pat1, pat2);
wenzelm@1158
   357
wenzelm@1158
   358
fun left_rule (pat1 |-> pat2) = None
wenzelm@1158
   359
  | left_rule (pat1 <-| pat2) = Some (pat2, pat1)
wenzelm@1158
   360
  | left_rule (pat1 <-> pat2) = Some (pat2, pat1);
wenzelm@1158
   361
wenzelm@1158
   362
wenzelm@1158
   363
fun check_rule (rule as (lhs, rhs)) =
wenzelm@1158
   364
  (case rule_error rule of
wenzelm@1158
   365
    Some msg =>
wenzelm@1158
   366
      error ("Error in syntax translation rule: " ^ msg ^ "\n" ^
wenzelm@1158
   367
        str_of_ast lhs ^ "  ->  " ^ str_of_ast rhs)
wenzelm@1158
   368
  | None => rule);
wenzelm@888
   369
wenzelm@888
   370
wenzelm@888
   371
fun read_pattern syn (root, str) =
wenzelm@18
   372
  let
wenzelm@237
   373
    val Syntax {consts, ...} = syn;
wenzelm@18
   374
wenzelm@888
   375
    fun constify (ast as Constant _) = ast
wenzelm@888
   376
      | constify (ast as Variable x) =
wenzelm@18
   377
          if x mem consts then Constant x else ast
wenzelm@888
   378
      | constify (Appl asts) = Appl (map constify asts);
wenzelm@18
   379
  in
wenzelm@888
   380
    (case read_asts syn true root str of
wenzelm@888
   381
      [ast] => constify ast
wenzelm@888
   382
    | _ => error ("Syntactically ambiguous input: " ^ quote str))
wenzelm@888
   383
  end handle ERROR =>
wenzelm@888
   384
    error ("The error(s) above occurred in translation pattern " ^
wenzelm@888
   385
      quote str);
clasohm@0
   386
wenzelm@556
   387
wenzelm@1158
   388
fun prep_rules rd_pat raw_rules =
wenzelm@1158
   389
  let val rules = map (map_rule rd_pat) raw_rules in
wenzelm@888
   390
    (map check_rule (mapfilter right_rule rules),
wenzelm@888
   391
      map check_rule (mapfilter left_rule rules))
wenzelm@1158
   392
  end
wenzelm@18
   393
wenzelm@18
   394
wenzelm@18
   395
wenzelm@18
   396
(** pretty terms or typs **)
wenzelm@18
   397
wenzelm@2202
   398
fun pretty_t t_to_ast prt_t curried (syn as Syntax tabs) t =
clasohm@0
   399
  let
wenzelm@2202
   400
    val {print_trtab, print_ruletab, print_ast_trtab, prtabs, ...} = tabs;
wenzelm@237
   401
    val ast = t_to_ast (lookup_trtab print_trtab) t;
clasohm@0
   402
  in
wenzelm@2202
   403
    prt_t curried prtabs (lookup_trtab print_ast_trtab)
wenzelm@237
   404
      (normalize_ast (lookup_ruletab print_ruletab) ast)
clasohm@0
   405
  end;
clasohm@0
   406
clasohm@0
   407
val pretty_term = pretty_t term_to_ast pretty_term_ast;
clasohm@922
   408
val pretty_typ = pretty_t typ_to_ast pretty_typ_ast false;
clasohm@0
   409
clasohm@922
   410
fun string_of_term curried syn t =
clasohm@922
   411
  Pretty.string_of (pretty_term curried syn t);
wenzelm@260
   412
fun string_of_typ syn ty = Pretty.string_of (pretty_typ syn ty);
clasohm@0
   413
wenzelm@260
   414
val simple_string_of_typ = string_of_typ type_syn;
wenzelm@260
   415
val simple_pprint_typ = Pretty.pprint o Pretty.quote o (pretty_typ type_syn);
clasohm@0
   416
clasohm@0
   417
clasohm@0
   418
wenzelm@383
   419
(** extend syntax (external interfaces) **)
wenzelm@383
   420
wenzelm@2202
   421
fun ext_syntax mk_syn_ext prmode (syn as Syntax {logtypes, ...}) decls =
wenzelm@2202
   422
  extend_syntax prmode syn (mk_syn_ext logtypes decls);
wenzelm@383
   423
wenzelm@167
   424
clasohm@764
   425
fun extend_log_types syn logtypes =
wenzelm@2366
   426
  extend_syntax ("", true) syn (syn_ext_logtypes logtypes);
wenzelm@383
   427
wenzelm@2366
   428
val extend_type_gram = ext_syntax syn_ext_types ("", true);
wenzelm@383
   429
wenzelm@2202
   430
fun extend_const_gram syn prmode = ext_syntax syn_ext_consts prmode syn;
wenzelm@383
   431
wenzelm@2366
   432
val extend_consts = ext_syntax syn_ext_const_names ("", true);
wenzelm@383
   433
wenzelm@2366
   434
val extend_trfuns = ext_syntax syn_ext_trfuns ("", true);
wenzelm@383
   435
wenzelm@2383
   436
val extend_trfunsT = ext_syntax syn_ext_trfunsT ("", true);
wenzelm@2383
   437
wenzelm@1158
   438
fun extend_trrules syn rules =
wenzelm@2366
   439
  ext_syntax syn_ext_rules ("", true) syn (prep_rules (read_pattern syn) rules);
wenzelm@1158
   440
wenzelm@1158
   441
fun extend_trrules_i syn rules =
wenzelm@2366
   442
  ext_syntax syn_ext_rules ("", true) syn (prep_rules I rules);
wenzelm@2366
   443
wenzelm@2366
   444
clasohm@0
   445
end;