1.1 --- a/src/share/classes/com/sun/tools/javac/comp/Lower.java Sat Sep 08 22:54:21 2012 -0700
1.2 +++ b/src/share/classes/com/sun/tools/javac/comp/Lower.java Thu Sep 13 14:29:36 2012 -0700
1.3 @@ -1449,7 +1449,7 @@
1.4 return access(v, make.at(pos).Ident(v), null, false);
1.5 }
1.6
1.7 - /** Construct a tree simulating the expression <C.this>.
1.8 + /** Construct a tree simulating the expression {@code C.this}.
1.9 * @param pos The source code position to be used for the tree.
1.10 * @param c The qualifier class.
1.11 */
1.12 @@ -1623,7 +1623,7 @@
1.13 }
1.14
1.15 /** Construct a tree that represents the outer instance
1.16 - * <C.this>. Never pick the current `this'.
1.17 + * {@code C.this}. Never pick the current `this'.
1.18 * @param pos The source code position to be used for the tree.
1.19 * @param c The qualifier class.
1.20 */
1.21 @@ -1661,7 +1661,7 @@
1.22 }
1.23
1.24 /** Construct a tree that represents the closest outer instance
1.25 - * <C.this> such that the given symbol is a member of C.
1.26 + * {@code C.this} such that the given symbol is a member of C.
1.27 * @param pos The source code position to be used for the tree.
1.28 * @param sym The accessed symbol.
1.29 * @param preciseMatch should we accept a type that is a subtype of
1.30 @@ -1713,7 +1713,7 @@
1.31 return tree;
1.32 }
1.33
1.34 - /** Return tree simulating the assignment <this.name = name>, where
1.35 + /** Return tree simulating the assignment {@code this.name = name}, where
1.36 * name is the name of a free variable.
1.37 */
1.38 JCStatement initField(int pos, Name name) {
1.39 @@ -1730,7 +1730,7 @@
1.40 make.Ident(rhs)).setType(lhs.erasure(types)));
1.41 }
1.42
1.43 - /** Return tree simulating the assignment <this.this$n = this$n>.
1.44 + /** Return tree simulating the assignment {@code this.this$n = this$n}.
1.45 */
1.46 JCStatement initOuterThis(int pos) {
1.47 VarSymbol rhs = outerThisStack.head;
1.48 @@ -3194,7 +3194,7 @@
1.49 *
1.50 * (where arrayexpr is of an array type) gets translated to
1.51 *
1.52 - * <pre>
1.53 + * <pre>{@code
1.54 * for ( { arraytype #arr = arrayexpr;
1.55 * int #len = array.length;
1.56 * int #i = 0; };
1.57 @@ -3202,7 +3202,7 @@
1.58 * T v = arr$[#i];
1.59 * stmt;
1.60 * }
1.61 - * </pre>
1.62 + * }</pre>
1.63 *
1.64 * where #arr, #len, and #i are freshly named synthetic local variables.
1.65 */
1.66 @@ -3272,14 +3272,14 @@
1.67 * for ( T v : coll ) stmt ;
1.68 * </pre>
1.69 *
1.70 - * (where coll implements Iterable<? extends T>) gets translated to
1.71 + * (where coll implements {@code Iterable<? extends T>}) gets translated to
1.72 *
1.73 - * <pre>
1.74 + * <pre>{@code
1.75 * for ( Iterator<? extends T> #i = coll.iterator(); #i.hasNext(); ) {
1.76 * T v = (T) #i.next();
1.77 * stmt;
1.78 * }
1.79 - * </pre>
1.80 + * }</pre>
1.81 *
1.82 * where #i is a freshly named synthetic local variable.
1.83 */
