2 files changed, 6 insertions, 2 deletions
diff --git a/chapter01/src/main/java/com/seaofnodes/simple/node/Node.java b/chapter01/src/main/java/com/seaofnodes/simple/node/Node.java
index bafa58f4..f817db52 100644
--- a/chapter01/src/main/java/com/seaofnodes/simple/node/Node.java
+++ b/chapter01/src/main/java/com/seaofnodes/simple/node/Node.java
@@ -33,7 +33,6 @@ public abstract class Node {
      * input.  These nodes are users of this node, thus these are def-use
      * references to Nodes.
      * <p>
-     
      * Outputs directly match inputs, making a directed graph that can be
      * walked in either direction.  These outputs are typically used for
      * efficient optimizations but otherwise have no semantics meaning.
@@ -67,6 +66,11 @@ public abstract class Node {
 
     public int nIns() { return _inputs.size(); }
 
+    /**
+     * Gets the ith output node
+     * @param i Offset of the output node
+     * @return Output node (not null)
+     */
     public Node out(int i) { return _outputs.get(i); }
 
     public int nOuts() { return _outputs.size(); }
diff --git a/chapter01/src/test/java/com/seaofnodes/simple/ParserTest.java b/chapter01/src/test/java/com/seaofnodes/simple/ParserTest.java
index 9bc2fc1c..15ae7863 100644
--- a/chapter01/src/test/java/com/seaofnodes/simple/ParserTest.java
+++ b/chapter01/src/test/java/com/seaofnodes/simple/ParserTest.java
@@ -8,7 +8,7 @@ public class ParserTest {
 
     @Test
     public void testSimpleProgram() {
-        Parser parser = new Parser();
+        Parser parser = new Parser(new NodeIDGenerator());
         StartNode startNode = parser.parse("return 1;");
         Assert.assertNotNull(startNode);
         Assert.assertEquals(2, startNode.nOuts());