From 769e0a418eff3cdfe085565b4e6f80d7695c065a Mon Sep 17 00:00:00 2001
From: Sam Harwell <sam@tunnelvisionlabs.com>
Date: Mon, 26 Nov 2012 20:19:09 -0600
Subject: [PATCH] Updated javadoc

---
 .../Java/src/org/antlr/v4/runtime/misc/IntegerList.java  | 9 +++++----
 .../src/org/antlr/v4/runtime/tree/ParseTreeVisitor.java  | 4 ++--
 tool/src/org/antlr/v4/Tool.java                          | 1 -
 3 files changed, 7 insertions(+), 7 deletions(-)

diff --git a/runtime/Java/src/org/antlr/v4/runtime/misc/IntegerList.java b/runtime/Java/src/org/antlr/v4/runtime/misc/IntegerList.java
index 21ae22656..afade609b 100644
--- a/runtime/Java/src/org/antlr/v4/runtime/misc/IntegerList.java
+++ b/runtime/Java/src/org/antlr/v4/runtime/misc/IntegerList.java
@@ -31,6 +31,7 @@ package org.antlr.v4.runtime.misc;
 
 import java.util.Arrays;
 import java.util.Collection;
+import java.util.List;
 
 /**
  *
@@ -191,14 +192,14 @@ public class IntegerList {
 
 	/**
 	 * Compares the specified object with this list for equality.  Returns
-	 * {@code true} if and only if the specified object is also an {@code IntegerList},
+	 * {@code true} if and only if the specified object is also an {@link IntegerList},
 	 * both lists have the same size, and all corresponding pairs of elements in
 	 * the two lists are equal.  In other words, two lists are defined to be
 	 * equal if they contain the same elements in the same order.
 	 * <p>
 	 * This implementation first checks if the specified object is this
 	 * list. If so, it returns {@code true}; if not, it checks if the
-	 * specified object is an {@code IntegerList}. If not, it returns {@code false};
+	 * specified object is an {@link IntegerList}. If not, it returns {@code false};
 	 * if so, it checks the size of both lists. If the lists are not the same size,
 	 * it returns {@code false}; otherwise it iterates over both lists, comparing
 	 * corresponding pairs of elements.  If any comparison returns {@code false},
@@ -233,8 +234,8 @@ public class IntegerList {
 
 	/**
 	 * Returns the hash code value for this list.
-	 *
-	 * <p>This implementation uses exactly the code that is used to define the
+	 * <p/>
+	 * This implementation uses exactly the code that is used to define the
 	 * list hash function in the documentation for the {@link List#hashCode}
 	 * method.
 	 *
diff --git a/runtime/Java/src/org/antlr/v4/runtime/tree/ParseTreeVisitor.java b/runtime/Java/src/org/antlr/v4/runtime/tree/ParseTreeVisitor.java
index 7baa1650e..ce6e90edd 100644
--- a/runtime/Java/src/org/antlr/v4/runtime/tree/ParseTreeVisitor.java
+++ b/runtime/Java/src/org/antlr/v4/runtime/tree/ParseTreeVisitor.java
@@ -110,7 +110,7 @@ public class ParseTreeVisitor<T> {
 	 *
 	 * @param aggregate The previous aggregate value. In the default
 	 * implementation, the aggregate value is initialized to
-	 * {@link #defaultValue}, which is passed as the {@code aggregate} argument
+	 * {@link #defaultResult}, which is passed as the {@code aggregate} argument
 	 * to this method after the first child node is visited.
 	 * @param nextResult The result of the immediately preceeding call to visit
 	 * a child node.
@@ -126,7 +126,7 @@ public class ParseTreeVisitor<T> {
 	 * {@link #visitChildren}. This method is first called before the first
 	 * child is visited; at that point {@code currentResult} will be the initial
 	 * value (in the default implementation, the initial value is returned by a
-	 * call to {@link #defaultValue}.
+	 * call to {@link #defaultResult}.
 	 * <p/>
 	 * The default implementation always returns {@code true}, indicating that
 	 * {@code visitChildren} should only return after all children are visited.
diff --git a/tool/src/org/antlr/v4/Tool.java b/tool/src/org/antlr/v4/Tool.java
index 083a66bbf..26b8307ed 100644
--- a/tool/src/org/antlr/v4/Tool.java
+++ b/tool/src/org/antlr/v4/Tool.java
@@ -724,7 +724,6 @@ public class Tool {
 	 * given relative to the input directory.
 	 *
 	 * @param fileNameWithPath path to input source
-	 * @return
 	 */
 	public File getOutputDirectory(String fileNameWithPath) {
 		File outputDir;