Switch to klint, fix some lint rules

bin/babylon.js

@@ -1,4 +1,5 @@
 #!/usr/bin/env node
+/* eslint no-var: 0 */
 
 var babylon = require("..");
 var fs      = require("fs");

src/parser/comments.js

@@ -1,4 +1,5 @@
 /* @flow */
+/* eslint max-len: 0 */
 
 /**
  * Based on the comment attachment algorithm used in espree and estraverse.

src/parser/expression.js

@@ -1,3 +1,6 @@
+/* eslint indent: 0 */
+/* eslint max-len: 0 */
+
 // A recursive descent parser operates by defining functions for all
 // syntactic elements, and recursively calling those, each function
 // advancing the input stream and returning an AST node. Precedence
@@ -969,7 +972,7 @@ pp.parseAwait = function (node) {
     this.unexpected();
   }
   if (this.match(tt.star)) {
-    this.raise(node.start, "await* has been removed from the async functions proposal. Use Promise.all() instead.")
+    this.raise(node.start, "await* has been removed from the async functions proposal. Use Promise.all() instead.");
   }
   node.argument = this.parseMaybeUnary();
   return this.finishNode(node, "AwaitExpression");

src/parser/index.js

@@ -36,7 +36,7 @@ export default class Parser extends Tokenizer {
 
     if (plugins.indexOf("flow") >= 0) {
       // ensure flow plugin loads last
-      plugins = plugins.filter(plugin => plugin !== "flow");
+      plugins = plugins.filter((plugin) => plugin !== "flow");
       plugins.push("flow");
     }
 

src/parser/lval.js

@@ -1,3 +1,5 @@
+/* eslint indent: 0 */
+
 import { types as tt } from "../tokenizer/types";
 import Parser from "./index";
 import { reservedWords } from "../util/identifier";

src/parser/statement.js

@@ -1,3 +1,6 @@
+/* eslint indent: 0 */
+/* eslint max-len: 0 */
+
 import { types as tt } from "../tokenizer/types";
 import Parser from "./index";
 import { lineBreak } from "../util/whitespace";

src/plugins/flow.js

@@ -1,3 +1,6 @@
+/* eslint indent: 0 */
+/* eslint max-len: 0 */
+
 import { types as tt } from "../tokenizer/types";
 import Parser from "../parser";
 
@@ -115,8 +118,7 @@ pp.flowParseDeclareInterface = function (node) {
   this.next();
   this.flowParseInterfaceish(node);
   return this.finishNode(node, "DeclareInterface");
-}
-
+};
 
 // Interfaces
 
@@ -920,7 +922,7 @@ export default function (instance) {
               node.typeParameters = null;
           }
           implemented.push(this.finishNode(node, "ClassImplements"));
-        } while (this.eat(tt.comma))
+        } while (this.eat(tt.comma));
       }
     };
   });

src/plugins/jsx/index.js

@@ -1,3 +1,5 @@
+/* eslint indent: 0 */
+
 import XHTMLEntities from "./xhtml";
 import { TokenType, types as tt } from "../../tokenizer/types";
 import { TokContext, types as tc } from "../../tokenizer/context";

src/tokenizer/context.js

@@ -34,7 +34,7 @@ export const types: {
   b_tmpl: new TokContext("${", true),
   p_stat: new TokContext("(", false),
   p_expr: new TokContext("(", true),
-  q_tmpl: new TokContext("`", true, true, p => p.readTmplToken()),
+  q_tmpl: new TokContext("`", true, true, (p) => p.readTmplToken()),
   f_expr: new TokContext("function", true)
 };
 
@@ -78,7 +78,8 @@ tt.dollarBraceL.updateContext = function () {
 };
 
 tt.parenL.updateContext = function (prevType) {
-  let statementParens = prevType === tt._if || prevType === tt._for || prevType === tt._with || prevType === tt._while;
+  let statementParens = prevType === tt._if || prevType === tt._for ||
+                        prevType === tt._with || prevType === tt._while;
   this.state.context.push(statementParens ? types.p_stat : types.p_expr);
   this.state.exprAllowed = true;
 };

src/tokenizer/index.js

@@ -1,4 +1,6 @@
 /* @noflow */
+/* eslint max-len: 0 */
+/* eslint indent: 0 */
 
 import type { TokenType } from "./types";
 import { isIdentifierStart, isIdentifierChar, isKeyword } from "../util/identifier";

src/util/identifier.js

@@ -1,3 +1,5 @@
+/* eslint max-len: 0 */
+
 // This is a trick taken from Esprima. It turns out that, on
 // non-Chrome browsers, to check whether a string is in a set, a
 // predicate containing a big ugly `switch` statement is faster than