Move frog/leg to lib/compiler/implementation.

frog/tests/leg/src/ResolverTest.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.
 
-#import("../../../leg/leg.dart");
-#import("../../../leg/elements/elements.dart");
-#import("../../../leg/tree/tree.dart");
-#import("../../../leg/util/util.dart");
+#import("../../../../lib/compiler/implementation/leg.dart");
+#import("../../../../lib/compiler/implementation/elements/elements.dart");
+#import("../../../../lib/compiler/implementation/tree/tree.dart");
+#import("../../../../lib/compiler/implementation/util/util.dart");
 #import("mock_compiler.dart");
 #import("parser_helper.dart");
 
 Node buildIdentifier(String name) => new Identifier(scan(name));
 
 Node buildInitialization(String name) =>
   parseBodyCode('$name = 1',
       (parser, tokens) => parser.parseOptionallyInitializedIdentifier(tokens));
 
 createLocals(List variables) {
@@ skipping 620 matching lines @@
 length(Link link) => link.isEmpty() ? 0 : length(link.tail) + 1;
 
 at(Link link, int index) => (index == 0) ? link.head : at(link.tail, index - 1);
 
 List<String> asSortedStrings(Link link) {
   List<String> result = <String>[];
   for (; !link.isEmpty(); link = link.tail) result.add(link.head.toString());
   result.sort((s1, s2) => s1.compareTo(s2));
   return result;
 }