a === b -> identical(a, b)

tests/compiler/dart2js/begin_end_token_test.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.
 
 import 'parser_helper.dart';
 import '../../../sdk/lib/_internal/compiler/implementation/tree/tree.dart';
 
 void testNode(Node node, String expected, String text, [bool hard = true]) {
   var debug = 'text=$text,expected=$expected,node:${node}';
   Expect.isNotNull(node, debug);
 
   Token beginToken = node.getBeginToken();
   Expect.isNotNull(beginToken, debug);
   Token endToken = node.getEndToken();
   Expect.isNotNull(endToken, debug);
 
   int begin = beginToken.charOffset;
   int end = endToken.charOffset + endToken.slowCharCount;
   Expect.isTrue(begin <= end, debug);
 
   if (hard) {
         Expect.stringEquals(expected, text.substring(begin, end), debug);
   }
 }
 
 Node testExpression(String text, [String alternate]) {
   var node = parseStatement('$text;').expression;
-  testNode(node, alternate === null ? text : alternate, text);
+  testNode(node, alternate == null ? text : alternate, text);
   return node;
 }
 
 void testUnaryExpression() {
   testExpression('x++');
   testExpression('++x');
 }
 
 void testAssignment() {
   Expression node;
@@ skipping 124 matching lines @@
   testNode(sendSet.assignmentOperator, "++", text);
   testNode(sendSet.arguments.head, "b", text);
 }
 
 void main() {
   testUnaryExpression();
   testAssignment();
   testIndex();
   testPostfix();
 }