# HG changeset patch
# User wenzelm
# Date 911648268 -3600
# Node ID a4600d21b59b62bb2b6763fada7026a15751fc54
# Parent  63184e276c1d1dfd1dc51a4f904ec74622b65b47
print_state hook, obeys Goals.current_goals_markers by default;

diff -r 63184e276c1d -r a4600d21b59b src/Pure/Isar/toplevel.ML
--- a/src/Pure/Isar/toplevel.ML	Sat Nov 21 12:18:06 1998 +0100
+++ b/src/Pure/Isar/toplevel.ML	Sat Nov 21 12:37:48 1998 +0100
@@ -11,7 +11,7 @@
       . clear division with outer_syntax.ML (!?);
   - improve transactions; only in interactive mode!
   - init / exit proof;
-  - display stack size in prompt;
+  - display stack size in prompt (prompt: state -> string (hook));
 *)
 
 signature TOPLEVEL =
@@ -20,6 +20,8 @@
   type state
   exception UNDEF
   val toplevel: state
+  val print_state_default: state -> unit
+  val print_state_fn: (state -> unit) ref
   val print_state: state -> unit
   val node_of: state -> node
   val node_cases: (theory -> 'a) -> (Proof.state -> 'a) -> state -> 'a
@@ -76,8 +78,8 @@
       [Pretty.str "Theory:", Pretty.brk 1, Pretty.str (PureThy.get_name thy),
         Pretty.str " =", Pretty.brk 1, Display.pretty_theory thy])
   | print_node (Proof prf) =
-      (writeln "Proof:"; writeln ("Step #" ^ string_of_int (ProofHistory.position prf));
-        Proof.print_state (ProofHistory.current prf); writeln "Proof.");
+      (writeln ("Proof: step #" ^ string_of_int (ProofHistory.position prf));
+        Proof.print_state (ProofHistory.current prf));
 
 
 (* datatype state *)
@@ -89,16 +91,29 @@
 val toplevel = State [];
 fun append_states (State ns) (State ms) = State (ns @ ms);
 
-fun print_state (State []) = ()
-  | print_state (State [(node, _)]) = print_node node
-  | print_state (State ((node, _) :: nodes)) =
-      (writeln ("Stack size: " ^ string_of_int (length nodes)); print_node node);
-
 fun str_of_state (State []) = "at top level"
   | str_of_state (State ((Theory _, _) :: _)) = "in theory mode"
   | str_of_state (State ((Proof _, _) :: _)) = "in proof mode";
 
 
+(* print_state hook *)
+
+fun print_topnode (State []) = ()
+  | print_topnode (State [(node, _)]) = print_node node
+  | print_topnode (State ((node, _) :: nodes)) =
+      (writeln ("Stack size: " ^ string_of_int (length nodes)); print_node node);
+
+fun print_state_default state =
+  let val ref (begin_state, end_state, _) = Goals.current_goals_markers in
+    if begin_state = "" then () else writeln begin_state;
+    print_topnode state;
+    if end_state = "" then () else writeln end_state
+  end;
+
+val print_state_fn = ref print_state_default;
+fun print_state state = ! print_state_fn state;
+
+
 (* top node *)
 
 fun node_of (State []) = raise UNDEF