[presubmit] Enabling readability/inheritance linter checking.

src/rewriter.cc

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/rewriter.h"
 
 #include "src/ast.h"
 #include "src/parser.h"
 #include "src/scopes.h"
 
@@ skipping 18 matching lines @@
             AstValueFactory* ast_value_factory)
       : result_(result),
         result_assigned_(false),
         replacement_(nullptr),
         is_set_(false),
         scope_(scope),
         factory_(ast_value_factory) {
     InitializeAstVisitor(parser->stack_limit());
   }
 
-  virtual ~Processor() { }
+  ~Processor() override {}
 
   void Process(ZoneList<Statement*>* statements);
   bool result_assigned() const { return result_assigned_; }
 
   Zone* zone() { return zone_; }
   Scope* scope() { return scope_; }
   AstNodeFactory* factory() { return &factory_; }
 
   // Returns ".result = value"
   Expression* SetResult(Expression* value) {
@@ skipping 23 matching lines @@
   // the stores by keeping track of whether or not we're sure .result
   // will be overwritten anyway. This is a bit more tricky than what I
   // was hoping for.
   bool is_set_;
 
   Zone* zone_;
   Scope* scope_;
   AstNodeFactory factory_;
 
   // Node visitors.
-#define DEF_VISIT(type) virtual void Visit##type(type* node) override;
+#define DEF_VISIT(type) void Visit##type(type* node) override;
   AST_NODE_LIST(DEF_VISIT)
 #undef DEF_VISIT
 
   void VisitIterationStatement(IterationStatement* stmt);
 
   DEFINE_AST_VISITOR_SUBCLASS_MEMBERS();
 };
 
 
 Statement* Processor::AssignUndefinedBefore(Statement* s) {
@@ skipping 300 matching lines @@
           processor.SetResult(undef), expr->position());
       body->Add(completion, factory->zone());
     }
   }
   return true;
 }
 
 
 }  // namespace internal
 }  // namespace v8