Start resolving classes and default constructors.

frog/leg/ssa/builder.dart

 // Copyright (c) 2011, 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.
 
 class SsaBuilderTask extends CompilerTask {
   SsaBuilderTask(Compiler compiler) : super(compiler);
   String get name() => 'SSA builder';
 
   HGraph build(Node tree, TreeElements elements) {
     return measure(() {
@@ skipping 482 matching lines @@
       case "&":
       case "&=":  push(new HBitAnd(target, left, right)); break;
       case "^":
       case "^=":  push(new HBitXor(target, left, right)); break;
       case "==":  push(new HEquals(target, left, right)); break;
       case "<":   push(new HLess(target, left, right)); break;
       case "<=":  push(new HLessEqual(target, left, right)); break;
       case ">":   push(new HGreater(target, left, right)); break;
       case ">=":  push(new HGreaterEqual(target, left, right)); break;
       default: compiler.unimplemented("SsaBuilder.visitBinary");
-    }    
+    }
   }
 
   visitSend(Send node) {
     Element element = elements[node];
     // TODO(kasperl): This only works for very special cases. Make
     // this way more general soon.
     if (node.selector is Operator) {
       Operator op = node.selector;
       if (const SourceString("&&") == op.source ||
           const SourceString("||") == op.source) {
         visitLogicalAndOr(node, op);
       } else if (const SourceString("!") == op.source) {
         visitLogicalNot(node);
       } else if (node.argumentsNode is Prefix ||
                  node.argumentsNode is Postfix) {
         visitUnary(node, op, element);
       } else {
         visit(node.receiver);
         visit(node.argumentsNode);
         var right = pop();
-        var left = pop();        
+        var left = pop();
         visitBinary(left, op, right, element);
       }
     } else if (node.isPropertyAccess) {
       if (node.receiver !== null) {
         compiler.unimplemented("SsaBuilder.visitSend with receiver");
       }
       HInstruction instruction = definitions[element];
       assert(instruction !== null);
       stack.add(instruction);
     } else {
@@ skipping 19 matching lines @@
       } else {
         HStatic target = new HStatic(element);
         add(target);
         List inputs = <HInstruction>[target];
         inputs.addAll(arguments);
         push(new HInvokeStatic(inputs));
       }
     }
   }
 
+  visitNewExpression(NewExpression node) {
+    compiler.unimplemented("SsaBuilder: new expression");
+  }
+
   HInstruction updateDefinition(Node node, HInstruction value) {
     VariableElement element = elements[node];
     value = guard(element.type, value);
     definitions[element] = value;
     return value;
   }
 
   visitSendSet(SendSet node) {
     if (node.receiver != null) {
       compiler.unimplemented("SsaBuilder: property access");
@@ skipping 114 matching lines @@
     List<HInstruction> inputs = <HInstruction>[];
     for (Link<Node> link = node.elements.nodes;
          !link.isEmpty();
          link = link.tail) {
       visit(link.head);
       inputs.add(pop());
     }
     push(new HLiteralList(inputs));
   }
 }