Consolidate analyzer dependencies.

pkg/front_end/lib/src/fasta/util/link_implementation.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.
 
 library fasta.util.link_implementation;
 
 import 'dart:collection' show IterableBase;
 
 import 'link.dart' show Link, LinkBuilder;
 
 class LinkIterator<T> implements Iterator<T> {
   T _current;
   Link<T> _link;
 
-  LinkIterator(Link<T> this._link);
+  LinkIterator(this._link);
 
   T get current => _current;
 
   bool moveNext() {
     if (_link.isEmpty) {
       _current = null;
       return false;
     }
     _current = _link.head;
     _link = _link.tail;
@@ skipping 31 matching lines @@
 
   Iterator<T> get iterator {
     return new MappedLinkIterator<S, T>(_link, _transformation);
   }
 }
 
 class LinkEntry<T> extends Link<T> {
   final T head;
   Link<T> tail;
 
-  LinkEntry(T this.head, [Link<T> tail])
+  LinkEntry(this.head, [Link<T> tail])
       : this.tail = ((tail == null) ? const Link() : tail);
 
   Link<T> prepend(T element) {
     // TODO(ahe): Use new Link<T>, but this cost 8% performance on VM.
     return new LinkEntry<T>(element, this);
   }
 
   void printOn(StringBuffer buffer, [separatedBy]) {
     buffer.write(head);
     if (separatedBy == null) separatedBy = '';
@@ skipping 135 matching lines @@
     }
     throw new StateError("no elements");
   }
 
   void clear() {
     head = null;
     lastLink = null;
     length = 0;
   }
 }