src/Pure/Syntax/syntax.ML
author wenzelm
Wed Dec 12 23:36:07 2012 +0100 (2012-12-12 ago)
changeset 50499 f496b2b7bafb
parent 50201 c26369c9eda6
child 51580 64ef8260dc60
permissions -rw-r--r--
rendering of selected dialog_result as active_result_color, depending on dynamic command status in output panel, but not static popups etc.;
     1 (*  Title:      Pure/Syntax/syntax.ML
     2     Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
     3 
     4 Standard Isabelle syntax, based on arbitrary context-free grammars
     5 (specified by mixfix declarations).
     6 *)
     7 
     8 signature SYNTAX =
     9 sig
    10   type operations
    11   val install_operations: operations -> unit
    12   val root: string Config.T
    13   val ambiguity_warning_raw: Config.raw
    14   val ambiguity_warning: bool Config.T
    15   val ambiguity_limit_raw: Config.raw
    16   val ambiguity_limit: int Config.T
    17   val read_token: string -> Symbol_Pos.T list * Position.T
    18   val read_token_pos: string -> Position.T
    19   val parse_token: Proof.context -> (XML.tree list -> 'a) ->
    20     Markup.T -> (Symbol_Pos.T list * Position.T -> 'a) -> string -> 'a
    21   val parse_sort: Proof.context -> string -> sort
    22   val parse_typ: Proof.context -> string -> typ
    23   val parse_term: Proof.context -> string -> term
    24   val parse_prop: Proof.context -> string -> term
    25   val unparse_sort: Proof.context -> sort -> Pretty.T
    26   val unparse_classrel: Proof.context -> class list -> Pretty.T
    27   val unparse_arity: Proof.context -> arity -> Pretty.T
    28   val unparse_typ: Proof.context -> typ -> Pretty.T
    29   val unparse_term: Proof.context -> term -> Pretty.T
    30   val check_sort: Proof.context -> sort -> sort
    31   val check_typ: Proof.context -> typ -> typ
    32   val check_term: Proof.context -> term -> term
    33   val check_prop: Proof.context -> term -> term
    34   val check_typs: Proof.context -> typ list -> typ list
    35   val check_terms: Proof.context -> term list -> term list
    36   val check_props: Proof.context -> term list -> term list
    37   val uncheck_sort: Proof.context -> sort -> sort
    38   val uncheck_arity: Proof.context -> arity -> arity
    39   val uncheck_classrel: Proof.context -> class list -> class list
    40   val uncheck_typs: Proof.context -> typ list -> typ list
    41   val uncheck_terms: Proof.context -> term list -> term list
    42   val read_sort: Proof.context -> string -> sort
    43   val read_typ: Proof.context -> string -> typ
    44   val read_term: Proof.context -> string -> term
    45   val read_prop: Proof.context -> string -> term
    46   val read_typs: Proof.context -> string list -> typ list
    47   val read_terms: Proof.context -> string list -> term list
    48   val read_props: Proof.context -> string list -> term list
    49   val read_sort_global: theory -> string -> sort
    50   val read_typ_global: theory -> string -> typ
    51   val read_term_global: theory -> string -> term
    52   val read_prop_global: theory -> string -> term
    53   val pretty_term: Proof.context -> term -> Pretty.T
    54   val pretty_typ: Proof.context -> typ -> Pretty.T
    55   val pretty_sort: Proof.context -> sort -> Pretty.T
    56   val pretty_classrel: Proof.context -> class list -> Pretty.T
    57   val pretty_arity: Proof.context -> arity -> Pretty.T
    58   val string_of_term: Proof.context -> term -> string
    59   val string_of_typ: Proof.context -> typ -> string
    60   val string_of_sort: Proof.context -> sort -> string
    61   val string_of_classrel: Proof.context -> class list -> string
    62   val string_of_arity: Proof.context -> arity -> string
    63   val is_pretty_global: Proof.context -> bool
    64   val set_pretty_global: bool -> Proof.context -> Proof.context
    65   val init_pretty_global: theory -> Proof.context
    66   val init_pretty: Context.pretty -> Proof.context
    67   val pretty_term_global: theory -> term -> Pretty.T
    68   val pretty_typ_global: theory -> typ -> Pretty.T
    69   val pretty_sort_global: theory -> sort -> Pretty.T
    70   val string_of_term_global: theory -> term -> string
    71   val string_of_typ_global: theory -> typ -> string
    72   val string_of_sort_global: theory -> sort -> string
    73   type syntax
    74   val eq_syntax: syntax * syntax -> bool
    75   val force_syntax: syntax -> unit
    76   val lookup_const: syntax -> string -> string option
    77   val is_keyword: syntax -> string -> bool
    78   val tokenize: syntax -> bool -> Symbol_Pos.T list -> Lexicon.token list
    79   val parse: syntax -> string -> Lexicon.token list -> Parser.parsetree list
    80   val parse_ast_translation: syntax -> string -> (Proof.context -> Ast.ast list -> Ast.ast) option
    81   val parse_rules: syntax -> string -> (Ast.ast * Ast.ast) list
    82   val parse_translation: syntax -> string -> (Proof.context -> term list -> term) option
    83   val print_translation: syntax -> string ->
    84     Proof.context -> typ -> term list -> term  (*exception Match*)
    85   val print_rules: syntax -> string -> (Ast.ast * Ast.ast) list
    86   val print_ast_translation: syntax -> string ->
    87     Proof.context -> Ast.ast list -> Ast.ast  (*exception Match*)
    88   val prtabs: syntax -> Printer.prtabs
    89   type mode
    90   val mode_default: mode
    91   val mode_input: mode
    92   val empty_syntax: syntax
    93   val merge_syntax: syntax * syntax -> syntax
    94   val token_markers: string list
    95   val basic_nonterms: string list
    96   val print_gram: syntax -> unit
    97   val print_trans: syntax -> unit
    98   val print_syntax: syntax -> unit
    99   val guess_infix: syntax -> string -> mixfix option
   100   datatype 'a trrule =
   101     Parse_Rule of 'a * 'a |
   102     Print_Rule of 'a * 'a |
   103     Parse_Print_Rule of 'a * 'a
   104   val map_trrule: ('a -> 'b) -> 'a trrule -> 'b trrule
   105   val update_trfuns:
   106     (string * ((Ast.ast list -> Ast.ast) * stamp)) list *
   107     (string * ((term list -> term) * stamp)) list *
   108     (string * ((typ -> term list -> term) * stamp)) list *
   109     (string * ((Ast.ast list -> Ast.ast) * stamp)) list -> syntax -> syntax
   110   val update_advanced_trfuns:
   111     (string * ((Proof.context -> Ast.ast list -> Ast.ast) * stamp)) list *
   112     (string * ((Proof.context -> term list -> term) * stamp)) list *
   113     (string * ((Proof.context -> typ -> term list -> term) * stamp)) list *
   114     (string * ((Proof.context -> Ast.ast list -> Ast.ast) * stamp)) list -> syntax -> syntax
   115   val update_type_gram: bool -> mode -> (string * typ * mixfix) list -> syntax -> syntax
   116   val update_const_gram: bool -> (string -> bool) ->
   117     mode -> (string * typ * mixfix) list -> syntax -> syntax
   118   val update_trrules: Ast.ast trrule list -> syntax -> syntax
   119   val remove_trrules: Ast.ast trrule list -> syntax -> syntax
   120   val const: string -> term
   121   val free: string -> term
   122   val var: indexname -> term
   123 end;
   124 
   125 structure Syntax: SYNTAX =
   126 struct
   127 
   128 
   129 (** inner syntax operations **)
   130 
   131 (* back-patched operations *)
   132 
   133 type operations =
   134  {parse_sort: Proof.context -> string -> sort,
   135   parse_typ: Proof.context -> string -> typ,
   136   parse_term: Proof.context -> string -> term,
   137   parse_prop: Proof.context -> string -> term,
   138   unparse_sort: Proof.context -> sort -> Pretty.T,
   139   unparse_typ: Proof.context -> typ -> Pretty.T,
   140   unparse_term: Proof.context -> term -> Pretty.T,
   141   check_typs: Proof.context -> typ list -> typ list,
   142   check_terms: Proof.context -> term list -> term list,
   143   check_props: Proof.context -> term list -> term list,
   144   uncheck_typs: Proof.context -> typ list -> typ list,
   145   uncheck_terms: Proof.context -> term list -> term list};
   146 
   147 val operations: operations Single_Assignment.var = Single_Assignment.var "Syntax.operations";
   148 fun install_operations ops = Single_Assignment.assign operations ops;
   149 
   150 fun operation which ctxt x =
   151   (case Single_Assignment.peek operations of
   152     NONE => raise Fail "Inner syntax operations not installed"
   153   | SOME ops => which ops ctxt x);
   154 
   155 
   156 (* configuration options *)
   157 
   158 val root = Config.string (Config.declare "syntax_root" (K (Config.String "any")));
   159 
   160 val ambiguity_warning_raw = Config.declare "syntax_ambiguity_warning" (fn _ => Config.Bool true);
   161 val ambiguity_warning = Config.bool ambiguity_warning_raw;
   162 
   163 val ambiguity_limit_raw = Config.declare "syntax_ambiguity_limit" (fn _ => Config.Int 10);
   164 val ambiguity_limit = Config.int ambiguity_limit_raw;
   165 
   166 
   167 (* outer syntax token -- with optional YXML content *)
   168 
   169 fun token_position (XML.Elem ((name, props), _)) =
   170       if name = Markup.tokenN then Position.of_properties props
   171       else Position.none
   172   | token_position (XML.Text _) = Position.none;
   173 
   174 fun explode_token tree =
   175   let
   176     val text = XML.content_of [tree];
   177     val pos = token_position tree;
   178   in (Symbol_Pos.explode (text, pos), pos) end;
   179 
   180 fun read_token str = explode_token (YXML.parse str handle Fail msg => error msg);
   181 fun read_token_pos str = token_position (YXML.parse str handle Fail msg => error msg);
   182 
   183 fun parse_token ctxt decode markup parse str =
   184   let
   185     fun parse_tree tree =
   186       let
   187         val (syms, pos) = explode_token tree;
   188         val _ = Context_Position.report ctxt pos markup;
   189       in parse (syms, pos) end;
   190   in
   191     (case YXML.parse_body str handle Fail msg => error msg of
   192       body as [tree as XML.Elem ((name, _), _)] =>
   193         if name = Markup.tokenN then parse_tree tree else decode body
   194     | [tree as XML.Text _] => parse_tree tree
   195     | body => decode body)
   196   end;
   197 
   198 
   199 (* (un)parsing *)
   200 
   201 val parse_sort = operation #parse_sort;
   202 val parse_typ = operation #parse_typ;
   203 val parse_term = operation #parse_term;
   204 val parse_prop = operation #parse_prop;
   205 val unparse_sort = operation #unparse_sort;
   206 val unparse_typ = operation #unparse_typ;
   207 val unparse_term = operation #unparse_term;
   208 
   209 
   210 (* (un)checking *)
   211 
   212 val check_typs = operation #check_typs;
   213 val check_terms = operation #check_terms;
   214 val check_props = operation #check_props;
   215 
   216 val check_typ = singleton o check_typs;
   217 val check_term = singleton o check_terms;
   218 val check_prop = singleton o check_props;
   219 
   220 val uncheck_typs = operation #uncheck_typs;
   221 val uncheck_terms = operation #uncheck_terms;
   222 
   223 
   224 (* derived operations for algebra of sorts *)
   225 
   226 local
   227 
   228 fun map_sort f S =
   229   (case f (TFree ("", S)) of
   230     TFree ("", S') => S'
   231   | _ => raise TYPE ("map_sort", [TFree ("", S)], []));
   232 
   233 in
   234 
   235 val check_sort = map_sort o check_typ;
   236 val uncheck_sort = map_sort o singleton o uncheck_typs;
   237 
   238 end;
   239 
   240 
   241 val uncheck_classrel = map o singleton o uncheck_sort;
   242 
   243 fun unparse_classrel ctxt cs = Pretty.block (flat
   244   (separate [Pretty.str " <", Pretty.brk 1] (map (single o unparse_sort ctxt o single) cs)));
   245 
   246 fun uncheck_arity ctxt (a, Ss, S) =
   247   let
   248     val T = Type (a, replicate (length Ss) dummyT);
   249     val a' =
   250       (case singleton (uncheck_typs ctxt) T of
   251         Type (a', _) => a'
   252       | T => raise TYPE ("uncheck_arity", [T], []));
   253     val Ss' = map (uncheck_sort ctxt) Ss;
   254     val S' = uncheck_sort ctxt S;
   255   in (a', Ss', S') end;
   256 
   257 fun unparse_arity ctxt (a, Ss, S) =
   258   let
   259     val prtT = unparse_typ ctxt (Type (a, []));
   260     val dom =
   261       if null Ss then []
   262       else [Pretty.list "(" ")" (map (unparse_sort ctxt) Ss), Pretty.brk 1];
   263   in Pretty.block ([prtT, Pretty.str " ::", Pretty.brk 1] @ dom @ [unparse_sort ctxt S]) end;
   264 
   265 
   266 (* read = parse + check *)
   267 
   268 fun read_sort ctxt = parse_sort ctxt #> check_sort ctxt;
   269 
   270 fun read_typs ctxt =
   271   grouped 10 (Par_List.map_name "Syntax.read_typs") (parse_typ ctxt) #> check_typs ctxt;
   272 
   273 fun read_terms ctxt =
   274   grouped 10 (Par_List.map_name "Syntax.read_terms") (parse_term ctxt) #> check_terms ctxt;
   275 
   276 fun read_props ctxt =
   277   grouped 10 (Par_List.map_name "Syntax.read_props") (parse_prop ctxt) #> check_props ctxt;
   278 
   279 val read_typ = singleton o read_typs;
   280 val read_term = singleton o read_terms;
   281 val read_prop = singleton o read_props;
   282 
   283 val read_sort_global = read_sort o Proof_Context.init_global;
   284 val read_typ_global = read_typ o Proof_Context.init_global;
   285 val read_term_global = read_term o Proof_Context.init_global;
   286 val read_prop_global = read_prop o Proof_Context.init_global;
   287 
   288 
   289 (* pretty = uncheck + unparse *)
   290 
   291 fun pretty_term ctxt = singleton (uncheck_terms ctxt) #> unparse_term ctxt;
   292 fun pretty_typ ctxt = singleton (uncheck_typs ctxt) #> unparse_typ ctxt;
   293 fun pretty_sort ctxt = uncheck_sort ctxt #> unparse_sort ctxt;
   294 fun pretty_classrel ctxt = uncheck_classrel ctxt #> unparse_classrel ctxt;
   295 fun pretty_arity ctxt = uncheck_arity ctxt #> unparse_arity ctxt;
   296 
   297 val string_of_term = Pretty.string_of oo pretty_term;
   298 val string_of_typ = Pretty.string_of oo pretty_typ;
   299 val string_of_sort = Pretty.string_of oo pretty_sort;
   300 val string_of_classrel = Pretty.string_of oo pretty_classrel;
   301 val string_of_arity = Pretty.string_of oo pretty_arity;
   302 
   303 
   304 (* global pretty printing *)
   305 
   306 val pretty_global = Config.bool (Config.declare "Syntax.pretty_global" (K (Config.Bool false)));
   307 fun is_pretty_global ctxt = Config.get ctxt pretty_global;
   308 val set_pretty_global = Config.put pretty_global;
   309 val init_pretty_global = set_pretty_global true o Proof_Context.init_global;
   310 val init_pretty = Context.pretty_context init_pretty_global;
   311 
   312 val pretty_term_global = pretty_term o init_pretty_global;
   313 val pretty_typ_global = pretty_typ o init_pretty_global;
   314 val pretty_sort_global = pretty_sort o init_pretty_global;
   315 
   316 val string_of_term_global = string_of_term o init_pretty_global;
   317 val string_of_typ_global = string_of_typ o init_pretty_global;
   318 val string_of_sort_global = string_of_sort o init_pretty_global;
   319 
   320 
   321 
   322 (** tables of translation functions **)
   323 
   324 (* parse (ast) translations *)
   325 
   326 fun err_dup_trfun name c =
   327   error ("More than one " ^ name ^ " for " ^ quote c);
   328 
   329 fun lookup_tr tab c = Option.map fst (Symtab.lookup tab c);
   330 
   331 fun remove_trtab trfuns = fold (Symtab.remove Syntax_Ext.eq_trfun) trfuns;
   332 
   333 fun update_trtab name trfuns tab = fold Symtab.update_new trfuns (remove_trtab trfuns tab)
   334   handle Symtab.DUP c => err_dup_trfun name c;
   335 
   336 fun merge_trtabs name tab1 tab2 = Symtab.merge Syntax_Ext.eq_trfun (tab1, tab2)
   337   handle Symtab.DUP c => err_dup_trfun name c;
   338 
   339 
   340 (* print (ast) translations *)
   341 
   342 fun apply_tr' tab c ctxt T args =
   343   let
   344     val fns = map fst (Symtab.lookup_list tab c);
   345     fun app_first [] = raise Match
   346       | app_first (f :: fs) = f ctxt T args handle Match => app_first fs;
   347   in app_first fns end;
   348 
   349 fun apply_ast_tr' tab c ctxt args =
   350   let
   351     val fns = map fst (Symtab.lookup_list tab c);
   352     fun app_first [] = raise Match
   353       | app_first (f :: fs) = f ctxt args handle Match => app_first fs;
   354   in app_first fns end;
   355 
   356 fun update_tr'tab trfuns = fold_rev (Symtab.update_list Syntax_Ext.eq_trfun) trfuns;
   357 fun remove_tr'tab trfuns = fold (Symtab.remove_list Syntax_Ext.eq_trfun) trfuns;
   358 fun merge_tr'tabs tab1 tab2 = Symtab.merge_list Syntax_Ext.eq_trfun (tab1, tab2);
   359 
   360 
   361 
   362 (** tables of translation rules **)
   363 
   364 type ruletab = (Ast.ast * Ast.ast) list Symtab.table;
   365 
   366 fun dest_ruletab tab = maps snd (Symtab.dest tab);
   367 
   368 val update_ruletab = fold_rev (fn r => Symtab.update_list (op =) (Ast.head_of_rule r, r));
   369 val remove_ruletab = fold (fn r => Symtab.remove_list (op =) (Ast.head_of_rule r, r));
   370 fun merge_ruletabs tab1 tab2 = Symtab.merge_list (op =) (tab1, tab2);
   371 
   372 
   373 
   374 (** datatype syntax **)
   375 
   376 datatype syntax =
   377   Syntax of {
   378     input: Syntax_Ext.xprod list,
   379     lexicon: Scan.lexicon,
   380     gram: Parser.gram lazy,
   381     consts: string Symtab.table,
   382     prmodes: string list,
   383     parse_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) Symtab.table,
   384     parse_ruletab: ruletab,
   385     parse_trtab: ((Proof.context -> term list -> term) * stamp) Symtab.table,
   386     print_trtab: ((Proof.context -> typ -> term list -> term) * stamp) list Symtab.table,
   387     print_ruletab: ruletab,
   388     print_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) list Symtab.table,
   389     prtabs: Printer.prtabs} * stamp;
   390 
   391 fun eq_syntax (Syntax (_, s1), Syntax (_, s2)) = s1 = s2;
   392 
   393 fun force_syntax (Syntax ({gram, ...}, _)) = ignore (Lazy.force gram);
   394 
   395 fun lookup_const (Syntax ({consts, ...}, _)) = Symtab.lookup consts;
   396 fun is_keyword (Syntax ({lexicon, ...}, _)) = Scan.is_literal lexicon o Symbol.explode;
   397 fun tokenize (Syntax ({lexicon, ...}, _)) = Lexicon.tokenize lexicon;
   398 fun parse (Syntax ({gram, ...}, _)) = Parser.parse (Lazy.force gram);
   399 
   400 fun parse_ast_translation (Syntax ({parse_ast_trtab, ...}, _)) = lookup_tr parse_ast_trtab;
   401 fun parse_translation (Syntax ({parse_trtab, ...}, _)) = lookup_tr parse_trtab;
   402 fun parse_rules (Syntax ({parse_ruletab, ...}, _)) = Symtab.lookup_list parse_ruletab;
   403 fun print_translation (Syntax ({print_trtab, ...}, _)) = apply_tr' print_trtab;
   404 fun print_rules (Syntax ({print_ruletab, ...}, _)) = Symtab.lookup_list print_ruletab;
   405 fun print_ast_translation (Syntax ({print_ast_trtab, ...}, _)) = apply_ast_tr' print_ast_trtab;
   406 
   407 fun prtabs (Syntax ({prtabs, ...}, _)) = prtabs;
   408 
   409 type mode = string * bool;
   410 val mode_default = ("", true);
   411 val mode_input = (Print_Mode.input, true);
   412 
   413 
   414 (* empty_syntax *)
   415 
   416 val empty_syntax = Syntax
   417   ({input = [],
   418     lexicon = Scan.empty_lexicon,
   419     gram = Lazy.value Parser.empty_gram,
   420     consts = Symtab.empty,
   421     prmodes = [],
   422     parse_ast_trtab = Symtab.empty,
   423     parse_ruletab = Symtab.empty,
   424     parse_trtab = Symtab.empty,
   425     print_trtab = Symtab.empty,
   426     print_ruletab = Symtab.empty,
   427     print_ast_trtab = Symtab.empty,
   428     prtabs = Printer.empty_prtabs}, stamp ());
   429 
   430 
   431 (* update_syntax *)
   432 
   433 fun update_const (c, b) tab =
   434   if c = "" orelse (b = "" andalso (Lexicon.is_marked c orelse Symtab.defined tab c))
   435   then tab
   436   else Symtab.update (c, b) tab;
   437 
   438 fun update_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
   439   let
   440     val {input, lexicon, gram, consts = consts1, prmodes, parse_ast_trtab, parse_ruletab,
   441       parse_trtab, print_trtab, print_ruletab, print_ast_trtab, prtabs} = tabs;
   442     val Syntax_Ext.Syn_Ext {xprods, consts = consts2, parse_ast_translation,
   443       parse_rules, parse_translation, print_translation, print_rules,
   444       print_ast_translation} = syn_ext;
   445     val new_xprods =
   446       if inout then distinct (op =) (filter_out (member (op =) input) xprods) else [];
   447     fun if_inout xs = if inout then xs else [];
   448   in
   449     Syntax
   450     ({input = new_xprods @ input,
   451       lexicon = fold Scan.extend_lexicon (Syntax_Ext.delims_of new_xprods) lexicon,
   452       gram = Lazy.value (Parser.extend_gram new_xprods (Lazy.force gram)),
   453       consts = fold update_const consts2 consts1,
   454       prmodes = insert (op =) mode prmodes,
   455       parse_ast_trtab =
   456         update_trtab "parse ast translation" (if_inout parse_ast_translation) parse_ast_trtab,
   457       parse_ruletab = update_ruletab (if_inout parse_rules) parse_ruletab,
   458       parse_trtab = update_trtab "parse translation" (if_inout parse_translation) parse_trtab,
   459       print_trtab = update_tr'tab print_translation print_trtab,
   460       print_ruletab = update_ruletab print_rules print_ruletab,
   461       print_ast_trtab = update_tr'tab print_ast_translation print_ast_trtab,
   462       prtabs = Printer.update_prtabs mode xprods prtabs}, stamp ())
   463   end;
   464 
   465 
   466 (* remove_syntax *)
   467 
   468 fun remove_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
   469   let
   470     val Syntax_Ext.Syn_Ext {xprods, consts = _, parse_ast_translation, parse_rules,
   471       parse_translation, print_translation, print_rules, print_ast_translation} = syn_ext;
   472     val {input, lexicon, gram, consts, prmodes, parse_ast_trtab, parse_ruletab,
   473       parse_trtab, print_trtab, print_ruletab, print_ast_trtab, prtabs} = tabs;
   474     val input' = if inout then subtract (op =) xprods input else input;
   475     val changed = length input <> length input';
   476     fun if_inout xs = if inout then xs else [];
   477   in
   478     Syntax
   479     ({input = input',
   480       lexicon = if changed then Scan.make_lexicon (Syntax_Ext.delims_of input') else lexicon,
   481       gram = if changed then Lazy.value (Parser.make_gram input') else gram,
   482       consts = consts,
   483       prmodes = prmodes,
   484       parse_ast_trtab = remove_trtab (if_inout parse_ast_translation) parse_ast_trtab,
   485       parse_ruletab = remove_ruletab (if_inout parse_rules) parse_ruletab,
   486       parse_trtab = remove_trtab (if_inout parse_translation) parse_trtab,
   487       print_trtab = remove_tr'tab print_translation print_trtab,
   488       print_ruletab = remove_ruletab print_rules print_ruletab,
   489       print_ast_trtab = remove_tr'tab print_ast_translation print_ast_trtab,
   490       prtabs = Printer.remove_prtabs mode xprods prtabs}, stamp ())
   491   end;
   492 
   493 
   494 (* merge_syntax *)
   495 
   496 fun merge_syntax (Syntax (tabs1, _), Syntax (tabs2, _)) =
   497   let
   498     val {input = input1, lexicon = lexicon1, gram = gram1, consts = consts1,
   499       prmodes = prmodes1, parse_ast_trtab = parse_ast_trtab1, parse_ruletab = parse_ruletab1,
   500       parse_trtab = parse_trtab1, print_trtab = print_trtab1, print_ruletab = print_ruletab1,
   501       print_ast_trtab = print_ast_trtab1, prtabs = prtabs1} = tabs1;
   502 
   503     val {input = input2, lexicon = lexicon2, gram = gram2, consts = consts2,
   504       prmodes = prmodes2, parse_ast_trtab = parse_ast_trtab2, parse_ruletab = parse_ruletab2,
   505       parse_trtab = parse_trtab2, print_trtab = print_trtab2, print_ruletab = print_ruletab2,
   506       print_ast_trtab = print_ast_trtab2, prtabs = prtabs2} = tabs2;
   507 
   508     val (input', gram') =
   509       (case subtract (op =) input1 input2 of
   510         [] => (input1, gram1)
   511       | new_xprods2 =>
   512           if subset (op =) (input1, input2) then (input2, gram2)
   513           else
   514             let
   515               val input' = new_xprods2 @ input1;
   516               val gram' = Lazy.lazy (fn () => Parser.make_gram input');
   517             in (input', gram') end);
   518   in
   519     Syntax
   520     ({input = input',
   521       lexicon = Scan.merge_lexicons (lexicon1, lexicon2),
   522       gram = gram',
   523       consts = Symtab.merge (K true) (consts1, consts2),
   524       prmodes = Library.merge (op =) (prmodes1, prmodes2),
   525       parse_ast_trtab =
   526         merge_trtabs "parse ast translation" parse_ast_trtab1 parse_ast_trtab2,
   527       parse_ruletab = merge_ruletabs parse_ruletab1 parse_ruletab2,
   528       parse_trtab = merge_trtabs "parse translation" parse_trtab1 parse_trtab2,
   529       print_trtab = merge_tr'tabs print_trtab1 print_trtab2,
   530       print_ruletab = merge_ruletabs print_ruletab1 print_ruletab2,
   531       print_ast_trtab = merge_tr'tabs print_ast_trtab1 print_ast_trtab2,
   532       prtabs = Printer.merge_prtabs prtabs1 prtabs2}, stamp ())
   533   end;
   534 
   535 
   536 (* basic syntax *)
   537 
   538 val token_markers =
   539   ["_tfree", "_tvar", "_free", "_bound", "_loose", "_var", "_numeral", "_inner_string"];
   540 
   541 val basic_nonterms =
   542   Lexicon.terminals @ ["logic", "type", "types", "sort", "classes",
   543     "args", "cargs", "pttrn", "pttrns", "idt", "idts", "aprop", "asms",
   544     "any", "prop'", "num_const", "float_const", "xnum_const", "num_position",
   545     "float_position", "xnum_position", "index", "struct", "tid_position",
   546     "tvar_position", "id_position", "longid_position", "str_position",
   547     "type_name", "class_name"];
   548 
   549 
   550 
   551 (** print syntax **)
   552 
   553 local
   554 
   555 fun pretty_strs_qs name strs =
   556   Pretty.strs (name :: map quote (sort_strings strs));
   557 
   558 fun pretty_gram (Syntax (tabs, _)) =
   559   let
   560     val {lexicon, prmodes, gram, ...} = tabs;
   561     val prmodes' = sort_strings (filter_out (fn s => s = "") prmodes);
   562   in
   563     [pretty_strs_qs "lexicon:" (Scan.dest_lexicon lexicon),
   564       Pretty.big_list "prods:" (Parser.pretty_gram (Lazy.force gram)),
   565       pretty_strs_qs "print modes:" prmodes']
   566   end;
   567 
   568 fun pretty_trans (Syntax (tabs, _)) =
   569   let
   570     fun pretty_tab name tab =
   571       pretty_strs_qs name (sort_strings (Symtab.keys tab));
   572 
   573     fun pretty_ruletab name tab =
   574       Pretty.big_list name (map Ast.pretty_rule (dest_ruletab tab));
   575 
   576     val {consts, parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab,
   577       print_ruletab, print_ast_trtab, ...} = tabs;
   578   in
   579    [pretty_tab "consts:" consts,
   580     pretty_tab "parse_ast_translation:" parse_ast_trtab,
   581     pretty_ruletab "parse_rules:" parse_ruletab,
   582     pretty_tab "parse_translation:" parse_trtab,
   583     pretty_tab "print_translation:" print_trtab,
   584     pretty_ruletab "print_rules:" print_ruletab,
   585     pretty_tab "print_ast_translation:" print_ast_trtab]
   586   end;
   587 
   588 in
   589 
   590 fun print_gram syn = Pretty.writeln (Pretty.chunks (pretty_gram syn));
   591 fun print_trans syn = Pretty.writeln (Pretty.chunks (pretty_trans syn));
   592 fun print_syntax syn = Pretty.writeln (Pretty.chunks (pretty_gram syn @ pretty_trans syn));
   593 
   594 end;
   595 
   596 
   597 (* reconstructing infixes -- educated guessing *)
   598 
   599 fun guess_infix (Syntax ({gram, ...}, _)) c =
   600   (case Parser.guess_infix_lr (Lazy.force gram) c of
   601     SOME (s, l, r, j) => SOME
   602      (if l then Mixfix.Infixl (s, j)
   603       else if r then Mixfix.Infixr (s, j)
   604       else Mixfix.Infix (s, j))
   605   | NONE => NONE);
   606 
   607 
   608 
   609 (** prepare translation rules **)
   610 
   611 (* rules *)
   612 
   613 datatype 'a trrule =
   614   Parse_Rule of 'a * 'a |
   615   Print_Rule of 'a * 'a |
   616   Parse_Print_Rule of 'a * 'a;
   617 
   618 fun map_trrule f (Parse_Rule (x, y)) = Parse_Rule (f x, f y)
   619   | map_trrule f (Print_Rule (x, y)) = Print_Rule (f x, f y)
   620   | map_trrule f (Parse_Print_Rule (x, y)) = Parse_Print_Rule (f x, f y);
   621 
   622 fun parse_rule (Parse_Rule pats) = SOME pats
   623   | parse_rule (Print_Rule _) = NONE
   624   | parse_rule (Parse_Print_Rule pats) = SOME pats;
   625 
   626 fun print_rule (Parse_Rule _) = NONE
   627   | print_rule (Print_Rule pats) = SOME (swap pats)
   628   | print_rule (Parse_Print_Rule pats) = SOME (swap pats);
   629 
   630 
   631 (* check_rules *)
   632 
   633 local
   634 
   635 fun check_rule rule =
   636   (case Ast.rule_error rule of
   637     SOME msg =>
   638       error ("Error in syntax translation rule: " ^ msg ^ "\n" ^
   639         Pretty.string_of (Ast.pretty_rule rule))
   640   | NONE => rule);
   641 
   642 in
   643 
   644 fun check_rules rules =
   645  (map check_rule (map_filter parse_rule rules),
   646   map check_rule (map_filter print_rule rules));
   647 
   648 end;
   649 
   650 
   651 
   652 (** modify syntax **)
   653 
   654 fun ext_syntax f decls = update_syntax mode_default (f decls);
   655 
   656 val update_trfuns = ext_syntax Syntax_Ext.syn_ext_trfuns;
   657 val update_advanced_trfuns = ext_syntax Syntax_Ext.syn_ext_advanced_trfuns;
   658 
   659 fun update_type_gram add prmode decls =
   660   (if add then update_syntax else remove_syntax) prmode (Mixfix.syn_ext_types decls);
   661 
   662 fun update_const_gram add is_logtype prmode decls =
   663   (if add then update_syntax else remove_syntax) prmode (Mixfix.syn_ext_consts is_logtype decls);
   664 
   665 val update_trrules = ext_syntax Syntax_Ext.syn_ext_rules o check_rules;
   666 val remove_trrules = remove_syntax mode_default o Syntax_Ext.syn_ext_rules o check_rules;
   667 
   668 
   669 open Lexicon.Syntax;
   670 
   671 end;
   672