Replace comment style generic method syntax with real syntax (TBR)

pkg/analyzer/lib/src/kernel/ast_from_analyzer.dart

 // Copyright (c) 2016, 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 kernel.analyzer.ast_from_analyzer;
 
 import 'package:kernel/ast.dart' as ast;
 import 'package:kernel/frontend/super_initializers.dart';
 import 'package:kernel/log.dart';
 import 'package:kernel/type_algebra.dart';
 import 'package:kernel/transformations/flags.dart';
@@ skipping 2280 matching lines @@
     } else if (type.isVoid) {
       return const ast.VoidType();
     } else if (type.isDynamic) {
       return const ast.DynamicType();
     } else {
       log.severe('Unexpected DartType: $type');
       return const ast.InvalidType();
     }
   }
 
-  static Iterable/*<E>*/ concatenate/*<E>*/(
-          Iterable/*<E>*/ x, Iterable/*<E>*/ y) =>
-      <Iterable<dynamic/*=E*/ >>[x, y].expand((z) => z);
+  static Iterable<E> concatenate<E>(Iterable<E> x, Iterable<E> y) =>
+      <Iterable<E>>[x, y].expand((z) => z);
 
   ast.TypeParameter convertTypeParameter(TypeParameterElement typeParameter,
       List<TypeParameterElement> boundVariables) {
     return scope.makeTypeParameter(typeParameter,
         bound: typeParameter.bound == null
             ? scope.defaultTypeParameterBound
             : convertType(typeParameter.bound, boundVariables));
   }
 
   List<ast.TypeParameter> convertTypeParameterList(
@@ skipping 758 matching lines @@
   return element;
 }
 
 Element desynthesizeSetter(Element element) {
   if (element == null || !element.isSynthetic) return element;
   if (element is PropertyAccessorElement) return element.variable;
   if (element is FieldElement) return element.setter;
   return element;
 }
 
-void sortAndRemoveDuplicates/*<T extends Comparable<T>>*/(List/*<T>*/ list) {
+void sortAndRemoveDuplicates<T extends Comparable<T>>(List<T> list) {
   list.sort();
   int deleted = 0;
   for (int i = 1; i < list.length; ++i) {
     var item = list[i];
     if (list[i - 1].compareTo(item) == 0) {
       ++deleted;
     } else if (deleted > 0) {
       list[i - deleted] = item;
     }
   }
   if (deleted > 0) {
     list.length -= deleted;
   }
 }