src/Pure/Syntax/syntax.ML
author wenzelm
Wed Jul 06 10:41:50 2005 +0200 (2005-07-06)
changeset 16716 57fd954ee326
parent 16669 4748b1adad9c
child 17079 ce9663987126
permissions -rw-r--r--
tuned msg;
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@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@15755
    25
  val extend_trtab: string -> (string * ('a * stamp)) list ->
wenzelm@15755
    26
    ('a * stamp) Symtab.table -> ('a * stamp) Symtab.table
wenzelm@15755
    27
  val merge_trtabs: string -> ('a * stamp) Symtab.table -> ('a * stamp) Symtab.table ->
wenzelm@15755
    28
    ('a * stamp) Symtab.table
wenzelm@14648
    29
  val merge_tr'tabs: ('a * stamp) list Symtab.table -> ('a * stamp) list Symtab.table
wenzelm@14648
    30
    -> ('a * stamp) list Symtab.table
wenzelm@15755
    31
  val extend_tr'tab: (string * ('a * stamp)) list ->
wenzelm@15755
    32
    ('a * stamp) list Symtab.table -> ('a * stamp) list Symtab.table
wenzelm@1158
    33
  datatype 'a trrule =
wenzelm@3526
    34
    ParseRule of 'a * 'a |
wenzelm@3526
    35
    PrintRule of 'a * 'a |
wenzelm@3526
    36
    ParsePrintRule of 'a * 'a
wenzelm@556
    37
  type syntax
wenzelm@14687
    38
  val is_keyword: syntax -> string -> bool
wenzelm@15755
    39
  val default_mode: string * bool
wenzelm@12073
    40
  val extend_type_gram: (string * int * mixfix) list -> syntax -> syntax
wenzelm@14904
    41
  val extend_const_gram: (string -> bool) ->
wenzelm@14904
    42
    string * bool -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@12073
    43
  val extend_consts: string list -> syntax -> syntax
wenzelm@12073
    44
  val extend_trfuns:
wenzelm@15755
    45
    (string * ((ast list -> ast) * stamp)) list *
wenzelm@15755
    46
    (string * ((term list -> term) * stamp)) list *
wenzelm@15755
    47
    (string * ((bool -> typ -> term list -> term) * stamp)) list *
wenzelm@15755
    48
    (string * ((ast list -> ast) * stamp)) list -> syntax -> syntax
wenzelm@16613
    49
  val extend_advanced_trfuns:
wenzelm@16613
    50
    (string * ((theory -> ast list -> ast) * stamp)) list *
wenzelm@16613
    51
    (string * ((theory -> term list -> term) * stamp)) list *
wenzelm@16613
    52
    (string * ((theory -> bool -> typ -> term list -> term) * stamp)) list *
wenzelm@16613
    53
    (string * ((theory -> ast list -> ast) * stamp)) list -> syntax -> syntax
wenzelm@15755
    54
  val extend_tokentrfuns: (string * string * (string -> string * real)) list -> syntax -> syntax
wenzelm@12073
    55
  val extend_trrules_i: ast trrule list -> syntax -> syntax
wenzelm@16613
    56
  val extend_trrules: theory -> (string -> bool) -> syntax ->
wenzelm@14904
    57
    (string * string) trrule list -> syntax -> syntax
wenzelm@15755
    58
  val remove_const_gram: (string -> bool) ->
wenzelm@15755
    59
    string * bool -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@4618
    60
  val map_trrule: ('a -> 'b) -> 'a trrule -> 'b trrule
wenzelm@556
    61
  val merge_syntaxes: syntax -> syntax -> syntax
wenzelm@556
    62
  val type_syn: syntax
clasohm@764
    63
  val pure_syn: syntax
wenzelm@556
    64
  val print_gram: syntax -> unit
wenzelm@556
    65
  val print_trans: syntax -> unit
wenzelm@556
    66
  val print_syntax: syntax -> unit
wenzelm@16613
    67
  val read: theory -> (string -> bool) -> syntax -> typ -> string -> term list
wenzelm@16613
    68
  val read_typ: theory -> syntax -> ((indexname * sort) list -> indexname -> sort) ->
wenzelm@16613
    69
    (sort -> sort) -> string -> typ
wenzelm@16613
    70
  val read_sort: theory -> syntax -> string -> sort
wenzelm@16613
    71
  val pretty_term: theory -> syntax -> bool -> term -> Pretty.T
wenzelm@16613
    72
  val pretty_typ: theory -> syntax -> typ -> Pretty.T
wenzelm@16613
    73
  val pretty_sort: theory -> syntax -> sort -> Pretty.T
clasohm@882
    74
  val ambiguity_level: int ref
skalberg@14177
    75
  val ambiguity_is_error: bool ref
wenzelm@2383
    76
end;
clasohm@0
    77
wenzelm@12094
    78
structure Syntax: SYNTAX =
clasohm@0
    79
struct
clasohm@0
    80
wenzelm@237
    81
(** tables of translation functions **)
wenzelm@237
    82
wenzelm@5692
    83
(* parse (ast) translations *)
wenzelm@5692
    84
skalberg@15570
    85
fun lookup_tr tab c = Option.map fst (Symtab.lookup (tab, c));
wenzelm@237
    86
wenzelm@383
    87
fun err_dup_trfuns name cs =
wenzelm@383
    88
  error ("More than one " ^ name ^ " for " ^ commas_quote cs);
wenzelm@237
    89
wenzelm@15755
    90
fun extend_trtab name trfuns tab = Symtab.extend (tab, trfuns)
wenzelm@15755
    91
  handle Symtab.DUPS cs => err_dup_trfuns name cs;
wenzelm@237
    92
wenzelm@15759
    93
fun remove_trtab trfuns = fold (Symtab.remove SynExt.eq_trfun) trfuns;
wenzelm@15755
    94
wenzelm@15755
    95
fun merge_trtabs name tab1 tab2 = Symtab.merge SynExt.eq_trfun (tab1, tab2)
wenzelm@15755
    96
  handle Symtab.DUPS cs => err_dup_trfuns name cs;
wenzelm@237
    97
wenzelm@237
    98
wenzelm@5692
    99
(* print (ast) translations *)
wenzelm@5692
   100
wenzelm@5692
   101
fun lookup_tr' tab c = map fst (Symtab.lookup_multi (tab, c));
wenzelm@15759
   102
fun extend_tr'tab trfuns = fold_rev (curry Symtab.update_multi) trfuns;
wenzelm@15759
   103
fun remove_tr'tab trfuns = fold (Symtab.remove_multi SynExt.eq_trfun) trfuns;
wenzelm@15755
   104
fun merge_tr'tabs tab1 tab2 = Symtab.merge_multi' SynExt.eq_trfun (tab1, tab2);
wenzelm@5692
   105
wenzelm@5692
   106
wenzelm@237
   107
wenzelm@2700
   108
(** tables of token translation functions **)
wenzelm@2700
   109
wenzelm@2700
   110
fun lookup_tokentr tabs modes =
skalberg@15570
   111
  let val trs = gen_distinct eq_fst (List.concat (map (assocs tabs) (modes @ [""])))
skalberg@15570
   112
  in fn c => Option.map fst (assoc (trs, c)) end;
wenzelm@2700
   113
wenzelm@2700
   114
fun merge_tokentrtabs tabs1 tabs2 =
wenzelm@2700
   115
  let
wenzelm@2700
   116
    fun eq_tr ((c1, (_, s1)), (c2, (_, s2))) = c1 = c2 andalso s1 = s2;
wenzelm@2700
   117
wenzelm@4703
   118
    fun name (s, _) = implode (tl (Symbol.explode s));
wenzelm@2706
   119
wenzelm@2700
   120
    fun merge mode =
wenzelm@2700
   121
      let
wenzelm@2700
   122
        val trs1 = assocs tabs1 mode;
wenzelm@2700
   123
        val trs2 = assocs tabs2 mode;
wenzelm@2700
   124
        val trs = gen_distinct eq_tr (trs1 @ trs2);
wenzelm@2700
   125
      in
wenzelm@2700
   126
        (case gen_duplicates eq_fst trs of
wenzelm@2700
   127
          [] => (mode, trs)
wenzelm@2700
   128
        | dups => error ("More than one token translation function in mode " ^
wenzelm@2706
   129
            quote mode ^ " for " ^ commas_quote (map name dups)))
wenzelm@2700
   130
      end;
wenzelm@2700
   131
  in
wenzelm@2700
   132
    map merge (distinct (map fst (tabs1 @ tabs2)))
wenzelm@2700
   133
  end;
wenzelm@2700
   134
wenzelm@15755
   135
fun extend_tokentrtab tokentrs tabs =
wenzelm@2700
   136
  let
wenzelm@15759
   137
    fun ins_tokentr (m, c, f) ts =
wenzelm@2700
   138
      overwrite (ts, (m, ("_" ^ c, (f, stamp ())) :: assocs ts m));
wenzelm@15759
   139
  in merge_tokentrtabs tabs (fold ins_tokentr tokentrs []) end;
wenzelm@2700
   140
wenzelm@2700
   141
wenzelm@2700
   142
wenzelm@237
   143
(** tables of translation rules **)
wenzelm@237
   144
wenzelm@5692
   145
type ruletab = (Ast.ast * Ast.ast) list Symtab.table;
wenzelm@237
   146
skalberg@15570
   147
fun dest_ruletab tab = List.concat (map snd (Symtab.dest tab));
wenzelm@9372
   148
fun lookup_ruletab tab a = Symtab.lookup_multi (tab, a);
wenzelm@237
   149
wenzelm@237
   150
wenzelm@237
   151
(* empty, extend, merge ruletabs *)
wenzelm@237
   152
wenzelm@15759
   153
val extend_ruletab =
wenzelm@15759
   154
  fold_rev (fn r => fn tab => Symtab.update_multi ((Ast.head_of_rule r, r), tab));
wenzelm@237
   155
wenzelm@15759
   156
val remove_ruletab = fold (fn r => Symtab.remove_multi (op =) (Ast.head_of_rule r, r));
wenzelm@15755
   157
wenzelm@12292
   158
fun merge_ruletabs tab1 tab2 = Symtab.merge_multi' (op =) (tab1, tab2);
clasohm@0
   159
clasohm@0
   160
clasohm@0
   161
clasohm@0
   162
(** datatype syntax **)
clasohm@0
   163
wenzelm@237
   164
datatype syntax =
wenzelm@237
   165
  Syntax of {
wenzelm@15755
   166
    input: SynExt.xprod list,
wenzelm@4703
   167
    lexicon: Scan.lexicon,
wenzelm@5692
   168
    gram: Parser.gram,
wenzelm@18
   169
    consts: string list,
wenzelm@2913
   170
    prmodes: string list,
wenzelm@16613
   171
    parse_ast_trtab: ((theory -> Ast.ast list -> Ast.ast) * stamp) Symtab.table,
wenzelm@237
   172
    parse_ruletab: ruletab,
wenzelm@16613
   173
    parse_trtab: ((theory -> term list -> term) * stamp) Symtab.table,
wenzelm@16613
   174
    print_trtab: ((theory -> bool -> typ -> term list -> term) * stamp) list Symtab.table,
wenzelm@237
   175
    print_ruletab: ruletab,
wenzelm@16613
   176
    print_ast_trtab: ((theory -> Ast.ast list -> Ast.ast) * stamp) list Symtab.table,
wenzelm@6322
   177
    tokentrtab: (string * (string * ((string -> string * real) * stamp)) list) list,
wenzelm@5692
   178
    prtabs: Printer.prtabs}
clasohm@0
   179
wenzelm@14687
   180
fun is_keyword (Syntax {lexicon, ...}) = Scan.is_literal lexicon o Symbol.explode;
wenzelm@14687
   181
wenzelm@15755
   182
val default_mode = ("", true);
wenzelm@15755
   183
wenzelm@18
   184
wenzelm@237
   185
(* empty_syntax *)
wenzelm@18
   186
wenzelm@237
   187
val empty_syntax =
wenzelm@237
   188
  Syntax {
wenzelm@15755
   189
    input = [],
wenzelm@4703
   190
    lexicon = Scan.empty_lexicon,
wenzelm@5692
   191
    gram = Parser.empty_gram,
wenzelm@167
   192
    consts = [],
wenzelm@2913
   193
    prmodes = [],
wenzelm@5692
   194
    parse_ast_trtab = Symtab.empty,
wenzelm@5692
   195
    parse_ruletab = Symtab.empty,
wenzelm@5692
   196
    parse_trtab = Symtab.empty,
wenzelm@5692
   197
    print_trtab = Symtab.empty,
wenzelm@5692
   198
    print_ruletab = Symtab.empty,
wenzelm@5692
   199
    print_ast_trtab = Symtab.empty,
wenzelm@2700
   200
    tokentrtab = [],
wenzelm@15755
   201
    prtabs = Printer.empty_prtabs};
wenzelm@167
   202
wenzelm@167
   203
wenzelm@237
   204
(* extend_syntax *)
wenzelm@167
   205
wenzelm@14904
   206
fun extend_syntax (mode, inout) syn_ext (Syntax tabs) =
wenzelm@167
   207
  let
wenzelm@15755
   208
    val {input, lexicon, gram, consts = consts1, prmodes = prmodes1,
wenzelm@2366
   209
      parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@2700
   210
      print_ast_trtab, tokentrtab, prtabs} = tabs;
wenzelm@14904
   211
    val SynExt.SynExt {xprods, consts = consts2, prmodes = prmodes2,
wenzelm@2913
   212
      parse_ast_translation, parse_rules, parse_translation, print_translation, print_rules,
wenzelm@2700
   213
      print_ast_translation, token_translation} = syn_ext;
wenzelm@167
   214
  in
wenzelm@237
   215
    Syntax {
wenzelm@15755
   216
      input = if inout then xprods @ input else input,
wenzelm@5692
   217
      lexicon = if inout then Scan.extend_lexicon lexicon (SynExt.delims_of xprods) else lexicon,
wenzelm@5692
   218
      gram = if inout then Parser.extend_gram gram xprods else gram,
wenzelm@15755
   219
      consts = merge_lists' consts1 consts2,
wenzelm@15755
   220
      prmodes = mode ins_string (merge_lists' prmodes1 prmodes2),
wenzelm@167
   221
      parse_ast_trtab =
wenzelm@15755
   222
        extend_trtab "parse ast translation" parse_ast_translation parse_ast_trtab,
wenzelm@15755
   223
      parse_ruletab = extend_ruletab parse_rules parse_ruletab,
wenzelm@15755
   224
      parse_trtab = extend_trtab "parse translation" parse_translation parse_trtab,
wenzelm@15755
   225
      print_trtab = extend_tr'tab print_translation print_trtab,
wenzelm@15755
   226
      print_ruletab = extend_ruletab print_rules print_ruletab,
wenzelm@15755
   227
      print_ast_trtab = extend_tr'tab print_ast_translation print_ast_trtab,
wenzelm@15755
   228
      tokentrtab = extend_tokentrtab token_translation tokentrtab,
wenzelm@15755
   229
      prtabs = Printer.extend_prtabs mode xprods prtabs}
wenzelm@18
   230
  end;
wenzelm@18
   231
wenzelm@15755
   232
wenzelm@15755
   233
(* remove_syntax *)
wenzelm@15755
   234
wenzelm@15755
   235
fun remove_syntax (mode, inout) syn_ext (Syntax tabs) =
wenzelm@15755
   236
  let
wenzelm@15755
   237
    val SynExt.SynExt {xprods, consts = _, prmodes = _,
wenzelm@15755
   238
      parse_ast_translation, parse_rules, parse_translation, print_translation, print_rules,
wenzelm@15755
   239
      print_ast_translation, token_translation = _} = syn_ext;
wenzelm@15755
   240
    val {input, lexicon, gram, consts, prmodes,
wenzelm@15755
   241
      parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab, print_ruletab,
wenzelm@15755
   242
      print_ast_trtab, tokentrtab, prtabs} = tabs;
wenzelm@15759
   243
    val input' = if inout then fold (remove (op =)) xprods input else input;
wenzelm@15755
   244
  in
wenzelm@15755
   245
    Syntax {
wenzelm@15755
   246
      input = input',
wenzelm@15755
   247
      lexicon = if inout then Scan.make_lexicon (SynExt.delims_of input') else lexicon,
wenzelm@15755
   248
      gram = if inout then Parser.make_gram input' else gram,
wenzelm@15755
   249
      consts = consts,
wenzelm@15755
   250
      prmodes = prmodes,
wenzelm@15755
   251
      parse_ast_trtab = remove_trtab parse_ast_translation parse_ast_trtab,
wenzelm@15755
   252
      parse_ruletab = remove_ruletab parse_rules parse_ruletab,
wenzelm@15755
   253
      parse_trtab = remove_trtab parse_translation parse_trtab,
wenzelm@15755
   254
      print_trtab = remove_tr'tab print_translation print_trtab,
wenzelm@15755
   255
      print_ruletab = remove_ruletab print_rules print_ruletab,
wenzelm@15755
   256
      print_ast_trtab = remove_tr'tab print_ast_translation print_ast_trtab,
wenzelm@15755
   257
      tokentrtab = tokentrtab,
wenzelm@15755
   258
      prtabs = Printer.remove_prtabs mode xprods prtabs}
wenzelm@15755
   259
  end;
wenzelm@14904
   260
wenzelm@18
   261
wenzelm@237
   262
(* merge_syntaxes *)
clasohm@0
   263
wenzelm@237
   264
fun merge_syntaxes (Syntax tabs1) (Syntax tabs2) =
clasohm@0
   265
  let
wenzelm@15755
   266
    val {input = input1, lexicon = lexicon1, gram = gram1, consts = consts1,
wenzelm@15755
   267
      prmodes = prmodes1, parse_ast_trtab = parse_ast_trtab1,
wenzelm@15755
   268
      parse_ruletab = parse_ruletab1, parse_trtab = parse_trtab1,
wenzelm@15755
   269
      print_trtab = print_trtab1, print_ruletab = print_ruletab1,
wenzelm@15755
   270
      print_ast_trtab = print_ast_trtab1, tokentrtab = tokentrtab1, prtabs = prtabs1} = tabs1;
wenzelm@237
   271
wenzelm@15755
   272
    val {input = input2, lexicon = lexicon2, gram = gram2, consts = consts2,
wenzelm@15755
   273
      prmodes = prmodes2, parse_ast_trtab = parse_ast_trtab2,
wenzelm@15755
   274
      parse_ruletab = parse_ruletab2, parse_trtab = parse_trtab2,
wenzelm@15755
   275
      print_trtab = print_trtab2, print_ruletab = print_ruletab2,
wenzelm@15755
   276
      print_ast_trtab = print_ast_trtab2, tokentrtab = tokentrtab2, prtabs = prtabs2} = tabs2;
clasohm@0
   277
  in
wenzelm@237
   278
    Syntax {
wenzelm@15755
   279
      input = merge_lists' input1 input2,
wenzelm@4703
   280
      lexicon = Scan.merge_lexicons lexicon1 lexicon2,
wenzelm@5692
   281
      gram = Parser.merge_grams gram1 gram2,
berghofe@11528
   282
      consts = unique_strings (sort_strings (consts1 @ consts2)),
wenzelm@2913
   283
      prmodes = merge_lists prmodes1 prmodes2,
wenzelm@237
   284
      parse_ast_trtab =
wenzelm@15755
   285
        merge_trtabs "parse ast translation" parse_ast_trtab1 parse_ast_trtab2,
wenzelm@237
   286
      parse_ruletab = merge_ruletabs parse_ruletab1 parse_ruletab2,
wenzelm@15755
   287
      parse_trtab = merge_trtabs "parse translation" parse_trtab1 parse_trtab2,
wenzelm@5692
   288
      print_trtab = merge_tr'tabs print_trtab1 print_trtab2,
wenzelm@237
   289
      print_ruletab = merge_ruletabs print_ruletab1 print_ruletab2,
wenzelm@5692
   290
      print_ast_trtab = merge_tr'tabs print_ast_trtab1 print_ast_trtab2,
wenzelm@2700
   291
      tokentrtab = merge_tokentrtabs tokentrtab1 tokentrtab2,
wenzelm@5692
   292
      prtabs = Printer.merge_prtabs prtabs1 prtabs2}
clasohm@0
   293
  end;
clasohm@0
   294
clasohm@0
   295
wenzelm@260
   296
(* type_syn *)
wenzelm@260
   297
wenzelm@14904
   298
val type_syn = empty_syntax |> extend_syntax default_mode TypeExt.type_ext;
wenzelm@14904
   299
val pure_syn = type_syn |> extend_syntax default_mode SynExt.pure_ext;
wenzelm@260
   300
clasohm@0
   301
wenzelm@4887
   302
wenzelm@15759
   303
(** print syntax **)
wenzelm@15759
   304
wenzelm@15759
   305
local
clasohm@0
   306
wenzelm@260
   307
fun pretty_strs_qs name strs =
berghofe@14598
   308
  Pretty.strs (name :: map Library.quote (sort_strings strs));
clasohm@0
   309
wenzelm@15759
   310
fun pretty_gram (Syntax tabs) =
clasohm@0
   311
  let
wenzelm@14904
   312
    val {lexicon, prmodes, gram, prtabs, ...} = tabs;
wenzelm@2913
   313
    val prmodes' = sort_strings (filter_out (equal "") prmodes);
clasohm@0
   314
  in
wenzelm@8720
   315
    [pretty_strs_qs "lexicon:" (Scan.dest_lexicon lexicon),
wenzelm@8720
   316
      Pretty.big_list "prods:" (Parser.pretty_gram gram),
wenzelm@8720
   317
      pretty_strs_qs "print modes:" prmodes']
clasohm@0
   318
  end;
clasohm@0
   319
wenzelm@15759
   320
fun pretty_trans (Syntax tabs) =
clasohm@0
   321
  let
wenzelm@260
   322
    fun pretty_trtab name tab =
wenzelm@5692
   323
      pretty_strs_qs name (Symtab.keys tab);
clasohm@0
   324
wenzelm@260
   325
    fun pretty_ruletab name tab =
wenzelm@5692
   326
      Pretty.big_list name (map Ast.pretty_rule (dest_ruletab tab));
clasohm@0
   327
berghofe@14598
   328
    fun pretty_tokentr (mode, trs) = Pretty.strs (Library.quote mode ^ ":" :: map fst trs);
wenzelm@4703
   329
wenzelm@237
   330
    val {consts, parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab,
wenzelm@4703
   331
      print_ruletab, print_ast_trtab, tokentrtab, ...} = tabs;
clasohm@0
   332
  in
wenzelm@8720
   333
    [pretty_strs_qs "consts:" consts,
wenzelm@8720
   334
      pretty_trtab "parse_ast_translation:" parse_ast_trtab,
wenzelm@8720
   335
      pretty_ruletab "parse_rules:" parse_ruletab,
wenzelm@8720
   336
      pretty_trtab "parse_translation:" parse_trtab,
wenzelm@8720
   337
      pretty_trtab "print_translation:" print_trtab,
wenzelm@8720
   338
      pretty_ruletab "print_rules:" print_ruletab,
wenzelm@8720
   339
      pretty_trtab "print_ast_translation:" print_ast_trtab,
wenzelm@8720
   340
      Pretty.big_list "token_translation:" (map pretty_tokentr tokentrtab)]
clasohm@0
   341
  end;
clasohm@0
   342
wenzelm@15759
   343
in
clasohm@0
   344
wenzelm@15759
   345
fun print_gram syn = Pretty.writeln (Pretty.chunks (pretty_gram syn));
wenzelm@15759
   346
fun print_trans syn = Pretty.writeln (Pretty.chunks (pretty_trans syn));
wenzelm@15759
   347
fun print_syntax syn = Pretty.writeln (Pretty.chunks (pretty_gram syn @ pretty_trans syn));
clasohm@0
   348
wenzelm@15759
   349
end;
clasohm@0
   350
clasohm@0
   351
clasohm@0
   352
wenzelm@237
   353
(** read **)
wenzelm@18
   354
wenzelm@260
   355
(* read_ast *)
wenzelm@260
   356
clasohm@882
   357
val ambiguity_level = ref 1;
wenzelm@15755
   358
val ambiguity_is_error = ref false
clasohm@882
   359
wenzelm@16613
   360
fun read_asts thy is_logtype (Syntax tabs) xids root str =
wenzelm@260
   361
  let
wenzelm@14904
   362
    val {lexicon, gram, parse_ast_trtab, ...} = tabs;
wenzelm@14904
   363
    val root' = if root <> "prop" andalso is_logtype root then SynExt.logic else root;
wenzelm@4703
   364
    val chars = Symbol.explode str;
wenzelm@5692
   365
    val pts = Parser.parse gram root' (Lexicon.tokenize lexicon xids chars);
clasohm@330
   366
wenzelm@12292
   367
    fun show_pt pt =
wenzelm@16613
   368
      Pretty.string_of (Ast.pretty_ast (hd (SynTrans.pts_to_asts thy (K NONE) [pt])));
wenzelm@260
   369
  in
wenzelm@16613
   370
    conditional (length pts > ! ambiguity_level) (fn () =>
wenzelm@16613
   371
      if ! ambiguity_is_error then error ("Ambiguous input " ^ quote str)
wenzelm@16661
   372
      else (warning ("Ambiguous input " ^ quote str ^ "\n" ^
wenzelm@16716
   373
          "produces " ^ string_of_int (length pts) ^ " parse trees.");
wenzelm@16669
   374
         List.app (warning o show_pt) pts));
wenzelm@16613
   375
    SynTrans.pts_to_asts thy (lookup_tr parse_ast_trtab) pts
wenzelm@260
   376
  end;
wenzelm@260
   377
wenzelm@260
   378
wenzelm@237
   379
(* read *)
clasohm@0
   380
wenzelm@16613
   381
fun read thy is_logtype (syn as Syntax tabs) ty str =
clasohm@0
   382
  let
wenzelm@237
   383
    val {parse_ruletab, parse_trtab, ...} = tabs;
wenzelm@16613
   384
    val asts = read_asts thy is_logtype syn false (SynExt.typ_to_nonterm ty) str;
clasohm@0
   385
  in
wenzelm@16613
   386
    SynTrans.asts_to_terms thy (lookup_tr parse_trtab)
wenzelm@5692
   387
      (map (Ast.normalize_ast (lookup_ruletab parse_ruletab)) asts)
clasohm@0
   388
  end;
clasohm@0
   389
clasohm@0
   390
wenzelm@237
   391
(* read types *)
clasohm@0
   392
wenzelm@16613
   393
fun read_typ thy syn get_sort map_sort str =
wenzelm@16613
   394
  (case read thy (K false) syn SynExt.typeT str of
wenzelm@12316
   395
    [t] => TypeExt.typ_of_term (get_sort (TypeExt.raw_term_sorts t)) map_sort t
wenzelm@8894
   396
  | _ => error "read_typ: ambiguous syntax");
wenzelm@144
   397
wenzelm@144
   398
wenzelm@8894
   399
(* read sorts *)
wenzelm@8894
   400
wenzelm@16613
   401
fun read_sort thy syn str =
wenzelm@16613
   402
  (case read thy (K false) syn TypeExt.sortT str of
wenzelm@8894
   403
    [t] => TypeExt.sort_of_term t
wenzelm@8894
   404
  | _ => error "read_sort: ambiguous syntax");
wenzelm@8894
   405
wenzelm@8894
   406
wenzelm@18
   407
wenzelm@1158
   408
(** prepare translation rules **)
wenzelm@1158
   409
wenzelm@1158
   410
datatype 'a trrule =
wenzelm@3526
   411
  ParseRule of 'a * 'a |
wenzelm@3526
   412
  PrintRule of 'a * 'a |
wenzelm@3526
   413
  ParsePrintRule of 'a * 'a;
wenzelm@888
   414
wenzelm@4618
   415
fun map_trrule f (ParseRule (x, y)) = ParseRule (f x, f y)
wenzelm@4618
   416
  | map_trrule f (PrintRule (x, y)) = PrintRule (f x, f y)
wenzelm@4618
   417
  | map_trrule f (ParsePrintRule (x, y)) = ParsePrintRule (f x, f y);
wenzelm@1158
   418
skalberg@15531
   419
fun parse_rule (ParseRule pats) = SOME pats
skalberg@15531
   420
  | parse_rule (PrintRule _) = NONE
skalberg@15531
   421
  | parse_rule (ParsePrintRule pats) = SOME pats;
wenzelm@1158
   422
skalberg@15531
   423
fun print_rule (ParseRule _) = NONE
skalberg@15531
   424
  | print_rule (PrintRule pats) = SOME (swap pats)
skalberg@15531
   425
  | print_rule (ParsePrintRule pats) = SOME (swap pats);
wenzelm@1158
   426
wenzelm@1158
   427
wenzelm@1158
   428
fun check_rule (rule as (lhs, rhs)) =
wenzelm@5692
   429
  (case Ast.rule_error rule of
skalberg@15531
   430
    SOME msg =>
wenzelm@1158
   431
      error ("Error in syntax translation rule: " ^ msg ^ "\n" ^
wenzelm@5692
   432
        Ast.str_of_ast lhs ^ "  ->  " ^ Ast.str_of_ast rhs)
skalberg@15531
   433
  | NONE => rule);
wenzelm@888
   434
wenzelm@888
   435
wenzelm@16613
   436
fun read_pattern thy is_logtype syn (root, str) =
wenzelm@18
   437
  let
wenzelm@237
   438
    val Syntax {consts, ...} = syn;
wenzelm@18
   439
wenzelm@5692
   440
    fun constify (ast as Ast.Constant _) = ast
wenzelm@5692
   441
      | constify (ast as Ast.Variable x) =
wenzelm@8720
   442
          if x mem consts orelse NameSpace.is_qualified x then Ast.Constant x
wenzelm@3830
   443
          else ast
wenzelm@5692
   444
      | constify (Ast.Appl asts) = Ast.Appl (map constify asts);
wenzelm@18
   445
  in
wenzelm@16613
   446
    (case read_asts thy is_logtype syn true root str of
wenzelm@888
   447
      [ast] => constify ast
wenzelm@888
   448
    | _ => error ("Syntactically ambiguous input: " ^ quote str))
wenzelm@888
   449
  end handle ERROR =>
wenzelm@888
   450
    error ("The error(s) above occurred in translation pattern " ^
wenzelm@888
   451
      quote str);
clasohm@0
   452
wenzelm@556
   453
wenzelm@1158
   454
fun prep_rules rd_pat raw_rules =
wenzelm@4618
   455
  let val rules = map (map_trrule rd_pat) raw_rules in
skalberg@15570
   456
    (map check_rule (List.mapPartial parse_rule rules),
skalberg@15570
   457
      map check_rule (List.mapPartial print_rule rules))
wenzelm@1158
   458
  end
wenzelm@18
   459
wenzelm@18
   460
wenzelm@18
   461
wenzelm@3779
   462
(** pretty terms, typs, sorts **)
wenzelm@18
   463
wenzelm@16613
   464
fun pretty_t t_to_ast prt_t thy (syn as Syntax tabs) curried t =
clasohm@0
   465
  let
wenzelm@2700
   466
    val {print_trtab, print_ruletab, print_ast_trtab, tokentrtab, prtabs, ...} = tabs;
wenzelm@16613
   467
    val ast = t_to_ast thy (lookup_tr' print_trtab) t;
clasohm@0
   468
  in
wenzelm@16613
   469
    prt_t thy curried prtabs (lookup_tr' print_ast_trtab)
oheimb@6167
   470
      (lookup_tokentr tokentrtab (! print_mode))
wenzelm@5692
   471
      (Ast.normalize_ast (lookup_ruletab print_ruletab) ast)
clasohm@0
   472
  end;
clasohm@0
   473
wenzelm@5692
   474
val pretty_term = pretty_t Printer.term_to_ast Printer.pretty_term_ast;
wenzelm@16613
   475
fun pretty_typ thy syn = pretty_t Printer.typ_to_ast Printer.pretty_typ_ast thy syn false;
wenzelm@16613
   476
fun pretty_sort thy syn = pretty_t Printer.sort_to_ast Printer.pretty_typ_ast thy syn false;
clasohm@0
   477
clasohm@0
   478
clasohm@0
   479
wenzelm@14904
   480
(** extend syntax **)
wenzelm@383
   481
wenzelm@14904
   482
fun ext_syntax' f is_logtype prmode decls = extend_syntax prmode (f is_logtype decls);
wenzelm@14904
   483
fun ext_syntax f = ext_syntax' (K f) (K false) default_mode;
wenzelm@383
   484
wenzelm@16613
   485
val extend_type_gram       = ext_syntax Mixfix.syn_ext_types;
wenzelm@16613
   486
val extend_const_gram      = ext_syntax' Mixfix.syn_ext_consts;
wenzelm@16613
   487
val extend_consts          = ext_syntax SynExt.syn_ext_const_names;
wenzelm@16613
   488
val extend_trfuns          = ext_syntax SynExt.syn_ext_trfuns;
wenzelm@16613
   489
val extend_advanced_trfuns = ext_syntax SynExt.syn_ext_advanced_trfuns;
wenzelm@16613
   490
val extend_tokentrfuns     = ext_syntax SynExt.syn_ext_tokentrfuns;
wenzelm@16613
   491
val extend_trrules_i       = ext_syntax SynExt.syn_ext_rules o prep_rules I;
wenzelm@383
   492
wenzelm@16613
   493
fun extend_trrules thy is_logtype syn rules =
wenzelm@14904
   494
  ext_syntax' (K SynExt.syn_ext_rules) (K false) default_mode
wenzelm@16613
   495
    (prep_rules (read_pattern thy is_logtype syn) rules);
wenzelm@5692
   496
wenzelm@15755
   497
fun remove_const_gram is_logtype prmode decls =
wenzelm@15755
   498
  remove_syntax prmode (Mixfix.syn_ext_consts is_logtype decls);
wenzelm@15755
   499
wenzelm@5692
   500
wenzelm@5692
   501
wenzelm@15833
   502
(*export parts of internal Syntax structures*)
wenzelm@15833
   503
open Lexicon SynExt Ast Parser TypeExt SynTrans Mixfix Printer;
wenzelm@2366
   504
clasohm@0
   505
end;
wenzelm@5692
   506
wenzelm@5692
   507
structure BasicSyntax: BASIC_SYNTAX = Syntax;
wenzelm@5692
   508
open BasicSyntax;