Index: doc/theses/mike_brooks_MMath/programs/bkgd-c-tyerr.c
===================================================================
--- doc/theses/mike_brooks_MMath/programs/bkgd-c-tyerr.c	(revision 1379c96efb267f30cae928b38f13bac2bddb3be5)
+++ doc/theses/mike_brooks_MMath/programs/bkgd-c-tyerr.c	(revision c819d90ba37be78c729458c0e71c31cc35cd2d1e)
@@ -21,4 +21,4 @@
 
 // Local Variables: //
-// compile-command: "sed -f sedcmd bkgd-c-tyerr.c | gcc -x c -" //
+// compile-command: "sed -f sedcmd bkgd-c-tyerr.c | gcc-11 -Wall -Wextra -x c -" //
 // End: //
Index: doc/theses/mike_brooks_MMath/programs/bkgd-carray-arrty.c
===================================================================
--- doc/theses/mike_brooks_MMath/programs/bkgd-carray-arrty.c	(revision 1379c96efb267f30cae928b38f13bac2bddb3be5)
+++ doc/theses/mike_brooks_MMath/programs/bkgd-carray-arrty.c	(revision c819d90ba37be78c729458c0e71c31cc35cd2d1e)
@@ -34,5 +34,5 @@
 	float ar[10];
 	static_assert( sizeof(float) == 4 );	$\C{// floats (array elements) are 4 bytes}$
-	static_assert( sizeof(void*) == 8 );	$\C{// pointers are 8 bytes}$
+	static_assert( sizeof(void *) == 8 );	$\C{// pointers are 8 bytes}$
 	static_assert( sizeof(ar) == 40 );		$\C{// array}$
 	static_assert( sizeof(&ar) == 8 );		$\C{// pointer to array}$
@@ -154,4 +154,4 @@
 
 // Local Variables: //
-// compile-command: "sed -f sedcmd bkgd-carray-arrty.c | gcc -x c -" //
+// compile-command: "sed -f sedcmd bkgd-carray-arrty.c | gcc-11 -Wall -Wextra -x c -" //
 // End: //
Index: doc/theses/mike_brooks_MMath/programs/bkgd-carray-decay.c
===================================================================
--- doc/theses/mike_brooks_MMath/programs/bkgd-carray-decay.c	(revision 1379c96efb267f30cae928b38f13bac2bddb3be5)
+++ doc/theses/mike_brooks_MMath/programs/bkgd-carray-decay.c	(revision c819d90ba37be78c729458c0e71c31cc35cd2d1e)
@@ -1,12 +1,12 @@
 #include <assert.h>
 int main() {
-	float a[10];				$\C{// array}$
-	float (*pa)[10] = &a;		$\C{// pointer to array}$
-	float a0 = a[0];			$\C{// element}$
-	float * pa0 = &(a[0]);		$\C{// pointer to element}$
+	float ar[10];				$\C{// array}$
+	float (*pa)[10] = &ar;		$\C{// pointer to array}$
+	float a0 = ar[0];			$\C{// element}$
+	float * pa0 = &(ar[0]);		$\C{// pointer to element}$
 
-	float * pa0x = a;			$\C{// (ok)}$
+	float * pa0x = ar;			$\C{// (ok)}$
 	assert( pa0 == pa0x );
-	assert( sizeof(pa0x) != sizeof(a) );
+	assert( sizeof(pa0x) != sizeof(ar) );
 
 	void f( float x[10], float * y ) {
@@ -14,9 +14,9 @@
 		static_assert( sizeof(y) == sizeof(void *) );
 	}
-	f(0,0);
+	f( 0, 0 );
 
 	// reusing local var `float a[10];`}
 	float v;
-	f( a, a );					$\C{// ok: two decays, one into an array spelling}$
+	f( ar, ar );				$\C{// ok: two decays, one into an array spelling}$
 	f( &v, &v );				$\C{// ok: no decays; a non-array passes to an array spelling}$
 
@@ -33,6 +33,6 @@
 		static_assert( sizeof(x) == sizeof(void *) );
 	}
-	static_assert( sizeof(a) == 10 * sizeof(float) );
-	decay(a);
+	static_assert( sizeof(ar) == 10 * sizeof(float) );
+	decay( ar );
 
 	void no_decay( float (*px)[10] ) {
@@ -40,8 +40,8 @@
 	}
 	static_assert( sizeof(*pa) == 10 * sizeof(float) );
-	no_decay(pa);
+	no_decay( pa );
 }
 
 // Local Variables: //
-// compile-command: "sed -f sedcmd bkgd-carray-decay.c | gcc -x c -" //
+// compile-command: "sed -f sedcmd bkgd-carray-decay.c | gcc-11 -Wall -Wextra -x c -" //
 // End: //
Index: doc/theses/mike_brooks_MMath/programs/bkgd-carray-mdim.c
===================================================================
--- doc/theses/mike_brooks_MMath/programs/bkgd-carray-mdim.c	(revision 1379c96efb267f30cae928b38f13bac2bddb3be5)
+++ doc/theses/mike_brooks_MMath/programs/bkgd-carray-mdim.c	(revision c819d90ba37be78c729458c0e71c31cc35cd2d1e)
@@ -14,24 +14,24 @@
 
 int main() {
-	float a[3][10];
-	static_assert(sizeof(float)==4);			$\C{// floats (atomic elements) are 4 bytes}$
-	static_assert(sizeof(void*)==8);			$\C{// pointers are 8 bytes}$
+	float ar[3][10];
+	static_assert(sizeof(float) == 4);			$\C{// floats (atomic elements) are 4 bytes}$
+	static_assert(sizeof(void*) == 8);			$\C{// pointers are 8 bytes}$
 
-	static_assert(sizeof( a ) == 120);			$\C{// the array, float[3][10]}$
-	static_assert(sizeof( a[0] ) == 40);		$\C{// its first element, float[10]}$
-	static_assert(sizeof( a[0][0] ) == 4 );		$\C{// its first grand element, float}$
+	static_assert(sizeof(ar) == 120);			$\C{// the array, float[3][10]}$
+	static_assert(sizeof(ar[0]) == 40);			$\C{// its first element, float[10]}$
+	static_assert(sizeof(ar[0][0]) == 4);		$\C{// its first grand element, float}$
 
-	static_assert(sizeof(&(a)) == 8);			$\C{// pointer to the array, float(*)[3][10]}$
-	static_assert(sizeof(&(a[0])) == 8  );		$\C{// pointer to its first element, float(*)[10]}$
-	static_assert(sizeof(&(a[0][0])) == 8  );	$\C{// pointer to its first grand-element, float*}$
+	static_assert(sizeof(&(ar)) == 8);			$\C{// pointer to the array, float(*)[3][10]}$
+	static_assert(sizeof(&(ar[0])) == 8);		$\C{// pointer to its first element, float(*)[10]}$
+	static_assert(sizeof(&(ar[0][0])) == 8);	$\C{// pointer to its first grand-element, float*}$
 
-	float (*pa  )[3][10] = &(a	  );
-	float (*pa0 )   [10] = &(a[0]   );
-	float  *pa00		 = &(a[0][0]);
+	float (*pa)[3][10] = &(ar);
+	float (*pa0)[10] = &(ar[0]);
+	float *pa00 = &(ar[0][0]);
 
-	static_assert((void*)&a == (void*)&(a[0]   ));
-	static_assert((void*)&a == (void*)&(a[0][0]));
+	static_assert((void*)&ar == (void*)&(ar[0] ));
+	static_assert((void*)&ar == (void*)&(ar[0][0]));
 
-	assert( (void *) pa == (void *) pa0  );
+	assert( (void *) pa == (void *) pa0 );
 	assert( (void *) pa == (void *) pa00 );
 
@@ -41,5 +41,5 @@
 		b[i] = malloc(sizeof(float[10]));
 	}
-	a[2][3];
+	ar[2][3];
 	b[2][3];
 /*
@@ -50,4 +50,4 @@
 
 // Local Variables: //
-// compile-command: "sed -f sedcmd bkgd-carray-mdim.c | gcc -x c -" //
+// compile-command: "sed -f sedcmd bkgd-carray-mdim.c | gcc-11 -Wall -Wextra -x c -" //
 // End: //
Index: doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp
===================================================================
--- doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp	(revision 1379c96efb267f30cae928b38f13bac2bddb3be5)
+++ doc/theses/mike_brooks_MMath/programs/lst-issues-attach-reduction.hpp	(revision c819d90ba37be78c729458c0e71c31cc35cd2d1e)
@@ -101,6 +101,6 @@
 class list {
 	struct node {
-		LIST_ENTRY(node) links;
-		El elem;
+		@LIST_ENTRY(node) links;@
+		@El elem;@
 	};
 	LIST_HEAD(Impl, node);
@@ -111,5 +111,5 @@
 	}
 	void push_front( const El & src ) {
-		node * n = new node();
+		node * n = @new node()@;
 		n->elem = src;
 		LIST_INSERT_HEAD(&impl, n, links);