1 files changed, 4 insertions, 3 deletions
diff --git a/chapter23/README.md b/chapter23/README.md
index aace920d..545a4c4a 100644
--- a/chapter23/README.md
+++ b/chapter23/README.md
@@ -76,8 +76,9 @@ have a type *definition* and a separate type *reference*.  The reference refers
 to the type by doing some kind of lookup; an easy one is via the type name and
 the parsers' symbol table i.e., some kind of hash table lookup.
 
-In this model the cycle is effectively avoided; all "back edges" in the cycle
-are really done by the reference edge (itself possibly a hash table lookup).
+In this model the cycle is effectively avoided; all "back edges" in the type
+cycle are really done by the reference edge (itself possibly a hash table
+lookup).
 
 So why not go down this route?
 
@@ -91,7 +92,7 @@ Here's example, a Linked List with a Java `Object` or a C `void*` payload:
 ```java
 struct List {
   List next;
-  Object payload;  // equivalently: void*
+  Object payload;  // equivalently for C: void* 
 }
 // Then walk a collection of ints and build a List:
 List nums = null;