Index: src/Parser/ExpressionNode.cc
===================================================================
--- src/Parser/ExpressionNode.cc	(revision b8116cd259402042db4620fda1246d77d458bb34)
+++ src/Parser/ExpressionNode.cc	(revision 72ae87c0dc44fed44db877c7504b5d5f47991738)
@@ -10,6 +10,6 @@
 // Created On       : Sat May 16 13:17:07 2015
 // Last Modified By : Peter A. Buhr
-// Last Modified On : Tue Sep 26 11:23:36 2017
-// Update Count     : 780
+// Last Modified On : Wed Sep 27 22:51:55 2017
+// Update Count     : 781
 //
 
@@ -207,6 +207,7 @@
 
 	assert( 0 <= size && size < 6 );
+	// Constant type is correct for overload resolving.
 	ret = new ConstantExpr( Constant( new BasicType( noQualifiers, kind[Unsigned][size] ), str, v ) );
-	if ( size < 2 ) {									// hh or h, less than int ?
+	if ( Unsigned && size < 2 ) {						// hh or h, less than int ?
 		// int i = -1uh => 65535 not -1, so cast is necessary for unsigned, which unfortunately eliminates warnings for large values.
 		ret = new CastExpr( ret, new BasicType( Type::Qualifiers(), kind[Unsigned][size] ) );
Index: src/tests/.expect/64/literals.txt
===================================================================
--- src/tests/.expect/64/literals.txt	(revision b8116cd259402042db4620fda1246d77d458bb34)
+++ src/tests/.expect/64/literals.txt	(revision 72ae87c0dc44fed44db877c7504b5d5f47991738)
@@ -1252,7 +1252,7 @@
     ((void)(-((long double )0x.0123456789p09)));
     ((void)__f__F_c__1('a'));
-    ((void)__f__F_Sc__1(((signed char )20)));
+    ((void)__f__F_Sc__1(20));
     ((void)__f__F_Uc__1(((unsigned char )21u)));
-    ((void)__f__F_s__1(((signed short int )22)));
+    ((void)__f__F_s__1(22));
     ((void)__f__F_Us__1(((unsigned short int )23u)));
     ((void)__f__F_Ul__1(((unsigned long int )24)));
Index: src/tests/coroutine.c
===================================================================
--- src/tests/coroutine.c	(revision b8116cd259402042db4620fda1246d77d458bb34)
+++ src/tests/coroutine.c	(revision 72ae87c0dc44fed44db877c7504b5d5f47991738)
@@ -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 b8116cd259402042db4620fda1246d77d458bb34)
+++ src/tests/gmp.c	(revision 72ae87c0dc44fed44db877c7504b5d5f47991738)
@@ -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 ) {