wenzelm@18: (*  Title:      Pure/Syntax/syntax.ML
clasohm@0:     Author:     Tobias Nipkow and Markus Wenzel, TU Muenchen
wenzelm@18: 
wenzelm@24263: Standard Isabelle syntax, based on arbitrary context-free grammars
wenzelm@24263: (specified by mixfix declarations).
clasohm@0: *)
clasohm@0: 
clasohm@0: signature SYNTAX =
wenzelm@2383: sig
wenzelm@42382:   type operations
wenzelm@42382:   val install_operations: operations -> unit
wenzelm@42288:   val root: string Config.T
wenzelm@46512:   val ambiguity_warning_raw: Config.raw
wenzelm@46512:   val ambiguity_warning: bool Config.T
wenzelm@46506:   val ambiguity_limit_raw: Config.raw
wenzelm@42268:   val ambiguity_limit: int Config.T
wenzelm@30573:   val read_token: string -> Symbol_Pos.T list * Position.T
wenzelm@43731:   val parse_token: Proof.context -> (XML.tree list -> 'a) ->
wenzelm@43731:     Markup.T -> (Symbol_Pos.T list * Position.T -> 'a) -> string -> 'a
wenzelm@24263:   val parse_sort: Proof.context -> string -> sort
wenzelm@24263:   val parse_typ: Proof.context -> string -> typ
wenzelm@24263:   val parse_term: Proof.context -> string -> term
wenzelm@24263:   val parse_prop: Proof.context -> string -> term
wenzelm@24768:   val unparse_sort: Proof.context -> sort -> Pretty.T
wenzelm@24923:   val unparse_classrel: Proof.context -> class list -> Pretty.T
wenzelm@24923:   val unparse_arity: Proof.context -> arity -> Pretty.T
wenzelm@24768:   val unparse_typ: Proof.context -> typ -> Pretty.T
wenzelm@24768:   val unparse_term: Proof.context -> term -> Pretty.T
wenzelm@24488:   val check_sort: Proof.context -> sort -> sort
wenzelm@24512:   val check_typ: Proof.context -> typ -> typ
wenzelm@24512:   val check_term: Proof.context -> term -> term
wenzelm@24512:   val check_prop: Proof.context -> term -> term
wenzelm@24488:   val check_typs: Proof.context -> typ list -> typ list
wenzelm@24263:   val check_terms: Proof.context -> term list -> term list
wenzelm@24263:   val check_props: Proof.context -> term list -> term list
wenzelm@24923:   val uncheck_sort: Proof.context -> sort -> sort
wenzelm@24923:   val uncheck_arity: Proof.context -> arity -> arity
wenzelm@24923:   val uncheck_classrel: Proof.context -> class list -> class list
wenzelm@24768:   val uncheck_typs: Proof.context -> typ list -> typ list
wenzelm@24768:   val uncheck_terms: Proof.context -> term list -> term list
wenzelm@24263:   val read_sort: Proof.context -> string -> sort
wenzelm@24263:   val read_typ: Proof.context -> string -> typ
wenzelm@24488:   val read_term: Proof.context -> string -> term
wenzelm@24488:   val read_prop: Proof.context -> string -> term
wenzelm@24263:   val read_terms: Proof.context -> string list -> term list
wenzelm@24263:   val read_props: Proof.context -> string list -> term list
wenzelm@24709:   val read_sort_global: theory -> string -> sort
wenzelm@24709:   val read_typ_global: theory -> string -> typ
wenzelm@24709:   val read_term_global: theory -> string -> term
wenzelm@24709:   val read_prop_global: theory -> string -> term
wenzelm@24923:   val pretty_term: Proof.context -> term -> Pretty.T
wenzelm@24923:   val pretty_typ: Proof.context -> typ -> Pretty.T
wenzelm@24923:   val pretty_sort: Proof.context -> sort -> Pretty.T
wenzelm@24923:   val pretty_classrel: Proof.context -> class list -> Pretty.T
wenzelm@24923:   val pretty_arity: Proof.context -> arity -> Pretty.T
wenzelm@24923:   val string_of_term: Proof.context -> term -> string
wenzelm@24923:   val string_of_typ: Proof.context -> typ -> string
wenzelm@24923:   val string_of_sort: Proof.context -> sort -> string
wenzelm@24923:   val string_of_classrel: Proof.context -> class list -> string
wenzelm@24923:   val string_of_arity: Proof.context -> arity -> string
wenzelm@26951:   val is_pretty_global: Proof.context -> bool
wenzelm@26951:   val set_pretty_global: bool -> Proof.context -> Proof.context
wenzelm@26951:   val init_pretty_global: theory -> Proof.context
wenzelm@42383:   val init_pretty: Context.pretty -> Proof.context
wenzelm@26951:   val pretty_term_global: theory -> term -> Pretty.T
wenzelm@26951:   val pretty_typ_global: theory -> typ -> Pretty.T
wenzelm@26951:   val pretty_sort_global: theory -> sort -> Pretty.T
wenzelm@26951:   val string_of_term_global: theory -> term -> string
wenzelm@26951:   val string_of_typ_global: theory -> typ -> string
wenzelm@26951:   val string_of_sort_global: theory -> sort -> string
wenzelm@39135:   type syntax
wenzelm@39135:   val eq_syntax: syntax * syntax -> bool
wenzelm@45632:   val force_syntax: syntax -> unit
wenzelm@42298:   val lookup_const: syntax -> string -> string option
wenzelm@39135:   val is_keyword: syntax -> string -> bool
wenzelm@42251:   val tokenize: syntax -> bool -> Symbol_Pos.T list -> Lexicon.token list
wenzelm@45641:   val parse: syntax -> string -> Lexicon.token list -> Parser.parsetree list
wenzelm@42253:   val parse_ast_translation: syntax -> string -> (Proof.context -> Ast.ast list -> Ast.ast) option
wenzelm@42255:   val parse_rules: syntax -> string -> (Ast.ast * Ast.ast) list
wenzelm@42253:   val parse_translation: syntax -> string -> (Proof.context -> term list -> term) option
wenzelm@42254:   val print_translation: syntax -> string ->
wenzelm@42254:     Proof.context -> typ -> term list -> term  (*exception Match*)
wenzelm@42255:   val print_rules: syntax -> string -> (Ast.ast * Ast.ast) list
wenzelm@42254:   val print_ast_translation: syntax -> string ->
wenzelm@42254:     Proof.context -> Ast.ast list -> Ast.ast  (*exception Match*)
wenzelm@42255:   val prtabs: syntax -> Printer.prtabs
wenzelm@39135:   type mode
wenzelm@39135:   val mode_default: mode
wenzelm@39135:   val mode_input: mode
wenzelm@42294:   val empty_syntax: syntax
wenzelm@45632:   val merge_syntax: syntax * syntax -> syntax
wenzelm@42294:   val token_markers: string list
wenzelm@39135:   val basic_nonterms: string list
wenzelm@39135:   val print_gram: syntax -> unit
wenzelm@39135:   val print_trans: syntax -> unit
wenzelm@39135:   val print_syntax: syntax -> unit
wenzelm@39135:   val guess_infix: syntax -> string -> mixfix option
wenzelm@39135:   datatype 'a trrule =
wenzelm@42204:     Parse_Rule of 'a * 'a |
wenzelm@42204:     Print_Rule of 'a * 'a |
wenzelm@42204:     Parse_Print_Rule of 'a * 'a
wenzelm@39135:   val map_trrule: ('a -> 'b) -> 'a trrule -> 'b trrule
wenzelm@39135:   val update_trfuns:
wenzelm@42224:     (string * ((Ast.ast list -> Ast.ast) * stamp)) list *
wenzelm@39135:     (string * ((term list -> term) * stamp)) list *
wenzelm@42247:     (string * ((typ -> term list -> term) * stamp)) list *
wenzelm@42224:     (string * ((Ast.ast list -> Ast.ast) * stamp)) list -> syntax -> syntax
wenzelm@39135:   val update_advanced_trfuns:
wenzelm@42224:     (string * ((Proof.context -> Ast.ast list -> Ast.ast) * stamp)) list *
wenzelm@39135:     (string * ((Proof.context -> term list -> term) * stamp)) list *
wenzelm@42247:     (string * ((Proof.context -> typ -> term list -> term) * stamp)) list *
wenzelm@42224:     (string * ((Proof.context -> Ast.ast list -> Ast.ast) * stamp)) list -> syntax -> syntax
wenzelm@39135:   val update_type_gram: bool -> mode -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@39135:   val update_const_gram: bool -> (string -> bool) ->
wenzelm@39135:     mode -> (string * typ * mixfix) list -> syntax -> syntax
wenzelm@42224:   val update_trrules: Ast.ast trrule list -> syntax -> syntax
wenzelm@42224:   val remove_trrules: Ast.ast trrule list -> syntax -> syntax
wenzelm@42476:   val const: string -> term
wenzelm@42476:   val free: string -> term
wenzelm@42476:   val var: indexname -> term
wenzelm@2383: end;
clasohm@0: 
wenzelm@12094: structure Syntax: SYNTAX =
clasohm@0: struct
clasohm@0: 
wenzelm@42288: 
wenzelm@39135: (** inner syntax operations **)
wenzelm@39135: 
wenzelm@42382: (* back-patched operations *)
wenzelm@42382: 
wenzelm@42382: type operations =
wenzelm@42382:  {parse_sort: Proof.context -> string -> sort,
wenzelm@42382:   parse_typ: Proof.context -> string -> typ,
wenzelm@42382:   parse_term: Proof.context -> string -> term,
wenzelm@42382:   parse_prop: Proof.context -> string -> term,
wenzelm@42382:   unparse_sort: Proof.context -> sort -> Pretty.T,
wenzelm@42382:   unparse_typ: Proof.context -> typ -> Pretty.T,
wenzelm@42382:   unparse_term: Proof.context -> term -> Pretty.T,
wenzelm@42382:   check_typs: Proof.context -> typ list -> typ list,
wenzelm@42382:   check_terms: Proof.context -> term list -> term list,
wenzelm@42382:   check_props: Proof.context -> term list -> term list,
wenzelm@42382:   uncheck_typs: Proof.context -> typ list -> typ list,
wenzelm@42382:   uncheck_terms: Proof.context -> term list -> term list};
wenzelm@42382: 
wenzelm@42382: val operations: operations Single_Assignment.var = Single_Assignment.var "Syntax.operations";
wenzelm@42382: fun install_operations ops = Single_Assignment.assign operations ops;
wenzelm@42382: 
wenzelm@42382: fun operation which ctxt x =
wenzelm@42382:   (case Single_Assignment.peek operations of
wenzelm@42382:     NONE => raise Fail "Inner syntax operations not installed"
wenzelm@42382:   | SOME ops => which ops ctxt x);
wenzelm@42382: 
wenzelm@42382: 
wenzelm@42268: (* configuration options *)
wenzelm@42268: 
wenzelm@42293: val root = Config.string (Config.declare "syntax_root" (K (Config.String "any")));
wenzelm@42288: 
wenzelm@46512: val ambiguity_warning_raw = Config.declare "syntax_ambiguity_warning" (fn _ => Config.Bool true);
wenzelm@46512: val ambiguity_warning = Config.bool ambiguity_warning_raw;
wenzelm@42268: 
wenzelm@46506: val ambiguity_limit_raw = Config.declare "syntax_ambiguity_limit" (fn _ => Config.Int 10);
wenzelm@46506: val ambiguity_limit = Config.int ambiguity_limit_raw;
kleing@44069: 
wenzelm@42268: 
wenzelm@43731: (* outer syntax token -- with optional YXML content *)
wenzelm@39135: 
wenzelm@43731: fun explode_token tree =
wenzelm@39135:   let
wenzelm@39555:     val text = XML.content_of [tree];
wenzelm@39135:     val pos =
wenzelm@39135:       (case tree of
wenzelm@39135:         XML.Elem ((name, props), _) =>
wenzelm@45666:           if name = Isabelle_Markup.tokenN then Position.of_properties props
wenzelm@39135:           else Position.none
wenzelm@39135:       | XML.Text _ => Position.none);
wenzelm@39135:   in (Symbol_Pos.explode (text, pos), pos) end;
wenzelm@39135: 
wenzelm@43731: fun read_token str = explode_token (YXML.parse str handle Fail msg => error msg);
wenzelm@43731: 
wenzelm@43731: fun parse_token ctxt decode markup parse str =
wenzelm@43731:   let
wenzelm@43731:     fun parse_tree tree =
wenzelm@43731:       let
wenzelm@43731:         val (syms, pos) = explode_token tree;
wenzelm@43731:         val _ = Context_Position.report ctxt pos markup;
wenzelm@43731:       in parse (syms, pos) end;
wenzelm@43731:   in
wenzelm@43731:     (case YXML.parse_body str handle Fail msg => error msg of
wenzelm@43731:       body as [tree as XML.Elem ((name, _), _)] =>
wenzelm@45666:         if name = Isabelle_Markup.tokenN then parse_tree tree else decode body
wenzelm@43731:     | [tree as XML.Text _] => parse_tree tree
wenzelm@43731:     | body => decode body)
wenzelm@43731:   end;
wenzelm@43731: 
wenzelm@39135: 
wenzelm@39135: (* (un)parsing *)
wenzelm@39135: 
wenzelm@39135: val parse_sort = operation #parse_sort;
wenzelm@39135: val parse_typ = operation #parse_typ;
wenzelm@39135: val parse_term = operation #parse_term;
wenzelm@39135: val parse_prop = operation #parse_prop;
wenzelm@39135: val unparse_sort = operation #unparse_sort;
wenzelm@39135: val unparse_typ = operation #unparse_typ;
wenzelm@39135: val unparse_term = operation #unparse_term;
wenzelm@39135: 
wenzelm@39135: 
wenzelm@45429: (* (un)checking *)
wenzelm@42382: 
wenzelm@42382: val check_typs = operation #check_typs;
wenzelm@42382: val check_terms = operation #check_terms;
wenzelm@42382: val check_props = operation #check_props;
wenzelm@39135: 
wenzelm@39135: val check_typ = singleton o check_typs;
wenzelm@39135: val check_term = singleton o check_terms;
wenzelm@39135: val check_prop = singleton o check_props;
wenzelm@39135: 
wenzelm@42382: val uncheck_typs = operation #uncheck_typs;
wenzelm@42382: val uncheck_terms = operation #uncheck_terms;
wenzelm@42402: 
wenzelm@42402: 
wenzelm@42402: (* derived operations for algebra of sorts *)
wenzelm@42402: 
wenzelm@42402: local
wenzelm@42402: 
wenzelm@42402: fun map_sort f S =
wenzelm@42402:   (case f (TFree ("", S)) of
wenzelm@42402:     TFree ("", S') => S'
wenzelm@42402:   | _ => raise TYPE ("map_sort", [TFree ("", S)], []));
wenzelm@42402: 
wenzelm@42402: in
wenzelm@42402: 
wenzelm@42402: val check_sort = map_sort o check_typ;
wenzelm@39135: val uncheck_sort = map_sort o singleton o uncheck_typs;
wenzelm@39135: 
wenzelm@39135: end;
wenzelm@39135: 
wenzelm@39135: 
wenzelm@39135: val uncheck_classrel = map o singleton o uncheck_sort;
wenzelm@39135: 
wenzelm@39135: fun unparse_classrel ctxt cs = Pretty.block (flat
wenzelm@39135:   (separate [Pretty.str " <", Pretty.brk 1] (map (single o unparse_sort ctxt o single) cs)));
wenzelm@39135: 
wenzelm@39135: fun uncheck_arity ctxt (a, Ss, S) =
wenzelm@39135:   let
wenzelm@39135:     val T = Type (a, replicate (length Ss) dummyT);
wenzelm@39135:     val a' =
wenzelm@39135:       (case singleton (uncheck_typs ctxt) T of
wenzelm@39135:         Type (a', _) => a'
wenzelm@39135:       | T => raise TYPE ("uncheck_arity", [T], []));
wenzelm@39135:     val Ss' = map (uncheck_sort ctxt) Ss;
wenzelm@39135:     val S' = uncheck_sort ctxt S;
wenzelm@39135:   in (a', Ss', S') end;
wenzelm@39135: 
wenzelm@39135: fun unparse_arity ctxt (a, Ss, S) =
wenzelm@39135:   let
wenzelm@39135:     val prtT = unparse_typ ctxt (Type (a, []));
wenzelm@39135:     val dom =
wenzelm@39135:       if null Ss then []
wenzelm@39135:       else [Pretty.list "(" ")" (map (unparse_sort ctxt) Ss), Pretty.brk 1];
wenzelm@39135:   in Pretty.block ([prtT, Pretty.str " ::", Pretty.brk 1] @ dom @ [unparse_sort ctxt S]) end;
wenzelm@39135: 
wenzelm@39135: 
wenzelm@39135: (* read = parse + check *)
wenzelm@39135: 
wenzelm@39135: fun read_sort ctxt = parse_sort ctxt #> check_sort ctxt;
wenzelm@39135: fun read_typ ctxt = parse_typ ctxt #> singleton (check_typs ctxt);
wenzelm@39135: 
wenzelm@43558: fun read_terms ctxt = Par_List.map_name "Syntax.read_terms" (parse_term ctxt) #> check_terms ctxt;
wenzelm@43558: fun read_props ctxt = Par_List.map_name "Syntax.read_props" (parse_prop ctxt) #> check_props ctxt;
wenzelm@39135: 
wenzelm@39135: val read_term = singleton o read_terms;
wenzelm@39135: val read_prop = singleton o read_props;
wenzelm@39135: 
wenzelm@42360: val read_sort_global = read_sort o Proof_Context.init_global;
wenzelm@42360: val read_typ_global = read_typ o Proof_Context.init_global;
wenzelm@42360: val read_term_global = read_term o Proof_Context.init_global;
wenzelm@42360: val read_prop_global = read_prop o Proof_Context.init_global;
wenzelm@39135: 
wenzelm@39135: 
wenzelm@39135: (* pretty = uncheck + unparse *)
wenzelm@39135: 
wenzelm@39135: fun pretty_term ctxt = singleton (uncheck_terms ctxt) #> unparse_term ctxt;
wenzelm@39135: fun pretty_typ ctxt = singleton (uncheck_typs ctxt) #> unparse_typ ctxt;
wenzelm@39135: fun pretty_sort ctxt = uncheck_sort ctxt #> unparse_sort ctxt;
wenzelm@39135: fun pretty_classrel ctxt = uncheck_classrel ctxt #> unparse_classrel ctxt;
wenzelm@39135: fun pretty_arity ctxt = uncheck_arity ctxt #> unparse_arity ctxt;
wenzelm@39135: 
wenzelm@39135: val string_of_term = Pretty.string_of oo pretty_term;
wenzelm@39135: val string_of_typ = Pretty.string_of oo pretty_typ;
wenzelm@39135: val string_of_sort = Pretty.string_of oo pretty_sort;
wenzelm@39135: val string_of_classrel = Pretty.string_of oo pretty_classrel;
wenzelm@39135: val string_of_arity = Pretty.string_of oo pretty_arity;
wenzelm@39135: 
wenzelm@39135: 
wenzelm@39135: (* global pretty printing *)
wenzelm@39135: 
wenzelm@39508: val pretty_global = Config.bool (Config.declare "Syntax.pretty_global" (K (Config.Bool false)));
wenzelm@39508: fun is_pretty_global ctxt = Config.get ctxt pretty_global;
wenzelm@39508: val set_pretty_global = Config.put pretty_global;
wenzelm@42360: val init_pretty_global = set_pretty_global true o Proof_Context.init_global;
wenzelm@42383: val init_pretty = Context.pretty_context init_pretty_global;
wenzelm@39135: 
wenzelm@39135: val pretty_term_global = pretty_term o init_pretty_global;
wenzelm@39135: val pretty_typ_global = pretty_typ o init_pretty_global;
wenzelm@39135: val pretty_sort_global = pretty_sort o init_pretty_global;
wenzelm@39135: 
wenzelm@39135: val string_of_term_global = string_of_term o init_pretty_global;
wenzelm@39135: val string_of_typ_global = string_of_typ o init_pretty_global;
wenzelm@39135: val string_of_sort_global = string_of_sort o init_pretty_global;
wenzelm@39135: 
wenzelm@39135: 
wenzelm@39135: 
wenzelm@237: (** tables of translation functions **)
wenzelm@237: 
wenzelm@5692: (* parse (ast) translations *)
wenzelm@5692: 
wenzelm@23655: fun err_dup_trfun name c =
wenzelm@23655:   error ("More than one " ^ name ^ " for " ^ quote c);
wenzelm@237: 
wenzelm@42253: fun lookup_tr tab c = Option.map fst (Symtab.lookup tab c);
wenzelm@42253: 
wenzelm@42288: fun remove_trtab trfuns = fold (Symtab.remove Syntax_Ext.eq_trfun) trfuns;
wenzelm@21536: 
haftmann@29004: fun update_trtab name trfuns tab = fold Symtab.update_new trfuns (remove_trtab trfuns tab)
wenzelm@23655:   handle Symtab.DUP c => err_dup_trfun name c;
wenzelm@237: 
wenzelm@42288: fun merge_trtabs name tab1 tab2 = Symtab.merge Syntax_Ext.eq_trfun (tab1, tab2)
wenzelm@23655:   handle Symtab.DUP c => err_dup_trfun name c;
wenzelm@237: 
wenzelm@237: 
wenzelm@5692: (* print (ast) translations *)
wenzelm@5692: 
wenzelm@42254: fun apply_tr' tab c ctxt T args =
wenzelm@42254:   let
wenzelm@42254:     val fns = map fst (Symtab.lookup_list tab c);
wenzelm@42254:     fun app_first [] = raise Match
wenzelm@42254:       | app_first (f :: fs) = f ctxt T args handle Match => app_first fs;
wenzelm@42254:   in app_first fns end;
wenzelm@42254: 
wenzelm@42254: fun apply_ast_tr' tab c ctxt args =
wenzelm@42254:   let
wenzelm@42254:     val fns = map fst (Symtab.lookup_list tab c);
wenzelm@42254:     fun app_first [] = raise Match
wenzelm@42254:       | app_first (f :: fs) = f ctxt args handle Match => app_first fs;
wenzelm@42254:   in app_first fns end;
wenzelm@42253: 
wenzelm@42288: fun update_tr'tab trfuns = fold_rev (Symtab.update_list Syntax_Ext.eq_trfun) trfuns;
wenzelm@42288: fun remove_tr'tab trfuns = fold (Symtab.remove_list Syntax_Ext.eq_trfun) trfuns;
wenzelm@42288: fun merge_tr'tabs tab1 tab2 = Symtab.merge_list Syntax_Ext.eq_trfun (tab1, tab2);
wenzelm@5692: 
wenzelm@5692: 
wenzelm@237: 
wenzelm@237: (** tables of translation rules **)
wenzelm@237: 
wenzelm@5692: type ruletab = (Ast.ast * Ast.ast) list Symtab.table;
wenzelm@237: 
wenzelm@19482: fun dest_ruletab tab = maps snd (Symtab.dest tab);
wenzelm@237: 
wenzelm@25394: val update_ruletab = fold_rev (fn r => Symtab.update_list (op =) (Ast.head_of_rule r, r));
wenzelm@18931: val remove_ruletab = fold (fn r => Symtab.remove_list (op =) (Ast.head_of_rule r, r));
wenzelm@18931: fun merge_ruletabs tab1 tab2 = Symtab.merge_list (op =) (tab1, tab2);
clasohm@0: 
clasohm@0: 
clasohm@0: 
clasohm@0: (** datatype syntax **)
clasohm@0: 
wenzelm@237: datatype syntax =
wenzelm@237:   Syntax of {
wenzelm@42288:     input: Syntax_Ext.xprod list,
wenzelm@4703:     lexicon: Scan.lexicon,
wenzelm@45632:     gram: Parser.gram lazy,
wenzelm@42298:     consts: string Symtab.table,
wenzelm@2913:     prmodes: string list,
wenzelm@21772:     parse_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) Symtab.table,
wenzelm@237:     parse_ruletab: ruletab,
wenzelm@21772:     parse_trtab: ((Proof.context -> term list -> term) * stamp) Symtab.table,
wenzelm@42247:     print_trtab: ((Proof.context -> typ -> term list -> term) * stamp) list Symtab.table,
wenzelm@237:     print_ruletab: ruletab,
wenzelm@21772:     print_ast_trtab: ((Proof.context -> Ast.ast list -> Ast.ast) * stamp) list Symtab.table,
wenzelm@17079:     prtabs: Printer.prtabs} * stamp;
clasohm@0: 
wenzelm@17079: fun eq_syntax (Syntax (_, s1), Syntax (_, s2)) = s1 = s2;
wenzelm@17079: 
wenzelm@45632: fun force_syntax (Syntax ({gram, ...}, _)) = ignore (Lazy.force gram);
wenzelm@44802: 
wenzelm@42298: fun lookup_const (Syntax ({consts, ...}, _)) = Symtab.lookup consts;
wenzelm@17079: fun is_keyword (Syntax ({lexicon, ...}, _)) = Scan.is_literal lexicon o Symbol.explode;
wenzelm@42251: fun tokenize (Syntax ({lexicon, ...}, _)) = Lexicon.tokenize lexicon;
wenzelm@45641: fun parse (Syntax ({gram, ...}, _)) = Parser.parse (Lazy.force gram);
wenzelm@14687: 
wenzelm@42253: fun parse_ast_translation (Syntax ({parse_ast_trtab, ...}, _)) = lookup_tr parse_ast_trtab;
wenzelm@42253: fun parse_translation (Syntax ({parse_trtab, ...}, _)) = lookup_tr parse_trtab;
wenzelm@42255: fun parse_rules (Syntax ({parse_ruletab, ...}, _)) = Symtab.lookup_list parse_ruletab;
wenzelm@42254: fun print_translation (Syntax ({print_trtab, ...}, _)) = apply_tr' print_trtab;
wenzelm@42255: fun print_rules (Syntax ({print_ruletab, ...}, _)) = Symtab.lookup_list print_ruletab;
wenzelm@42254: fun print_ast_translation (Syntax ({print_ast_trtab, ...}, _)) = apply_ast_tr' print_ast_trtab;
wenzelm@42253: 
wenzelm@42255: fun prtabs (Syntax ({prtabs, ...}, _)) = prtabs;
wenzelm@42255: 
wenzelm@20784: type mode = string * bool;
wenzelm@24970: val mode_default = ("", true);
wenzelm@37146: val mode_input = (Print_Mode.input, true);
wenzelm@15755: 
wenzelm@18: 
wenzelm@237: (* empty_syntax *)
wenzelm@18: 
wenzelm@17079: val empty_syntax = Syntax
wenzelm@17079:   ({input = [],
wenzelm@4703:     lexicon = Scan.empty_lexicon,
wenzelm@45632:     gram = Lazy.value Parser.empty_gram,
wenzelm@42298:     consts = Symtab.empty,
wenzelm@2913:     prmodes = [],
wenzelm@5692:     parse_ast_trtab = Symtab.empty,
wenzelm@5692:     parse_ruletab = Symtab.empty,
wenzelm@5692:     parse_trtab = Symtab.empty,
wenzelm@5692:     print_trtab = Symtab.empty,
wenzelm@5692:     print_ruletab = Symtab.empty,
wenzelm@5692:     print_ast_trtab = Symtab.empty,
wenzelm@17079:     prtabs = Printer.empty_prtabs}, stamp ());
wenzelm@167: 
wenzelm@167: 
wenzelm@25394: (* update_syntax *)
wenzelm@167: 
wenzelm@42298: fun update_const (c, b) tab =
wenzelm@42298:   if c = "" orelse (b = "" andalso (Lexicon.is_marked c orelse Symtab.defined tab c))
wenzelm@42298:   then tab
wenzelm@42298:   else Symtab.update (c, b) tab;
wenzelm@42298: 
wenzelm@25394: fun update_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
wenzelm@167:   let
wenzelm@42268:     val {input, lexicon, gram, consts = consts1, prmodes, parse_ast_trtab, parse_ruletab,
wenzelm@42268:       parse_trtab, print_trtab, print_ruletab, print_ast_trtab, prtabs} = tabs;
wenzelm@42288:     val Syntax_Ext.Syn_Ext {xprods, consts = consts2, parse_ast_translation,
wenzelm@42268:       parse_rules, parse_translation, print_translation, print_rules,
wenzelm@42268:       print_ast_translation} = syn_ext;
wenzelm@36208:     val new_xprods =
wenzelm@36208:       if inout then distinct (op =) (filter_out (member (op =) input) xprods) else [];
wenzelm@19546:     fun if_inout xs = if inout then xs else [];
wenzelm@167:   in
wenzelm@17079:     Syntax
wenzelm@36208:     ({input = new_xprods @ input,
wenzelm@42288:       lexicon = fold Scan.extend_lexicon (Syntax_Ext.delims_of new_xprods) lexicon,
wenzelm@45632:       gram = Lazy.value (Parser.extend_gram new_xprods (Lazy.force gram)),
wenzelm@42298:       consts = fold update_const consts2 consts1,
wenzelm@42268:       prmodes = insert (op =) mode prmodes,
wenzelm@167:       parse_ast_trtab =
wenzelm@25394:         update_trtab "parse ast translation" (if_inout parse_ast_translation) parse_ast_trtab,
wenzelm@25394:       parse_ruletab = update_ruletab (if_inout parse_rules) parse_ruletab,
wenzelm@25394:       parse_trtab = update_trtab "parse translation" (if_inout parse_translation) parse_trtab,
wenzelm@25394:       print_trtab = update_tr'tab print_translation print_trtab,
wenzelm@25394:       print_ruletab = update_ruletab print_rules print_ruletab,
wenzelm@25394:       print_ast_trtab = update_tr'tab print_ast_translation print_ast_trtab,
wenzelm@25394:       prtabs = Printer.update_prtabs mode xprods prtabs}, stamp ())
wenzelm@18:   end;
wenzelm@18: 
wenzelm@15755: 
wenzelm@15755: (* remove_syntax *)
wenzelm@15755: 
wenzelm@17079: fun remove_syntax (mode, inout) syn_ext (Syntax (tabs, _)) =
wenzelm@15755:   let
wenzelm@42288:     val Syntax_Ext.Syn_Ext {xprods, consts = _, parse_ast_translation, parse_rules,
wenzelm@42268:       parse_translation, print_translation, print_rules, print_ast_translation} = syn_ext;
wenzelm@42268:     val {input, lexicon, gram, consts, prmodes, parse_ast_trtab, parse_ruletab,
wenzelm@42268:       parse_trtab, print_trtab, print_ruletab, print_ast_trtab, prtabs} = tabs;
wenzelm@19300:     val input' = if inout then subtract (op =) xprods input else input;
wenzelm@25394:     val changed = length input <> length input';
wenzelm@19546:     fun if_inout xs = if inout then xs else [];
wenzelm@15755:   in
wenzelm@17079:     Syntax
wenzelm@17079:     ({input = input',
wenzelm@42288:       lexicon = if changed then Scan.make_lexicon (Syntax_Ext.delims_of input') else lexicon,
wenzelm@45632:       gram = if changed then Lazy.value (Parser.make_gram input') else gram,
wenzelm@15755:       consts = consts,
wenzelm@15755:       prmodes = prmodes,
wenzelm@19546:       parse_ast_trtab = remove_trtab (if_inout parse_ast_translation) parse_ast_trtab,
wenzelm@19546:       parse_ruletab = remove_ruletab (if_inout parse_rules) parse_ruletab,
wenzelm@19546:       parse_trtab = remove_trtab (if_inout parse_translation) parse_trtab,
wenzelm@15755:       print_trtab = remove_tr'tab print_translation print_trtab,
wenzelm@15755:       print_ruletab = remove_ruletab print_rules print_ruletab,
wenzelm@15755:       print_ast_trtab = remove_tr'tab print_ast_translation print_ast_trtab,
wenzelm@17079:       prtabs = Printer.remove_prtabs mode xprods prtabs}, stamp ())
wenzelm@15755:   end;
wenzelm@14904: 
wenzelm@18: 
wenzelm@45632: (* merge_syntax *)
clasohm@0: 
wenzelm@45632: fun merge_syntax (Syntax (tabs1, _), Syntax (tabs2, _)) =
clasohm@0:   let
wenzelm@15755:     val {input = input1, lexicon = lexicon1, gram = gram1, consts = consts1,
wenzelm@42268:       prmodes = prmodes1, parse_ast_trtab = parse_ast_trtab1, parse_ruletab = parse_ruletab1,
wenzelm@42268:       parse_trtab = parse_trtab1, print_trtab = print_trtab1, print_ruletab = print_ruletab1,
wenzelm@42268:       print_ast_trtab = print_ast_trtab1, prtabs = prtabs1} = tabs1;
wenzelm@237: 
wenzelm@15755:     val {input = input2, lexicon = lexicon2, gram = gram2, consts = consts2,
wenzelm@42268:       prmodes = prmodes2, parse_ast_trtab = parse_ast_trtab2, parse_ruletab = parse_ruletab2,
wenzelm@42268:       parse_trtab = parse_trtab2, print_trtab = print_trtab2, print_ruletab = print_ruletab2,
wenzelm@42268:       print_ast_trtab = print_ast_trtab2, prtabs = prtabs2} = tabs2;
wenzelm@45632: 
wenzelm@45632:     val (input', gram') =
wenzelm@45632:       (case subtract (op =) input1 input2 of
wenzelm@45632:         [] => (input1, gram1)
wenzelm@45632:       | new_xprods2 =>
wenzelm@45632:           if subset (op =) (input1, input2) then (input2, gram2)
wenzelm@45632:           else
wenzelm@45632:             let
wenzelm@45632:               val input' = new_xprods2 @ input1;
wenzelm@45632:               val gram' = Lazy.lazy (fn () => Parser.make_gram input');
wenzelm@45632:             in (input', gram') end);
clasohm@0:   in
wenzelm@17079:     Syntax
wenzelm@45632:     ({input = input',
wenzelm@27768:       lexicon = Scan.merge_lexicons (lexicon1, lexicon2),
wenzelm@45632:       gram = gram',
wenzelm@42298:       consts = Symtab.merge (K true) (consts1, consts2),
wenzelm@18921:       prmodes = Library.merge (op =) (prmodes1, prmodes2),
wenzelm@237:       parse_ast_trtab =
wenzelm@15755:         merge_trtabs "parse ast translation" parse_ast_trtab1 parse_ast_trtab2,
wenzelm@237:       parse_ruletab = merge_ruletabs parse_ruletab1 parse_ruletab2,
wenzelm@15755:       parse_trtab = merge_trtabs "parse translation" parse_trtab1 parse_trtab2,
wenzelm@5692:       print_trtab = merge_tr'tabs print_trtab1 print_trtab2,
wenzelm@237:       print_ruletab = merge_ruletabs print_ruletab1 print_ruletab2,
wenzelm@5692:       print_ast_trtab = merge_tr'tabs print_ast_trtab1 print_ast_trtab2,
wenzelm@17079:       prtabs = Printer.merge_prtabs prtabs1 prtabs2}, stamp ())
clasohm@0:   end;
clasohm@0: 
clasohm@0: 
wenzelm@18720: (* basic syntax *)
wenzelm@260: 
wenzelm@42294: val token_markers =
wenzelm@42408:   ["_tfree", "_tvar", "_free", "_bound", "_loose", "_var", "_numeral", "_inner_string"];
wenzelm@260: 
wenzelm@18720: val basic_nonterms =
wenzelm@42293:   (Lexicon.terminals @ ["logic", "type", "types", "sort", "classes",
wenzelm@42293:     "args", "cargs", "pttrn", "pttrns", "idt", "idts", "aprop", "asms",
wenzelm@46236:     "any", "prop'", "num_const", "float_const", "xnum_const", "num_position",
wenzelm@46236:     "float_position", "xnum_position", "index", "struct", "id_position",
wenzelm@46483:     "longid_position", "str_position", "type_name", "class_name"]);
wenzelm@18720: 
clasohm@0: 
wenzelm@4887: 
wenzelm@15759: (** print syntax **)
wenzelm@15759: 
wenzelm@15759: local
clasohm@0: 
wenzelm@260: fun pretty_strs_qs name strs =
wenzelm@28840:   Pretty.strs (name :: map quote (sort_strings strs));
clasohm@0: 
wenzelm@17079: fun pretty_gram (Syntax (tabs, _)) =
clasohm@0:   let
wenzelm@32784:     val {lexicon, prmodes, gram, ...} = tabs;
wenzelm@28375:     val prmodes' = sort_strings (filter_out (fn s => s = "") prmodes);
clasohm@0:   in
wenzelm@8720:     [pretty_strs_qs "lexicon:" (Scan.dest_lexicon lexicon),
wenzelm@45632:       Pretty.big_list "prods:" (Parser.pretty_gram (Lazy.force gram)),
wenzelm@8720:       pretty_strs_qs "print modes:" prmodes']
clasohm@0:   end;
clasohm@0: 
wenzelm@17079: fun pretty_trans (Syntax (tabs, _)) =
clasohm@0:   let
wenzelm@42298:     fun pretty_tab name tab =
wenzelm@42298:       pretty_strs_qs name (sort_strings (Symtab.keys tab));
clasohm@0: 
wenzelm@260:     fun pretty_ruletab name tab =
wenzelm@5692:       Pretty.big_list name (map Ast.pretty_rule (dest_ruletab tab));
clasohm@0: 
wenzelm@237:     val {consts, parse_ast_trtab, parse_ruletab, parse_trtab, print_trtab,
wenzelm@42268:       print_ruletab, print_ast_trtab, ...} = tabs;
clasohm@0:   in
wenzelm@42298:    [pretty_tab "consts:" consts,
wenzelm@42298:     pretty_tab "parse_ast_translation:" parse_ast_trtab,
wenzelm@42298:     pretty_ruletab "parse_rules:" parse_ruletab,
wenzelm@42298:     pretty_tab "parse_translation:" parse_trtab,
wenzelm@42298:     pretty_tab "print_translation:" print_trtab,
wenzelm@42298:     pretty_ruletab "print_rules:" print_ruletab,
wenzelm@42298:     pretty_tab "print_ast_translation:" print_ast_trtab]
clasohm@0:   end;
clasohm@0: 
wenzelm@15759: in
clasohm@0: 
wenzelm@15759: fun print_gram syn = Pretty.writeln (Pretty.chunks (pretty_gram syn));
wenzelm@15759: fun print_trans syn = Pretty.writeln (Pretty.chunks (pretty_trans syn));
wenzelm@15759: fun print_syntax syn = Pretty.writeln (Pretty.chunks (pretty_gram syn @ pretty_trans syn));
clasohm@0: 
wenzelm@15759: end;
clasohm@0: 
clasohm@0: 
wenzelm@26951: (* reconstructing infixes -- educated guessing *)
wenzelm@26951: 
wenzelm@26951: fun guess_infix (Syntax ({gram, ...}, _)) c =
wenzelm@45632:   (case Parser.guess_infix_lr (Lazy.force gram) c of
wenzelm@26951:     SOME (s, l, r, j) => SOME
wenzelm@35130:      (if l then Mixfix.Infixl (s, j)
wenzelm@35130:       else if r then Mixfix.Infixr (s, j)
wenzelm@35130:       else Mixfix.Infix (s, j))
wenzelm@26951:   | NONE => NONE);
wenzelm@26951: 
wenzelm@26951: 
clasohm@0: 
wenzelm@1158: (** prepare translation rules **)
wenzelm@1158: 
wenzelm@42204: (* rules *)
wenzelm@42204: 
wenzelm@1158: datatype 'a trrule =
wenzelm@42204:   Parse_Rule of 'a * 'a |
wenzelm@42204:   Print_Rule of 'a * 'a |
wenzelm@42204:   Parse_Print_Rule of 'a * 'a;
wenzelm@888: 
wenzelm@42204: fun map_trrule f (Parse_Rule (x, y)) = Parse_Rule (f x, f y)
wenzelm@42204:   | map_trrule f (Print_Rule (x, y)) = Print_Rule (f x, f y)
wenzelm@42204:   | map_trrule f (Parse_Print_Rule (x, y)) = Parse_Print_Rule (f x, f y);
wenzelm@1158: 
wenzelm@42204: fun parse_rule (Parse_Rule pats) = SOME pats
wenzelm@42204:   | parse_rule (Print_Rule _) = NONE
wenzelm@42204:   | parse_rule (Parse_Print_Rule pats) = SOME pats;
wenzelm@1158: 
wenzelm@42204: fun print_rule (Parse_Rule _) = NONE
wenzelm@42204:   | print_rule (Print_Rule pats) = SOME (swap pats)
wenzelm@42204:   | print_rule (Parse_Print_Rule pats) = SOME (swap pats);
wenzelm@1158: 
wenzelm@1158: 
wenzelm@42204: (* check_rules *)
wenzelm@42204: 
wenzelm@19262: local
wenzelm@19262: 
wenzelm@42048: fun check_rule rule =
wenzelm@5692:   (case Ast.rule_error rule of
skalberg@15531:     SOME msg =>
wenzelm@1158:       error ("Error in syntax translation rule: " ^ msg ^ "\n" ^
wenzelm@42048:         Pretty.string_of (Ast.pretty_rule rule))
skalberg@15531:   | NONE => rule);
wenzelm@888: 
wenzelm@42204: in
wenzelm@42204: 
wenzelm@42204: fun check_rules rules =
wenzelm@42204:  (map check_rule (map_filter parse_rule rules),
wenzelm@42204:   map check_rule (map_filter print_rule rules));
wenzelm@42204: 
wenzelm@42204: end;
wenzelm@42204: 
wenzelm@42204: 
wenzelm@18: 
wenzelm@19262: (** modify syntax **)
wenzelm@383: 
wenzelm@25394: fun ext_syntax f decls = update_syntax mode_default (f decls);
wenzelm@383: 
wenzelm@42288: val update_trfuns = ext_syntax Syntax_Ext.syn_ext_trfuns;
wenzelm@42288: val update_advanced_trfuns = ext_syntax Syntax_Ext.syn_ext_advanced_trfuns;
wenzelm@5692: 
wenzelm@35412: fun update_type_gram add prmode decls =
wenzelm@35412:   (if add then update_syntax else remove_syntax) prmode (Mixfix.syn_ext_types decls);
wenzelm@25387: 
wenzelm@35412: fun update_const_gram add is_logtype prmode decls =
wenzelm@35412:   (if add then update_syntax else remove_syntax) prmode (Mixfix.syn_ext_consts is_logtype decls);
wenzelm@15755: 
wenzelm@42288: val update_trrules = ext_syntax Syntax_Ext.syn_ext_rules o check_rules;
wenzelm@42288: val remove_trrules = remove_syntax mode_default o Syntax_Ext.syn_ext_rules o check_rules;
wenzelm@5692: 
wenzelm@42476: 
wenzelm@42476: open Lexicon.Syntax;
wenzelm@42476: 
clasohm@0: end;
wenzelm@5692: