--- jsr166/src/test/loops/BinaryAsyncAction.java	2012/10/21 06:14:12	1.6
+++ jsr166/src/test/loops/BinaryAsyncAction.java	2012/11/18 18:03:11	1.7
@@ -15,11 +15,11 @@ import java.util.concurrent.atomic.*;
  * BinaryAsyncActions are simpler to use and have less overhead in
  * typical uasges but are restricted to binary computation trees.
  *
- * <p> Upon construction, an BinaryAsyncAction does not bear any
+ * <p>Upon construction, an BinaryAsyncAction does not bear any
  * linkages. For non-root tasks, links must be established using
  * method <tt>linkSubtasks</tt> before use.
  *
- * <p> <b>Sample Usage.</b>  A version of Fibonacci:
+ * <p><b>Sample Usage.</b>  A version of Fibonacci:
  * <pre>
  * class Fib extends BinaryAsyncAction {
  *   final int n;