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