Re-flow comment to force rebuild

pkg/compiler/lib/src/js/js.dart

 // Copyright (c) 2015, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 library js;
 
 import 'package:js_ast/js_ast.dart';
 export 'package:js_ast/js_ast.dart';
 
 import '../common.dart';
@@ skipping 119 matching lines @@
   final Node tree;
   final Compiler _compiler;
   final bool _protectForEval;
   LiteralString _cachedLiteral;
 
   Iterable<Node> get containedNodes => [tree];
 
   /// A [js.Literal] that represents the string result of unparsing [ast].
   ///
   /// When its string [value] is requested, the node pretty-prints the given
-  /// [ast] and, if [protectForEval] is true, wraps the resulting
-  /// string in parenthesis. The result is also escaped.
+  /// [ast] and, if [protectForEval] is true, wraps the resulting string in
+  /// parenthesis. The result is also escaped.
   UnparsedNode(this.tree, this._compiler, this._protectForEval);
 
   LiteralString get _literal {
     if (_cachedLiteral == null) {
       String text = prettyPrint(tree, _compiler).getText();
       if (_protectForEval) {
         if (tree is Fun) text = '($text)';
         if (tree is LiteralExpression) {
           LiteralExpression literalExpression = tree;
           String template = literalExpression.template;
@@ skipping 27 matching lines @@
   }
   if (node is PropertyAccess) {
     PropertyAccess access = node;
     if (access.receiver is InterpolatedExpression) {
       InterpolatedExpression hole = access.receiver;
       return hole.isPositional && hole.nameOrPosition == 0;
     }
   }
   return false;
 }