Index: src/tests/coroutine.c
===================================================================
--- src/tests/coroutine.c	(revision 6e49f1866888e0b89c9f25a3f7db862634f9c3fb)
+++ src/tests/coroutine.c	(revision f802e460a164d89452b483df5ce496ad8cba25ac)
@@ -10,6 +10,6 @@
 // Created On       : Thu Jun  8 07:29:37 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Jun  8 07:37:12 2017
-// Update Count     : 5
+// Last Modified On : Sun Sep 17 21:38:15 2017
+// Update Count     : 7
 //
 
@@ -18,5 +18,5 @@
 
 coroutine Fibonacci {
-	int fn;						// used for communication
+	int fn;												// used for communication
 };
 
@@ -26,24 +26,22 @@
 
 void main( Fibonacci & this ) {
-	int fn1, fn2;					// retained between resumes
-	this.fn = 0;					// case 0
+	int fn1, fn2;										// retained between resumes
+	this.fn = 0;										// case 0
 	fn1 = this.fn;
-	suspend();						// return to last resume
+	suspend();											// restart last resume
 
-	this.fn = 1;					// case 1
-	fn2 = fn1;
-	fn1 = this.fn;
-	suspend();						// return to last resume
+	this.fn = 1;										// case 1
+	fn2 = fn1;  fn1 = this.fn;
+	suspend();											// restart last resume
 
-	for ( ;; ) {					// general case
+	for ( ;; ) {										// general case
 		this.fn = fn1 + fn2;
-		fn2 = fn1;
-		fn1 = this.fn;
-		suspend();					// return to last resume
+		fn2 = fn1;  fn1 = this.fn;
+		suspend();										// restart last resume
 	} // for
 }
 
 int next( Fibonacci & this ) {
-	resume( this );					// transfer to last suspend
+	resume( this );										// restart last suspend
 	return this.fn;
 }
@@ -52,5 +50,5 @@
 	Fibonacci f1, f2;
 	for ( int i = 1; i <= 10; i += 1 ) {
-		sout | next( f1 ) | ' ' | next( f2 ) | endl;
+		sout | next( f1 ) | next( f2 ) | endl;
 	} // for
 }
Index: src/tests/gmp.c
===================================================================
--- src/tests/gmp.c	(revision 6e49f1866888e0b89c9f25a3f7db862634f9c3fb)
+++ src/tests/gmp.c	(revision f802e460a164d89452b483df5ce496ad8cba25ac)
@@ -10,6 +10,6 @@
 // Created On       : Tue Apr 19 08:55:51 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Mon Sep  4 09:51:18 2017
-// Update Count     : 550
+// Last Modified On : Thu Sep 28 18:33:51 2017
+// Update Count     : 555
 // 
 
@@ -97,6 +97,5 @@
 
 	sout | "Factorial Numbers" | endl;
-	Int fact;
-	fact = 1;											// 1st case
+	Int fact = 1;										// 1st case
 	sout | (int)0 | fact | endl;
 	for ( unsigned int i = 1; i <= 40; i += 1 ) {