Fix semicolon elision in non-minified mode.

lib/compiler/implementation/js/printer.dart

 // Copyright (c) 2012, 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.
 
 part of js;
 
 class Printer implements NodeVisitor {
   final bool shouldCompressOutput;
   leg.Compiler compiler;
   leg.CodeBuffer outBuffer;
@@ skipping 46 matching lines @@
       outBuffer.add(str);
       lastAddedString = str;
     }
   }
 
   void outLn(String str) {
     out(str);
     lineOut();
   }
 
+  void outSemicolonLn() {
+    if (shouldCompressOutput) {
+      pendingSemicolon = true;
+    } else {
+      out(";\n");
+    }
+  }
+
   void outIndent(String str) { indent(); out(str); }
   void outIndentLn(String str) { indent(); outLn(str); }
   void indent() {
     if (!shouldCompressOutput) {
       for (int i = 0; i < indentLevel; i++) out("  ");
     }
   }
 
   void recordSourcePosition(var position) {
     if (position != null) {
@@ skipping 71 matching lines @@
   }
 
   visitBlock(Block block) {
     blockOut(block, true, true);
   }
 
   visitExpressionStatement(ExpressionStatement expressionStatement) {
     indent();
     visitNestedExpression(expressionStatement.expression, EXPRESSION,
                           newInForInit: false, newAtStatementBegin: true);
-    pendingSemicolon = true;
+    outSemicolonLn();
   }
 
   visitEmptyStatement(EmptyStatement nop) {
     outIndentLn(";");
   }
 
   void ifOut(If node, bool shouldIndent) {
     Node then = node.then;
     Node elsePart = node.otherwise;
     bool hasElse = node.hasElse;
@@ skipping 87 matching lines @@
     if (blockBody(loop.body, needsSeparation: true, needsNewline: false)) {
       spaceOut();
     } else {
       indent();
     }
     out("while");
     spaceOut();
     out("(");
     visitNestedExpression(loop.condition, EXPRESSION,
                           newInForInit: false, newAtStatementBegin: false);
-    outLn(")");
-    pendingSemicolon = true;
+    out(")");
+    outSemicolonLn();
   }
 
   visitContinue(Continue node) {
     if (node.targetLabel == null) {
       outIndentLn("continue");
     } else {
       outIndentLn("continue ${node.targetLabel}");
     }
     pendingSemicolon = true;
   }
 
   visitBreak(Break node) {
     if (node.targetLabel == null) {
       outIndentLn("break");
     } else {
       outIndentLn("break ${node.targetLabel}");
     }
     pendingSemicolon = true;
   }
 
   visitReturn(Return node) {
     if (node.value == null) {
       outIndentLn("return");
     } else {
       outIndent("return");
       pendingSpace = true;
       visitNestedExpression(node.value, EXPRESSION,
                             newInForInit: false, newAtStatementBegin: false);
     }
-    pendingSemicolon = true;
+    outSemicolonLn();
   }
 
   visitThrow(Throw node) {
     outIndent("throw");
     pendingSpace = true;
     visitNestedExpression(node.expression, EXPRESSION,
                           newInForInit: false, newAtStatementBegin: false);
-    pendingSemicolon = true;
+    outSemicolonLn();
   }
 
   visitTry(Try node) {
     outIndent("try");
     blockBody(node.body, needsSeparation: true, needsNewline: false);
     if (node.catchPart != null) {
       visit(node.catchPart);
     }
     if (node.finallyPart != null) {
       spaceOut();
@@ skipping 680 matching lines @@
       }
       codes.add(charCodes.$0 + digit);
       newName = new String.fromCharCodes(codes);
     }
     assert(const RegExp(r'[a-zA-Z][a-zA-Z0-9]*').hasMatch(newName));
     nameNumber++;
     maps.last[oldName] = newName;
     return newName;
   }
 }