Index: tests/concurrent/examples/boundedBufferEXT.c
===================================================================
--- tests/concurrent/examples/boundedBufferEXT.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/concurrent/examples/boundedBufferEXT.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -8,6 +8,6 @@
 // Created On       : Wed Apr 18 22:52:12 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed May  2 16:12:58 2018
-// Update Count     : 7
+// Last Modified On : Thu Aug 16 08:17:03 2018
+// Update Count     : 8
 //
 
@@ -73,5 +73,5 @@
 void main( Consumer & cons ) with( cons ) {
 	sum = 0;
-	for ( ;; ) {
+	for () {
 		yield( random( 5 ) );
 		int item = remove( buffer );
Index: tests/concurrent/examples/boundedBufferINT.c
===================================================================
--- tests/concurrent/examples/boundedBufferINT.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/concurrent/examples/boundedBufferINT.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -8,6 +8,6 @@
 // Created On       : Mon Oct 30 12:45:13 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Thu Apr 26 23:08:17 2018
-// Update Count     : 82
+// Last Modified On : Thu Aug 16 08:17:58 2018
+// Update Count     : 83
 //
 
@@ -74,5 +74,5 @@
 void main( Consumer & cons ) with( cons ) {
 	sum = 0;
-	for ( ;; ) {
+	for () {
 		yield( random( 5 ) );
 		int item = remove( buffer );
Index: tests/concurrent/examples/quickSort.c
===================================================================
--- tests/concurrent/examples/quickSort.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/concurrent/examples/quickSort.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -9,6 +9,6 @@
 // Created On       : Wed Dec  6 12:15:52 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Jan 30 15:58:58 2018
-// Update Count     : 162
+// Last Modified On : Thu Aug 16 08:17:41 2018
+// Update Count     : 163
 //
 
@@ -131,5 +131,5 @@
 
 	if ( &unsortedfile ) {								// generate output ?
-		for ( ;; ) {
+		for () {
 			unsortedfile | size;						// read number of elements in the list
 		  if ( eof( unsortedfile ) ) break;
Index: tests/coroutine/fibonacci.c
===================================================================
--- tests/coroutine/fibonacci.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/coroutine/fibonacci.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -11,6 +11,6 @@
 // Created On       : Thu Jun  8 07:29:37 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Fri Apr 27 08:55:31 2018
-// Update Count     : 19
+// Last Modified On : Thu Aug 16 08:18:16 2018
+// Update Count     : 20
 //
 
@@ -26,5 +26,5 @@
 	fn = 1;  fn2 = fn1;  fn1 = fn;						// 2nd case
 	suspend();											// restart last resume
-	for ( ;; ) {
+	for () {
 		fn = fn1 + fn2;  fn2 = fn1;  fn1 = fn;			// general case
 		suspend();										// restart last resume
Index: tests/coroutine/fmtLines.c
===================================================================
--- tests/coroutine/fmtLines.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/coroutine/fmtLines.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -10,6 +10,6 @@
 // Created On       : Sun Sep 17 21:56:15 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue May 15 12:25:33 2018
-// Update Count     : 42
+// Last Modified On : Thu Aug 16 08:20:54 2018
+// Update Count     : 45
 //
 
@@ -23,8 +23,8 @@
 
 void main( Format & fmt ) with( fmt ) {
-	for ( ;; ) {										// for as many characters
-		for ( g = 0; g < 5; g += 1 ) {					// groups of 5 blocks
-			for ( b = 0; b < 4; b += 1 ) {				// blocks of 4 characters
-				for ( ;; ) {							// for newline characters
+	for () {											// for as many characters
+		for ( g; 5 ) {									// groups of 5 blocks
+			for ( b; 4 ) {								// blocks of 4 characters
+				for () {								// for newline characters
 					suspend();
 					if ( ch != '\n' ) break;			// ignore newline
@@ -53,5 +53,5 @@
 	Format fmt;
 
-	eof: for ( ;; ) {									// read until end of file
+  eof: for () {											// read until end of file
 		sin | fmt.ch;									// read one character
 	  if ( eof( sin ) ) break eof;						// eof ?
Index: tests/coroutine/runningTotal.c
===================================================================
--- tests/coroutine/runningTotal.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/coroutine/runningTotal.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -10,6 +10,6 @@
 // Created On       : Wed Dec  6 08:05:27 2017
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Dec  6 08:09:24 2017
-// Update Count     : 2
+// Last Modified On : Thu Aug 16 08:22:29 2018
+// Update Count     : 3
 //
 
@@ -29,5 +29,5 @@
 
 void main( RunTotal & rntl ) with( rntl ) {
-	for ( ;; ) {
+	for () {
 		update( rntl, input );
 	} // for
@@ -41,5 +41,5 @@
 int main() {
 	RunTotal rntl;
-	for ( int i = 0; i < 10; i += 1 ) {
+	for ( i; 10 ) {
 		sout | i | add( rntl, i ) | endl;
 	} // for
Index: tests/fallthrough.c
===================================================================
--- tests/fallthrough.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/fallthrough.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -10,6 +10,6 @@
 // Created On       : Wed Mar 14 10:06:25 2018
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Mar 14 22:45:13 2018
-// Update Count     : 13
+// Last Modified On : Thu Aug 16 08:21:46 2018
+// Update Count     : 14
 //
 
@@ -92,5 +92,5 @@
 	choose ( 3 ) {
 		case 2:
-			for ( ;; ) {
+			for () {
 				choose ( 2 ) {
 					case 1:
Index: tests/labelledExit.c
===================================================================
--- tests/labelledExit.c	(revision 3de91351a168833dc27bd92f5425bd6ad79e4dd9)
+++ tests/labelledExit.c	(revision adb6b30f3f83b2166bd82dc6c0ab895d1f2d68a7)
@@ -10,6 +10,6 @@
 // Created On       : Wed Aug 10 07:29:39 2016
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Wed Aug 10 07:30:15 2016
-// Update Count     : 1
+// Last Modified On : Thu Aug 16 08:55:39 2018
+// Update Count     : 3
 // 
 
@@ -60,5 +60,5 @@
   	}
 
-  D: for ( ;; ) {
+  D: for () {
   		break D;
   		continue D;
@@ -67,5 +67,5 @@
   Z : i += 1;
   	goto Z;
-  X: Y: for ( ;; ) {
+  X: Y: for () {
   		i += 1;
   		if ( i > 5 ) continue X;
@@ -74,7 +74,7 @@
   		break;
   	}
-  XX: for ( ;; ) {
-  	  YY: for ( ;; ) {
-  		  ZZ: for ( ;; ) {
+  XX: for () {
+  	  YY: for () {
+  		  ZZ: for () {
   				i += 1;
   				if ( i > 5 ) continue XX;
@@ -89,5 +89,5 @@
   	}
 
-  	for ( ;; ) ;
+  	for () ;
   	for ( int i = 0 ;; ) ;
   	for (  ; i < 0; ) ;
@@ -97,5 +97,5 @@
   L20: L21: L22: L23: L24: L25: L26: L27: L28: L29:
   L31: L32: L33: L34:
-  	for ( ;; ) {
+  	for () {
   		break L0;
   	}
