Index: translator/SymTab/Validate.cc
===================================================================
--- translator/SymTab/Validate.cc	(revision ea3eb06e82e92717315fe1ac99f424263976bfdd)
+++ translator/SymTab/Validate.cc	(revision d11f789d2e3cf56664deffef54dd03bfa1011c41)
@@ -221,5 +221,5 @@
 	if ( inStruct ) {
 	    // Add elements in stack order corresponding to nesting structure.
-	    declsToAdd.push_front( aggregateDecl );
+	    declsToAdd.push_back( aggregateDecl );
 	    Visitor::visit( aggregateDecl );
 	} else {
Index: translator/examples/iterator.c
===================================================================
--- translator/examples/iterator.c	(revision ea3eb06e82e92717315fe1ac99f424263976bfdd)
+++ translator/examples/iterator.c	(revision d11f789d2e3cf56664deffef54dd03bfa1011c41)
@@ -29,5 +29,5 @@
 	dtype os_type | ostream( os_type ) )
 void write_reverse( iterator_type begin, iterator_type end, os_type *os ) {
-    iterator_type i; /* = end; do not work */
+    iterator_type i; // "= end;" does not work
     i = end;
     do {
Index: translator/examples/quoted_keyword.c
===================================================================
--- translator/examples/quoted_keyword.c	(revision d11f789d2e3cf56664deffef54dd03bfa1011c41)
+++ translator/examples/quoted_keyword.c	(revision d11f789d2e3cf56664deffef54dd03bfa1011c41)
@@ -0,0 +1,20 @@
+// test quoted keyword usage
+int `catch`;
+
+struct {
+    int `type`;
+    int `struct`;
+} st;
+
+typedef int `forall`;
+`forall` `throw`;
+
+int foo() {
+    int w = `catch` + st.`type` + st.`struct` + `throw`;
+}
+
+#include <math.h>	// has field name "type"
+
+// Local Variables: //
+// compile-command: "../../bin/cfa quoted_keyword.c" //
+// End: //
Index: translator/examples/vector_test.c
===================================================================
--- translator/examples/vector_test.c	(revision ea3eb06e82e92717315fe1ac99f424263976bfdd)
+++ translator/examples/vector_test.c	(revision d11f789d2e3cf56664deffef54dd03bfa1011c41)
@@ -12,4 +12,5 @@
     int num;
 
+    sout << "enter N elements and C-d on a separate line:\n";
     for ( ;; ) {
 	sin >> &num;
@@ -17,5 +18,4 @@
 	append( &vec, num );
     }
-
     // write out the numbers
 
@@ -23,7 +23,9 @@
 //    write_all( begin( vec ), end( vec ), sout );
     sout << "\n";
+#if 0
     write_reverse( begin( vec ), end( vec ), sout );
     sout << "\n";
 
+#endif
     for ( int index = 0; index <= last( vec ); index += 1 ) {
 	sout << vec[ index ] << " ";