Index: tests/concurrent/actors/matrix.cfa
===================================================================
--- tests/concurrent/actors/matrix.cfa	(revision 82b9695384dcd39d7f4cb79d5ae874980175c67e)
+++ tests/concurrent/actors/matrix.cfa	(revision 77ca074a6d8c9b436809541d49875a94d0884d4e)
@@ -5,9 +5,5 @@
 #include <stdio.h>
 
-//////////////////////////////////////////////////////////
-// sample to show what code I need to generate per receive routine:
-//////////////////////////////////////////////////////////
-
-unsigned int xr = 2048, xc = 2048, yc = 2048, Processors = 1; // default values
+unsigned int xr = 100, xc = 100, yc = 100, Processors = 1; // default values
 
 struct derived_actor {
@@ -40,14 +36,4 @@
     return Finished;
 }
-
-// // for each receive in the compiler we will need to generate the following routine:
-// static inline derived_actor & ?|?( derived_actor & receiver, derived_msg & msg ) {					// add two structures
-// 	request * new_req = alloc();
-//     Allocation (*my_work_fn)( derived_actor &, derived_msg & ) = receive;
-//     __receive_fn fn = (__receive_fn)my_work_fn;
-//     (*new_req){ &receiver, &msg, fn };
-//     send( receiver, *new_req );
-//     return receiver;
-// }
 
 int main( int argc, char * argv[] ) {
@@ -105,6 +91,4 @@
 	} // for
 
-    // processor procs[Processors - 1];
-
     executor e{ Processors, Processors, Processors == 1 ? 1 : Processors * 16, true };