@khanacademy/perseus-linter 0.2.5 → 0.3.1

package/dist/index.js

@@ -10,6 +10,7 @@ function _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'defau
 var PropTypes__default = /*#__PURE__*/_interopDefaultLegacy(PropTypes);
 
 function _defineProperty(obj, key, value) {
+  key = _toPropertyKey(key);
   if (key in obj) {
     Object.defineProperty(obj, key, {
       value: value,
@@ -20,9 +21,22 @@ function _defineProperty(obj, key, value) {
   } else {
     obj[key] = value;
   }
-
   return obj;
 }
+function _toPrimitive(input, hint) {
+  if (typeof input !== "object" || input === null) return input;
+  var prim = input[Symbol.toPrimitive];
+  if (prim !== undefined) {
+    var res = prim.call(input, hint || "default");
+    if (typeof res !== "object") return res;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return (hint === "string" ? String : Number)(input);
+}
+function _toPropertyKey(arg) {
+  var key = _toPrimitive(arg, "string");
+  return typeof key === "symbol" ? key : String(key);
+}
 
 /**
  * This is the base class for all Selector types. The key method that all
@@ -35,27 +49,25 @@ class Selector {
   static parse(selectorText) {
     return new Parser(selectorText).parse();
   }
+
   /**
    * Return an array of the nodes that matched or null if no match.
    * This is the base class so we just throw an exception. All Selector
    * subclasses must provide an implementation of this method.
    */
-
-
   match(state) {
     throw new perseusError.PerseusError("Selector subclasses must implement match()", perseusError.Errors.NotAllowed);
   }
+
   /**
    * Selector subclasses all define a toString() method primarily
    * because it makes it easy to write parser tests.
    */
-
-
   toString() {
     return "Unknown selector class";
   }
-
 }
+
 /**
  * This class implements a parser for the selector grammar. Pass the source
  * text to the Parser() constructor, and then call the parse() method to
@@ -65,98 +77,96 @@ class Selector {
  * This class is not exported, and you don't need to use it directly.
  * Instead call the static Selector.parse() method.
  */
-
 class Parser {
   // We do lexing with a simple regular expression
   // The array of tokens
   // Which token in the array we're looking at now
+
   constructor(s) {
     _defineProperty(this, "tokens", void 0);
-
     _defineProperty(this, "tokenIndex", void 0);
-
     // Normalize whitespace:
     // - remove leading and trailing whitespace
     // - replace runs of whitespace with single space characters
-    s = s.trim().replace(/\s+/g, " "); // Convert the string to an array of tokens. Note that the TOKENS
+    s = s.trim().replace(/\s+/g, " ");
+    // Convert the string to an array of tokens. Note that the TOKENS
     // pattern ignores spaces that do not appear before identifiers
     // or the * wildcard.
-
     this.tokens = s.match(Parser.TOKENS) || [];
     this.tokenIndex = 0;
-  } // Return the next token or the empty string if there are no more
-
+  }
 
+  // Return the next token or the empty string if there are no more
   nextToken() {
     return this.tokens[this.tokenIndex] || "";
-  } // Increment the token index to "consume" the token we were looking at
-  // and move on to the next one.
-
+  }
 
+  // Increment the token index to "consume" the token we were looking at
+  // and move on to the next one.
   consume() {
     this.tokenIndex++;
-  } // Return true if the current token is an identifier or false otherwise
-
+  }
 
+  // Return true if the current token is an identifier or false otherwise
   isIdentifier() {
     // The Parser.TOKENS regexp ensures that we only have to check
     // the first character of a token to know what kind of token it is.
     const c = this.tokens[this.tokenIndex][0];
     return c >= "a" && c <= "z" || c >= "A" && c <= "Z";
-  } // Consume space tokens until the next token is not a space.
-
+  }
 
+  // Consume space tokens until the next token is not a space.
   skipSpace() {
     while (this.nextToken() === " ") {
       this.consume();
     }
-  } // Parse a comma-separated sequence of tree selectors. This is the
+  }
+
+  // Parse a comma-separated sequence of tree selectors. This is the
   // entry point for the Parser class and the only method that clients
   // ever need to call.
-
-
   parse() {
     // We expect at least one tree selector
-    const ts = this.parseTreeSelector(); // Now see what's next
+    const ts = this.parseTreeSelector();
 
-    let token = this.nextToken(); // If there is no next token then we're done parsing and can return
-    // the tree selector object we got above
+    // Now see what's next
+    let token = this.nextToken();
 
+    // If there is no next token then we're done parsing and can return
+    // the tree selector object we got above
     if (!token) {
       return ts;
-    } // Otherwise, there is more go come and we're going to need a
-    // list of tree selectors
-
+    }
 
+    // Otherwise, there is more go come and we're going to need a
+    // list of tree selectors
     const treeSelectors = [ts];
-
     while (token) {
       // The only character we allow after a tree selector is a comma
       if (token === ",") {
         this.consume();
       } else {
         throw new ParseError("Expected comma");
-      } // And if we saw a comma, then it must be followed by another
-      // tree selector
-
+      }
 
+      // And if we saw a comma, then it must be followed by another
+      // tree selector
       treeSelectors.push(this.parseTreeSelector());
       token = this.nextToken();
-    } // If we parsed more than one tree selector, return them in a
-    // SelectorList object.
-
+    }
 
+    // If we parsed more than one tree selector, return them in a
+    // SelectorList object.
     return new SelectorList(treeSelectors);
-  } // Parse a sequence of node selectors linked together with
-  // hierarchy combinators: space, >, + and ~.
-
+  }
 
+  // Parse a sequence of node selectors linked together with
+  // hierarchy combinators: space, >, + and ~.
   parseTreeSelector() {
     this.skipSpace(); // Ignore space after a comma, for example
-    // A tree selector must begin with a node selector
 
+    // A tree selector must begin with a node selector
     let ns = this.parseNodeSelector();
-
     for (;;) {
       // Now check the next token. If there is none, or if it is a
       // comma, then we're done with the treeSelector. Otherwise
@@ -166,7 +176,6 @@ class Parser {
       // combine the current node selector with the new node selector
       // using a Selector subclass that depends on the combinator.
       const token = this.nextToken();
-
       if (!token || token === ",") {
         break;
       } else if (token === " ") {
@@ -185,303 +194,240 @@ class Parser {
         throw new ParseError("Unexpected token: " + token);
       }
     }
-
     return ns;
-  } // Parse a single node selector.
+  }
+
+  // Parse a single node selector.
   // For now, this is just a node type or a wildcard.
   //
   // TODO(davidflanagan): we may need to extend this with attribute
   // selectors like 'heading[level=3]', or with pseudo-classes like
   // paragraph:first-child
-
-
   parseNodeSelector() {
     // First, skip any whitespace
     this.skipSpace();
     const t = this.nextToken();
-
     if (t === "*") {
       this.consume();
       return new AnyNode();
     }
-
     if (this.isIdentifier()) {
       this.consume();
       return new TypeSelector(t);
     }
-
     throw new ParseError("Expected node type");
   }
+}
 
-} // We break the input string into tokens with this regexp. Token types
+// We break the input string into tokens with this regexp. Token types
 // are identifiers, integers, punctuation and spaces. Note that spaces
 // tokens are only returned when they appear before an identifier or
 // wildcard token and are otherwise omitted.
-
-
 _defineProperty(Parser, "TOKENS", void 0);
-
 Parser.TOKENS = /([a-zA-Z][\w-]*)|(\d+)|[^\s]|(\s(?=[a-zA-Z\*]))/g;
+
 /**
  * This is a trivial Error subclass that the Parser uses to signal parse errors
  */
-
 class ParseError extends Error {
   constructor(message) {
     super(message);
   }
-
 }
+
 /**
  * This Selector subclass is a list of selectors. It matches a node if any of
  * the selectors on the list matches the node. It considers the selectors in
  * order, and returns the array of nodes returned by whichever one matches
  * first.
  */
-
-
 class SelectorList extends Selector {
   constructor(selectors) {
     super();
-
     _defineProperty(this, "selectors", void 0);
-
     this.selectors = selectors;
   }
-
   match(state) {
     for (let i = 0; i < this.selectors.length; i++) {
       const s = this.selectors[i];
       const result = s.match(state);
-
       if (result) {
         return result;
       }
     }
-
     return null;
   }
-
   toString() {
     let result = "";
-
     for (let i = 0; i < this.selectors.length; i++) {
       result += i > 0 ? ", " : "";
       result += this.selectors[i].toString();
     }
-
     return result;
   }
-
 }
+
 /**
  * This trivial Selector subclass implements the '*' wildcard and
  * matches any node.
  */
-
-
 class AnyNode extends Selector {
   match(state) {
     return [state.currentNode()];
   }
-
   toString() {
     return "*";
   }
-
 }
+
 /**
  * This selector subclass implements the <IDENTIFIER> part of the grammar.
  * it matches any node whose `type` property is a specified string
  */
-
-
 class TypeSelector extends Selector {
   constructor(type) {
     super();
-
     _defineProperty(this, "type", void 0);
-
     this.type = type;
   }
-
   match(state) {
     const node = state.currentNode();
-
     if (node.type === this.type) {
       return [node];
     }
-
     return null;
   }
-
   toString() {
     return this.type;
   }
-
 }
+
 /**
  * This selector subclass is the superclass of the classes that implement
  * matching for the four combinators. It defines left and right properties for
  * the two selectors that are to be combined, but does not define a match
  * method.
  */
-
-
 class SelectorCombinator extends Selector {
   constructor(left, right) {
     super();
-
     _defineProperty(this, "left", void 0);
-
     _defineProperty(this, "right", void 0);
-
     this.left = left;
     this.right = right;
   }
-
 }
+
 /**
  * This Selector subclass implements the space combinator. It matches if the
  * right selector matches the current node and the left selector matches some
  * ancestor of the current node.
  */
-
-
 class AncestorCombinator extends SelectorCombinator {
   constructor(left, right) {
     super(left, right);
   }
-
   match(state) {
     const rightResult = this.right.match(state);
-
     if (rightResult) {
       state = state.clone();
-
       while (state.hasParent()) {
         state.goToParent();
         const leftResult = this.left.match(state);
-
         if (leftResult) {
           return leftResult.concat(rightResult);
         }
       }
     }
-
     return null;
   }
-
   toString() {
     return this.left.toString() + " " + this.right.toString();
   }
-
 }
+
 /**
  * This Selector subclass implements the > combinator. It matches if the
  * right selector matches the current node and the left selector matches
  * the parent of the current node.
  */
-
-
 class ParentCombinator extends SelectorCombinator {
   constructor(left, right) {
     super(left, right);
   }
-
   match(state) {
     const rightResult = this.right.match(state);
-
     if (rightResult) {
       if (state.hasParent()) {
         state = state.clone();
         state.goToParent();
         const leftResult = this.left.match(state);
-
         if (leftResult) {
           return leftResult.concat(rightResult);
         }
       }
     }
-
     return null;
   }
-
   toString() {
     return this.left.toString() + " > " + this.right.toString();
   }
-
 }
+
 /**
  * This Selector subclass implements the + combinator. It matches if the
  * right selector matches the current node and the left selector matches
  * the immediate previous sibling of the current node.
  */
-
-
 class PreviousCombinator extends SelectorCombinator {
   constructor(left, right) {
     super(left, right);
   }
-
   match(state) {
     const rightResult = this.right.match(state);
-
     if (rightResult) {
       if (state.hasPreviousSibling()) {
         state = state.clone();
         state.goToPreviousSibling();
         const leftResult = this.left.match(state);
-
         if (leftResult) {
           return leftResult.concat(rightResult);
         }
       }
     }
-
     return null;
   }
-
   toString() {
     return this.left.toString() + " + " + this.right.toString();
   }
-
 }
+
 /**
  * This Selector subclass implements the ~ combinator. It matches if the
  * right selector matches the current node and the left selector matches
  * any previous sibling of the current node.
  */
-
-
 class SiblingCombinator extends SelectorCombinator {
   constructor(left, right) {
     super(left, right);
   }
-
   match(state) {
     const rightResult = this.right.match(state);
-
     if (rightResult) {
       state = state.clone();
-
       while (state.hasPreviousSibling()) {
         state.goToPreviousSibling();
         const leftResult = this.left.match(state);
-
         if (leftResult) {
           return leftResult.concat(rightResult);
         }
       }
     }
-
     return null;
   }
-
   toString() {
     return this.left.toString() + " ~ " + this.right.toString();
   }
-
 }
 
 /**
@@ -496,25 +442,18 @@ class Rule {
   // The lint-testing function or a default
   // Checks to see if we should apply a rule or not
   // The error message for use with the default function
+
   // The comment at the top of this file has detailed docs for
   // this constructor and its arguments
   constructor(name, severity, selector, pattern, lint, applies) {
     var _this = this;
-
     _defineProperty(this, "name", void 0);
-
     _defineProperty(this, "severity", void 0);
-
     _defineProperty(this, "selector", void 0);
-
     _defineProperty(this, "pattern", void 0);
-
     _defineProperty(this, "lint", void 0);
-
     _defineProperty(this, "applies", void 0);
-
     _defineProperty(this, "message", void 0);
-
     if (!selector && !pattern) {
       throw new perseusError.PerseusError("Lint rules must have a selector or pattern", perseusError.Errors.InvalidInput, {
         metadata: {
@@ -522,13 +461,13 @@ class Rule {
         }
       });
     }
-
     this.name = name || "unnamed rule";
     this.severity = severity || Rule.Severity.BULK_WARNING;
     this.selector = selector || Rule.DEFAULT_SELECTOR;
-    this.pattern = pattern || null; // If we're called with an error message instead of a function then
-    // use a default function that will return the message.
+    this.pattern = pattern || null;
 
+    // If we're called with an error message instead of a function then
+    // use a default function that will return the message.
     if (typeof lint === "function") {
       this.lint = lint;
       this.message = null;
@@ -536,55 +475,51 @@ class Rule {
       this.lint = function () {
         return _this._defaultLintFunction(...arguments);
       };
-
       this.message = lint;
     }
-
     this.applies = applies || function () {
       return true;
     };
-  } // A factory method for use with rules described in JSON files
-  // See the documentation at the start of this file for details.
-
+  }
 
+  // A factory method for use with rules described in JSON files
+  // See the documentation at the start of this file for details.
   static makeRule(options) {
     return new Rule(options.name, options.severity, options.selector ? Selector.parse(options.selector) : null, Rule.makePattern(options.pattern), options.lint || options.message, options.applies);
-  } // Check the node n to see if it violates this lint rule.  A return value
+  }
+
+  // Check the node n to see if it violates this lint rule.  A return value
   // of false means there is no lint.  A returned object indicates a lint
   // error. See the documentation at the top of this file for details.
-
-
   check(node, traversalState, content, context) {
     // First, see if we match the selector.
     // If no selector was passed to the constructor, we use a
     // default selector that matches text nodes.
-    const selectorMatch = this.selector.match(traversalState); // If the selector did not match, then we're done
+    const selectorMatch = this.selector.match(traversalState);
 
+    // If the selector did not match, then we're done
     if (!selectorMatch) {
       return null;
-    } // If the selector matched, then see if the pattern matches
-
+    }
 
+    // If the selector matched, then see if the pattern matches
     let patternMatch;
-
     if (this.pattern) {
       patternMatch = content.match(this.pattern);
     } else {
       // If there is no pattern, then just match all of the content.
       // Use a fake RegExp match object to represent this default match.
       patternMatch = Rule.FakePatternMatch(content, content, 0);
-    } // If there was a pattern and it didn't match, then we're done
-
+    }
 
+    // If there was a pattern and it didn't match, then we're done
     if (!patternMatch) {
       return null;
     }
-
     try {
       // If we get here, then the selector and pattern have matched
       // so now we call the lint function to see if there is lint.
       const error = this.lint(traversalState, content, selectorMatch, patternMatch, context);
-
       if (!error) {
         return null; // No lint; we're done
       }
@@ -599,10 +534,9 @@ class Rule {
           start: 0,
           end: content.length
         };
-      } // If the lint function returned an object, then we just
+      }
+      // If the lint function returned an object, then we just
       // add the rule name to the message, start and end.
-
-
       return {
         rule: this.name,
         severity: this.severity,
@@ -623,22 +557,24 @@ class Rule {
         end: content.length
       };
     }
-  } // This internal method is the default lint function that we use when a
+  }
+
+  // This internal method is the default lint function that we use when a
   // rule is defined without a function. This is useful for rules where the
   // selector and/or pattern match are enough to indicate lint. This
   // function unconditionally returns the error message that was passed in
   // place of a function, but also adds start and end properties that
   // specify which particular portion of the node content matched the
   // pattern.
-
-
   _defaultLintFunction(state, content, selectorMatch, patternMatch, context) {
     return {
       message: this.message || "",
       start: patternMatch.index,
       end: patternMatch.index + patternMatch[0].length
     };
-  } // The makeRule() factory function uses this static method to turn its
+  }
+
+  // The makeRule() factory function uses this static method to turn its
   // argument into a RegExp. If the argument is already a RegExp, we just
   // return it. Otherwise, we compile it into a RegExp and return that.
   // The reason this is necessary is that Rule.makeRule() is designed for
@@ -653,49 +589,41 @@ class Rule {
   //   input "foo"     ==> output /foo/
   //   input "/foo/i"  ==> output /foo/i
   //
-
-
   static makePattern(pattern) {
     if (!pattern) {
       return null;
     }
-
     if (pattern instanceof RegExp) {
       return pattern;
     }
-
     if (pattern[0] === "/") {
       const lastSlash = pattern.lastIndexOf("/");
       const expression = pattern.substring(1, lastSlash);
       const flags = pattern.substring(lastSlash + 1);
+      // @ts-expect-error [FEI-5003] - TS2713 - Cannot access 'RegExp.flags' because 'RegExp' is a type, but not a namespace. Did you mean to retrieve the type of the property 'flags' in 'RegExp' with 'RegExp["flags"]'?
       return new RegExp(expression, flags);
     }
-
     return new RegExp(pattern);
-  } // This static method returns an string array with index and input
+  }
+
+  // This static method returns an string array with index and input
   // properties added, in order to simulate the return value of the
   // String.match() method. We use it when a Rule has no pattern and we
   // want to simulate a match on the entire content string.
-
-
   static FakePatternMatch(input, match, index) {
     const result = [match];
     result.index = index;
     result.input = input;
     return result;
   }
-
 }
-
 _defineProperty(Rule, "DEFAULT_SELECTOR", void 0);
-
 _defineProperty(Rule, "Severity", {
   ERROR: 1,
   WARNING: 2,
   GUIDELINE: 3,
   BULK_WARNING: 4
 });
-
 Rule.DEFAULT_SELECTOR = Selector.parse("text");
 
 /* eslint-disable no-useless-escape */
@@ -703,17 +631,17 @@ Rule.DEFAULT_SELECTOR = Selector.parse("text");
 // portion which is usually just the hostname, but may also include
 // a username, password or port. We don't strip those things out because
 // we typically want to reject any URL that includes them
-const HOSTNAME = /\/\/([^\/]+)/; // Return the hostname of the URL, with any "www." prefix removed.
-// If this is a relative URL with no hostname, return an empty string.
+const HOSTNAME = /\/\/([^\/]+)/;
 
+// Return the hostname of the URL, with any "www." prefix removed.
+// If this is a relative URL with no hostname, return an empty string.
 function getHostname(url) {
   if (!url) {
     return "";
   }
-
   const match = url.match(HOSTNAME);
   return match ? match[1] : "";
-} // This list of domains that count as internal domains is from
+}
 
 var AbsoluteUrl = Rule.makeRule({
   name: "absolute-url",
@@ -722,7 +650,6 @@ var AbsoluteUrl = Rule.makeRule({
   lint: function (state, content, nodes, match) {
     const url = nodes[0].target;
     const hostname = getHostname(url);
-
     if (hostname === "khanacademy.org" || hostname.endsWith(".khanacademy.org")) {
       return "Don't use absolute URLs:\nWhen linking to KA content or images, omit the\nhttps://www.khanacademy.org URL prefix.\nUse a relative URL beginning with / instead.";
     }
@@ -779,10 +706,10 @@ var HeadingLevelSkip = Rule.makeRule({
   selector: "heading ~ heading",
   lint: function (state, content, nodes, match) {
     const currentHeading = nodes[1];
-    const previousHeading = nodes[0]; // A heading can have a level less than, the same as
+    const previousHeading = nodes[0];
+    // A heading can have a level less than, the same as
     // or one more than the previous heading. But going up
     // by 2 or more levels is not right
-
     if (currentHeading.level > previousHeading.level + 1) {
       return "Skipped heading level:\nthis heading is level ".concat(currentHeading.level, " but\nthe previous heading was level ").concat(previousHeading.level);
     }
@@ -798,9 +725,9 @@ var HeadingSentenceCase = Rule.makeRule({
   message: "First letter is lowercase:\nthe first letter of a heading should be capitalized."
 });
 
+// These are 3-letter and longer words that we would not expect to be
 // capitalized even in a title-case heading.  See
 // http://blog.apastyle.org/apastyle/2012/03/title-case-and-sentence-case-capitalization-in-apa-style.html
-
 const littleWords = {
   and: true,
   nor: true,
@@ -808,12 +735,10 @@ const littleWords = {
   the: true,
   for: true
 };
-
 function isCapitalized(word) {
   const c = word[0];
   return c === c.toUpperCase();
 }
-
 var HeadingTitleCase = Rule.makeRule({
   name: "heading-title-case",
   severity: Rule.Severity.GUIDELINE,
@@ -844,14 +769,18 @@ var HeadingTitleCase = Rule.makeRule({
     // It is marked with a locale property above, but that is NYI
     //
     // for APA style rules for title case
+
     const heading = content.trim();
-    let words = heading.split(/\s+/); // Remove the first word and the little words
+    let words = heading.split(/\s+/);
 
+    // Remove the first word and the little words
     words.shift();
-    words = words.filter( // eslint-disable-next-line no-prototype-builtins
-    w => w.length > 2 && !littleWords.hasOwnProperty(w)); // If there are at least 3 remaining words and all
-    // are capitalized, then the heading is in title case.
+    words = words.filter(
+    // eslint-disable-next-line no-prototype-builtins
+    w => w.length > 2 && !littleWords.hasOwnProperty(w));
 
+    // If there are at least 3 remaining words and all
+    // are capitalized, then the heading is in title case.
     if (words.length >= 3 && words.every(w => isCapitalized(w))) {
       return "Title-case heading:\nThis heading appears to be in title-case, but should be sentence-case.\nOnly capitalize the first letter and proper nouns.";
     }
@@ -864,11 +793,9 @@ var ImageAltText = Rule.makeRule({
   selector: "image",
   lint: function (state, content, nodes, match) {
     const image = nodes[0];
-
     if (!image.alt || !image.alt.trim()) {
       return "Images should have alt text:\nfor accessibility, all images should have alt text.\nSpecify alt text inside square brackets after the !.";
     }
-
     if (image.alt.length < 8) {
       return "Images should have alt text:\nfor accessibility, all images should have descriptive alt text.\nThis image's alt text is only ".concat(image.alt.length, " characters long.");
     }
@@ -888,21 +815,20 @@ var ImageSpacesAroundUrls = Rule.makeRule({
   selector: "image",
   lint: function (state, content, nodes, match, context) {
     const image = nodes[0];
-    const url = image.target; // The markdown parser strips leading and trailing spaces for us,
+    const url = image.target;
+
+    // The markdown parser strips leading and trailing spaces for us,
     // but they're still a problem for our translation process, so
     // we need to go check for them in the unparsed source string
     // if we have it.
-
     if (context && context.content) {
       // Find the url in the original content and make sure that the
       // character before is '(' and the character after is ')'
       const index = context.content.indexOf(url);
-
       if (index === -1) {
         // It is not an error if we didn't find it.
         return;
       }
-
       if (context.content[index - 1] !== "(" || context.content[index + url.length] !== ")") {
         return "Whitespace before or after image url:\nFor images, don't include any space or newlines after '(' or before ')'.\nWhitespace in image URLs causes translation difficulties.";
       }
@@ -910,12 +836,12 @@ var ImageSpacesAroundUrls = Rule.makeRule({
   }
 });
 
+// Normally we have one rule per file. But since our selector class
 // can't match specific widget types directly, this rule implements
 // a number of image widget related rules in one place. This should
 // slightly increase efficiency, but it means that if there is more
 // than one problem with an image widget, the user will only see one
 // problem at a time.
-
 var ImageWidget = Rule.makeRule({
   name: "image-widget",
   severity: Rule.Severity.WARNING,
@@ -924,28 +850,26 @@ var ImageWidget = Rule.makeRule({
     // This rule only looks at image widgets
     if (state.currentNode().widgetType !== "image") {
       return;
-    } // If it can't find a definition for the widget it does nothing
-
+    }
 
+    // If it can't find a definition for the widget it does nothing
     const widget = context && context.widgets && context.widgets[state.currentNode().id];
-
     if (!widget) {
       return;
-    } // Make sure there is alt text
-
+    }
 
+    // Make sure there is alt text
     const alt = widget.options.alt;
-
     if (!alt) {
       return "Images should have alt text:\nfor accessibility, all images should have a text description.\nAdd a description in the \"Alt Text\" box of the image widget.";
-    } // Make sure the alt text it is not trivial
-
+    }
 
+    // Make sure the alt text it is not trivial
     if (alt.trim().length < 8) {
       return "Images should have alt text:\nfor accessibility, all images should have descriptive alt text.\nThis image's alt text is only ".concat(alt.trim().length, " characters long.");
-    } // Make sure there is no math in the caption
-
+    }
 
+    // Make sure there is no math in the caption
     if (widget.options.caption && widget.options.caption.match(/[^\\]\$/)) {
       return "No math in image captions:\nDon't include math expressions in image captions.";
     }
@@ -999,29 +923,28 @@ var MathAlignLinebreaks = Rule.makeRule({
   // enforces that you don't have the wrong number of pairs of backslashes.
   lint: function (state, content, nodes, match) {
     let text = match[0];
-
     while (text.length) {
       const index = text.indexOf("\\\\");
-
       if (index === -1) {
         // No more backslash pairs, so we found no lint
         return null;
       }
+      text = text.substring(index + 2);
 
-      text = text.substring(index + 2); // Now we expect to find optional spaces, another pair of
+      // Now we expect to find optional spaces, another pair of
       // backslashes, and more optional spaces not followed immediately
       // by another pair of backslashes.
+      const nextpair = text.match(/^\s*\\\\\s*(?!\\\\)/);
 
-      const nextpair = text.match(/^\s*\\\\\s*(?!\\\\)/); // If that does not match then we either have too few or too
+      // If that does not match then we either have too few or too
       // many pairs of backslashes.
-
       if (!nextpair) {
         return "Use four backslashes between lines of an align block";
-      } // If it did match, then, shorten the string and continue looping
+      }
+
+      // If it did match, then, shorten the string and continue looping
       // (because a single align block may have multiple lines that
       // all must be separated by two sets of double backslashes).
-
-
       text = text.substring(nextpair[0].length);
     }
   }
@@ -1075,10 +998,10 @@ var MathTextEmpty = Rule.makeRule({
   message: "Empty \\text{} block in math expression"
 });
 
+// Because no selector is specified, this rule only applies to text nodes.
 // Math and code hold their content directly and do not have text nodes
 // beneath them (unlike the HTML DOM) so this rule automatically does not
 // apply inside $$ or ``.
-
 var MathWithoutDollars = Rule.makeRule({
   name: "math-without-dollars",
   severity: Rule.Severity.GUIDELINE,
@@ -1109,7 +1032,6 @@ var TableMissingCells = Rule.makeRule({
     const table = nodes[0];
     const headerLength = table.header.length;
     const rowLengths = table.cells.map(r => r.length);
-
     for (let r = 0; r < rowLengths.length; r++) {
       if (rowLengths[r] !== headerLength) {
         return "Table rows don't match header:\nThe table header has ".concat(headerLength, " cells, but\nRow ").concat(r + 1, " has ").concat(rowLengths[r], " cells.");
@@ -1118,10 +1040,10 @@ var TableMissingCells = Rule.makeRule({
   }
 });
 
+// Because no selector is specified, this rule only applies to text nodes.
 // Math and code hold their content directly and do not have text nodes
 // beneath them (unlike the HTML DOM) so this rule automatically does not
 // apply inside $$ or ``.
-
 var UnbalancedCodeDelimiters = Rule.makeRule({
   name: "unbalanced-code-delimiters",
   severity: Rule.Severity.ERROR,
@@ -1146,6 +1068,7 @@ var WidgetInTable = Rule.makeRule({
 // TODO(davidflanagan):
 var AllRules = [AbsoluteUrl, BlockquotedMath, BlockquotedWidget, DoubleSpacingAfterTerminal, ExtraContentSpacing, HeadingLevel1, HeadingLevelSkip, HeadingSentenceCase, HeadingTitleCase, ImageAltText, ImageInTable, LinkClickHere, LongParagraph, MathAdjacent, MathAlignExtraBreak, MathAlignLinebreaks, MathEmpty, MathFontSize, MathFrac, MathNested, MathStartsWithSpace, MathTextEmpty, NestedLists, TableMissingCells, UnescapedDollar, WidgetInTable, Profanity, MathWithoutDollars, UnbalancedCodeDelimiters, ImageSpacesAroundUrls, ImageWidget];
 
+// TreeNode is the type of a node in a parse tree. The only real requirement is
 // that every node has a string-valued `type` property
 
 // This is the TreeTransformer class described in detail at the
@@ -1154,29 +1077,30 @@ class TreeTransformer {
   // To create a tree transformer, just pass the root node of the tree
   constructor(root) {
     _defineProperty(this, "root", void 0);
-
     this.root = root;
-  } // A utility function for determing whether an arbitrary value is a node
-
+  }
 
+  // A utility function for determing whether an arbitrary value is a node
   static isNode(n) {
     return n && typeof n === "object" && typeof n.type === "string";
-  } // Determines whether a value is a node with type "text" and has
-  // a text-valued `content` property.
-
+  }
 
+  // Determines whether a value is a node with type "text" and has
+  // a text-valued `content` property.
   static isTextNode(n) {
     return TreeTransformer.isNode(n) && n.type === "text" && typeof n.content === "string";
-  } // This is the main entry point for the traverse() method. See the comment
+  }
+
+  // This is the main entry point for the traverse() method. See the comment
   // at the top of this file for a detailed description. Note that this
   // method just creates a new TraversalState object to use for this
   // traversal and then invokes the internal _traverse() method to begin the
   // recursion.
-
-
   traverse(f) {
     this._traverse(this.root, new TraversalState(this.root), f);
-  } // Do a post-order traversal of node and its descendants, invoking the
+  }
+
+  // Do a post-order traversal of node and its descendants, invoking the
   // callback function f() once for each node and returning the concatenated
   // text content of the node and its descendants. f() is passed three
   // arguments: the current node, a TraversalState object representing the
@@ -1186,31 +1110,29 @@ class TreeTransformer {
   // This private method holds all the traversal logic and implementation
   // details. Note that this method uses the TraversalState object to store
   // information about the structure of the tree.
-
-
-  _traverse( // eslint-disable-next-line ft-flow/no-mutable-array
-  n, state, f) {
+  _traverse(n, state, f) {
     let content = "";
-
     if (TreeTransformer.isNode(n)) {
       // If we were called on a node object, then we handle it
       // this way.
       const node = n; // safe cast; we just tested
-      // Put the node on the stack before recursing on its children
 
+      // Put the node on the stack before recursing on its children
       state._containers.push(node);
+      state._ancestors.push(node);
 
-      state._ancestors.push(node); // Record the node's text content if it has any.
+      // Record the node's text content if it has any.
       // Usually this is for nodes with a type property of "text",
       // but other nodes types like "math" may also have content.
       // TODO(mdr): We found a new Flow error when upgrading:
       //     "node.content (property `content` is missing in `TreeNode` [1].)"
-      // $FlowFixMe[prop-missing](0.57.3->0.75.0)
-
-
+      // @ts-expect-error [FEI-5003] - TS2339 - Property 'content' does not exist on type 'TreeNode'.
       if (typeof node.content === "string") {
+        // @ts-expect-error [FEI-5003] - TS2339 - Property 'content' does not exist on type 'TreeNode'.
         content = node.content;
-      } // Recurse on the node. If there was content above, then there
+      }
+
+      // Recurse on the node. If there was content above, then there
       // probably won't be any children to recurse on, but we check
       // anyway.
       //
@@ -1219,14 +1141,13 @@ class TreeTransformer {
       // put a switch statement here to dispatch on the node type
       // property with specific recursion steps for each known type of
       // node.
-
-
       const keys = Object.keys(node);
       keys.forEach(key => {
         // Never recurse on the type property
         if (key === "type") {
           return;
-        } // Ignore properties that are null or primitive and only
+        }
+        // Ignore properties that are null or primitive and only
         // recurse on objects and arrays. Note that we don't do a
         // isNode() check here. That is done in the recursive call to
         // _traverse(). Note that the recursive call on each child
@@ -1234,35 +1155,33 @@ class TreeTransformer {
         // content to the content for this node. Also note that we
         // push the name of the property we're recursing over onto a
         // TraversalState stack.
-
-
         const value = node[key];
-
         if (value && typeof value === "object") {
           state._indexes.push(key);
-
           content += this._traverse(value, state, f);
-
           state._indexes.pop();
         }
-      }); // Restore the stacks after recursing on the children
+      });
 
+      // Restore the stacks after recursing on the children
       state._currentNode = state._ancestors.pop();
+      state._containers.pop();
 
-      state._containers.pop(); // And finally call the traversal callback for this node.  Note
+      // And finally call the traversal callback for this node.  Note
       // that this is post-order traversal. We call the callback on the
       // way back up the tree, not on the way down.  That way we already
       // know all the content contained within the node.
-
-
       f(node, state, content);
     } else if (Array.isArray(n)) {
       // If we were called on an array instead of a node, then
       // this is the code we use to recurse.
-      const nodes = n; // Push the array onto the stack. This will allow the
+      const nodes = n;
+
+      // Push the array onto the stack. This will allow the
       // TraversalState object to locate siblings of this node.
+      state._containers.push(nodes);
 
-      state._containers.push(nodes); // Now loop through this array and recurse on each element in it.
+      // Now loop through this array and recurse on each element in it.
       // Before recursing on an element, we push its array index on a
       // TraversalState stack so that the TraversalState sibling methods
       // can work. Note that TraversalState methods can alter the length
@@ -1270,31 +1189,28 @@ class TreeTransformer {
       // are careful here to test the array length on each iteration and
       // to reset the index when we pop the stack. Also note that we
       // concatentate the text content of the children.
-
-
       let index = 0;
-
       while (index < nodes.length) {
         state._indexes.push(index);
-
-        content += this._traverse(nodes[index], state, f); // Casting to convince Flow that this is a number
-
+        content += this._traverse(nodes[index], state, f);
+        // Casting to convince Flow that this is a number
         index = state._indexes.pop() + 1;
-      } // Pop the array off the stack. Note, however, that we do not call
+      }
+
+      // Pop the array off the stack. Note, however, that we do not call
       // the traversal callback on the array. That function is only
       // called for nodes, not arrays of nodes.
-
-
       state._containers.pop();
-    } // The _traverse() method always returns the text content of
+    }
+
+    // The _traverse() method always returns the text content of
     // this node and its children. This is the one piece of state that
     // is not tracked in the TraversalState object.
-
-
     return content;
   }
+}
 
-} // An instance of this class is passed to the callback function for
+// An instance of this class is passed to the callback function for
 // each node traversed. The class itself is not exported, but its
 // methods define the API available to the traversal callback.
 
@@ -1306,67 +1222,65 @@ class TreeTransformer {
  * instantiated directly, but is exported so that its type can be used for
  * Flow annotaions.
  **/
-
 class TraversalState {
   // The root node of the tree being traversed
+
   // These are internal state properties. Use the accessor methods defined
   // below instead of using these properties directly. Note that the
   // _containers and _indexes stacks can have two different types of
   // elements, depending on whether we just recursed on an array or on a
   // node. This is hard for Flow to deal with, so you'll see a number of
   // Flow casts through the any type when working with these two properties.
-  // eslint-disable-next-line ft-flow/no-mutable-array
+
   // The constructor just stores the root node and creates empty stacks.
   constructor(root) {
     _defineProperty(this, "root", void 0);
-
     _defineProperty(this, "_currentNode", void 0);
-
     _defineProperty(this, "_containers", void 0);
-
     _defineProperty(this, "_indexes", void 0);
-
     _defineProperty(this, "_ancestors", void 0);
+    this.root = root;
 
-    this.root = root; // When the callback is called, this property will hold the
+    // When the callback is called, this property will hold the
     // node that is currently being traversed.
+    this._currentNode = null;
 
-    this._currentNode = null; // This is a stack of the objects and arrays that we've
+    // This is a stack of the objects and arrays that we've
     // traversed through before reaching the currentNode.
     // It is different than the ancestors array.
+    this._containers = new Stack();
 
-    this._containers = new Stack(); // This stack has the same number of elements as the _containers
+    // This stack has the same number of elements as the _containers
     // stack. The last element of this._indexes[] is the index of
     // the current node in the object or array that is the last element
     // of this._containers[]. If the last element of this._containers[] is
     // an array, then the last element of this stack will be a number.
     // Otherwise if the last container is an object, then the last index
     // will be a string property name.
+    this._indexes = new Stack();
 
-    this._indexes = new Stack(); // This is a stack of the ancestor nodes of the current one.
+    // This is a stack of the ancestor nodes of the current one.
     // It is different than the containers[] stack because it only
     // includes nodes, not arrays.
-
     this._ancestors = new Stack();
   }
+
   /**
    * Return the current node in the traversal. Any time the traversal
    * callback is called, this method will return the name value as the
    * first argument to the callback.
    */
-
-
   currentNode() {
     return this._currentNode || this.root;
   }
+
   /**
    * Return the parent of the current node, if there is one, or null.
    */
-
-
   parent() {
     return this._ancestors.top();
   }
+
   /**
    * Return an array of ancestor nodes. The first element of this array is
    * the same as this.parent() and the last element is the root node. If we
@@ -1374,79 +1288,68 @@ class TraversalState {
    * This method makes a copy of the internal state, so modifications to the
    * returned array have no effect on the traversal.
    */
-
-
   ancestors() {
     return this._ancestors.values();
   }
+
   /**
    * Return the next sibling of this node, if it has one, or null otherwise.
    */
-
-
   nextSibling() {
-    const siblings = this._containers.top(); // If we're at the root of the tree or if the parent is an
-    // object instead of an array, then there are no siblings.
-
+    const siblings = this._containers.top();
 
+    // If we're at the root of the tree or if the parent is an
+    // object instead of an array, then there are no siblings.
     if (!siblings || !Array.isArray(siblings)) {
       return null;
-    } // The top index is a number because the top container is an array
-
+    }
 
+    // The top index is a number because the top container is an array
     const index = this._indexes.top();
-
     if (siblings.length > index + 1) {
       return siblings[index + 1];
     }
-
     return null; // There is no next sibling
   }
+
   /**
    * Return the previous sibling of this node, if it has one, or null
    * otherwise.
    */
-
-
   previousSibling() {
-    const siblings = this._containers.top(); // If we're at the root of the tree or if the parent is an
-    // object instead of an array, then there are no siblings.
-
+    const siblings = this._containers.top();
 
+    // If we're at the root of the tree or if the parent is an
+    // object instead of an array, then there are no siblings.
     if (!siblings || !Array.isArray(siblings)) {
       return null;
-    } // The top index is a number because the top container is an array
-
+    }
 
+    // The top index is a number because the top container is an array
     const index = this._indexes.top();
-
     if (index > 0) {
       return siblings[index - 1];
     }
-
     return null; // There is no previous sibling
   }
+
   /**
    * Remove the next sibling node (if there is one) from the tree.  Returns
    * the removed sibling or null. This method makes it easy to traverse a
    * tree and concatenate adjacent text nodes into a single node.
    */
-
-
   removeNextSibling() {
     const siblings = this._containers.top();
-
     if (siblings && Array.isArray(siblings)) {
       // top index is a number because top container is an array
       const index = this._indexes.top();
-
       if (siblings.length > index + 1) {
         return siblings.splice(index + 1, 1)[0];
       }
     }
-
     return null;
   }
+
   /**
    * Replace the current node in the tree with the specified nodes.  If no
    * nodes are passed, this is a node deletion. If one node (or array) is
@@ -1458,37 +1361,30 @@ class TraversalState {
    * This method throws an error if you attempt to replace the root node of
    * the tree.
    */
-
-
   replace() {
     const parent = this._containers.top();
-
     if (!parent) {
       throw new perseusError.PerseusError("Can't replace the root of the tree", perseusError.Errors.Internal);
-    } // The top of the container stack is either an array or an object
+    }
+
+    // The top of the container stack is either an array or an object
     // and the top of the indexes stack is a corresponding array index
     // or object property. This is hard for Flow, so we have to do some
     // unsafe casting and be careful when we use which cast version
-
-
     for (var _len = arguments.length, replacements = new Array(_len), _key = 0; _key < _len; _key++) {
       replacements[_key] = arguments[_key];
     }
-
     if (Array.isArray(parent)) {
-      const index = this._indexes.top(); // For an array parent we just splice the new nodes in
-
-
-      parent.splice(index, 1, ...replacements); // Adjust the index to account for the changed array length.
+      const index = this._indexes.top();
+      // For an array parent we just splice the new nodes in
+      parent.splice(index, 1, ...replacements);
+      // Adjust the index to account for the changed array length.
       // We don't want to traverse any of the newly inserted nodes.
-
       this._indexes.pop();
-
       this._indexes.push(index + replacements.length - 1);
     } else {
-      const property = this._indexes.top(); // For an object parent we care how many new nodes there are
-
-
+      const property = this._indexes.top();
+      // For an object parent we care how many new nodes there are
       if (replacements.length === 0) {
         // Deletion
         delete parent[property];
@@ -1501,16 +1397,16 @@ class TraversalState {
       }
     }
   }
+
   /**
    * Returns true if the current node has a previous sibling and false
    * otherwise. If this method returns false, then previousSibling() will
    * return null, and goToPreviousSibling() will throw an error.
    */
-
-
   hasPreviousSibling() {
     return Array.isArray(this._containers.top()) && this._indexes.top() > 0;
   }
+
   /**
    * Modify this traversal state object to have the state it would have had
    * when visiting the previous sibling. Note that you may want to use
@@ -1519,31 +1415,27 @@ class TraversalState {
    * traversals, but is used by the Selector class for matching multi-node
    * selectors.
    */
-
-
   goToPreviousSibling() {
     if (!this.hasPreviousSibling()) {
       throw new perseusError.PerseusError("goToPreviousSibling(): node has no previous sibling", perseusError.Errors.Internal);
     }
-
-    this._currentNode = this.previousSibling(); // Since we know that we have a previous sibling, we know that
+    this._currentNode = this.previousSibling();
+    // Since we know that we have a previous sibling, we know that
     // the value on top of the stack is a number, but we have to do
     // this unsafe cast because Flow doesn't know that.
-
     const index = this._indexes.pop();
-
     this._indexes.push(index - 1);
   }
+
   /**
    * Returns true if the current node has an ancestor and false otherwise.
    * If this method returns false, then the parent() method will return
    * null and goToParent() will throw an error
    */
-
-
   hasParent() {
     return this._ancestors.size() !== 0;
   }
+
   /**
    * Modify this object to look like it will look when we (later) visit the
    * parent node of this node. You should not modify the instance passed to
@@ -1553,33 +1445,30 @@ class TraversalState {
    * matching multi-node selectors that involve parent and ancestor
    * selectors.
    */
-
-
   goToParent() {
     if (!this.hasParent()) {
       throw new perseusError.PerseusError("goToParent(): node has no ancestor", perseusError.Errors.NotAllowed);
     }
+    this._currentNode = this._ancestors.pop();
 
-    this._currentNode = this._ancestors.pop(); // We need to pop the containers and indexes stacks at least once
+    // We need to pop the containers and indexes stacks at least once
     // and more as needed until we restore the invariant that
     // this._containers.top()[this.indexes.top()] === this._currentNode
     //
-
-    while (this._containers.size() && // This is safe, but easier to just disable flow than do casts
+    while (this._containers.size() &&
+    // This is safe, but easier to just disable flow than do casts
     // $FlowFixMe[incompatible-use]
     this._containers.top()[this._indexes.top()] !== this._currentNode) {
       this._containers.pop();
-
       this._indexes.pop();
     }
   }
+
   /**
    * Return a new TraversalState object that is a copy of this one.
    * This method is useful in conjunction with the mutating methods
    * goToParent() and goToPreviousSibling().
    */
-
-
   clone() {
     const clone = new TraversalState(this.root);
     clone._currentNode = this._currentNode;
@@ -1588,18 +1477,17 @@ class TraversalState {
     clone._ancestors = this._ancestors.clone();
     return clone;
   }
+
   /**
    * Returns true if this TraversalState object is equal to that
    * TraversalState object, or false otherwise. This method exists
    * primarily for use by our unit tests.
    */
-
-
   equals(that) {
     return this.root === that.root && this._currentNode === that._currentNode && this._containers.equals(that._containers) && this._indexes.equals(that._indexes) && this._ancestors.equals(that._ancestors);
   }
-
 }
+
 /**
  * This class is an internal utility that just treats an array as a stack
  * and gives us a top() method so we don't have to write expressions like
@@ -1608,76 +1496,63 @@ class TraversalState {
  * modifying our internal stacks. The use of this Stack abstraction makes
  * the TraversalState class simpler in a number of places.
  */
-
 class Stack {
-  // eslint-disable-next-line ft-flow/no-mutable-array
   constructor(array) {
     _defineProperty(this, "stack", void 0);
-
     this.stack = array ? array.slice(0) : [];
   }
-  /** Push a value onto the stack. */
-
 
+  /** Push a value onto the stack. */
   push(v) {
     this.stack.push(v);
   }
-  /** Pop a value off of the stack. */
-
 
+  /** Pop a value off of the stack. */
   pop() {
+    // @ts-expect-error [FEI-5003] - TS2322 - Type 'T | undefined' is not assignable to type 'T'.
     return this.stack.pop();
   }
-  /** Return the top value of the stack without popping it. */
-
 
+  /** Return the top value of the stack without popping it. */
   top() {
     return this.stack[this.stack.length - 1];
   }
-  /** Return a copy of the stack as an array */
-
 
+  /** Return a copy of the stack as an array */
   values() {
     return this.stack.slice(0);
   }
-  /** Return the number of elements in the stack */
-
 
+  /** Return the number of elements in the stack */
   size() {
     return this.stack.length;
   }
-  /** Return a string representation of the stack */
-
 
+  /** Return a string representation of the stack */
   toString() {
     return this.stack.toString();
   }
-  /** Return a shallow copy of the stack */
-
 
+  /** Return a shallow copy of the stack */
   clone() {
     return new Stack(this.stack);
   }
+
   /**
    * Compare this stack to another and return true if the contents of
    * the two arrays are the same.
    */
-
-
   equals(that) {
     if (!that || !that.stack || that.stack.length !== this.stack.length) {
       return false;
     }
-
     for (let i = 0; i < this.stack.length; i++) {
       if (this.stack[i] !== that.stack[i]) {
         return false;
       }
     }
-
     return true;
   }
-
 }
 
 // Define the shape of the linter context object that is passed through the
@@ -1695,6 +1570,8 @@ const linterContextDefault = {
 };
 
 const allLintRules = AllRules.filter(r => r.severity < Rule.Severity.BULK_WARNING);
+
+//
 // Run the Perseus linter over the specified markdown parse tree,
 // with the specified context object, and
 // return a (possibly empty) array of lint warning objects.  If the
@@ -1718,26 +1595,26 @@ const allLintRules = AllRules.filter(r => r.severity < Rule.Severity.BULK_WARNIN
 // in that case). This would allow the one function to be used for both
 // online linting and batch linting.
 //
-
 function runLinter(tree, context, highlight) {
   let rules = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : allLintRules;
   const warnings = [];
-  const tt = new TreeTransformer(tree); // The markdown parser often outputs adjacent text nodes. We
-  // coalesce them before linting for efficiency and accuracy.
+  const tt = new TreeTransformer(tree);
 
+  // The markdown parser often outputs adjacent text nodes. We
+  // coalesce them before linting for efficiency and accuracy.
   tt.traverse((node, state, content) => {
     if (TreeTransformer.isTextNode(node)) {
       let next = state.nextSibling();
-
       while (TreeTransformer.isTextNode(next)) {
-        // $FlowFixMe[prop-missing]
-        // $FlowFixMe[incompatible-use]
+        // @ts-expect-error [FEI-5003] - TS2339 - Property 'content' does not exist on type 'TreeNode'. | TS2533 - Object is possibly 'null' or 'undefined'. | TS2339 - Property 'content' does not exist on type 'TreeNode'.
         node.content += next.content;
         state.removeNextSibling();
         next = state.nextSibling();
       }
     }
-  }); // HTML tables are complicated, and the CSS we use in
+  });
+
+  // HTML tables are complicated, and the CSS we use in
   // ../components/lint.jsx to display lint does not work to
   // correctly position the lint indicators in the margin when the
   // lint is inside a table. So as a workaround we keep track of all
@@ -1754,28 +1631,30 @@ function runLinter(tree, context, highlight) {
   // issue too. But using JavaScript has its own downsides: there is
   // risk that the linter JavaScript would interfere with
   // widget-related Javascript.
-
   let tableWarnings = [];
-  let insideTable = false; // Traverse through the nodes of the parse tree. At each node, loop
+  let insideTable = false;
+
+  // Traverse through the nodes of the parse tree. At each node, loop
   // through the array of lint rules and check whether there is a
   // lint violation at that node.
-
   tt.traverse((node, state, content) => {
-    const nodeWarnings = []; // If our rule is only designed to be tested against a particular
+    const nodeWarnings = [];
+
+    // If our rule is only designed to be tested against a particular
     // content type and we're not in that content type, we don't need to
     // consider that rule.
+    const applicableRules = rules.filter(r => r.applies(context));
 
-    const applicableRules = rules.filter(r => r.applies(context)); // Generate a stack so we can identify our position in the tree in
+    // Generate a stack so we can identify our position in the tree in
     // lint rules
-
     const stack = [...context.stack];
     stack.push(node.type);
-    const nodeContext = { ...context,
+    const nodeContext = {
+      ...context,
       stack: stack.join(".")
     };
     applicableRules.forEach(rule => {
       const warning = rule.check(node, state, content, nodeContext);
-
       if (warning) {
         // The start and end locations are relative to this
         // particular node, and so are not generally very useful.
@@ -1785,32 +1664,34 @@ function runLinter(tree, context, highlight) {
         // character range that will be useful
         if (warning.start || warning.end) {
           warning.target = content.substring(warning.start, warning.end);
-        } // Add the warning to the list of all lint we've found
+        }
 
+        // Add the warning to the list of all lint we've found
+        warnings.push(warning);
 
-        warnings.push(warning); // If we're going to be highlighting lint, then we also
+        // If we're going to be highlighting lint, then we also
         // need to keep track of warnings specific to this node.
-
         if (highlight) {
           nodeWarnings.push(warning);
         }
       }
-    }); // If we're not highlighting lint in the tree, then we're done
-    // traversing this node.
+    });
 
+    // If we're not highlighting lint in the tree, then we're done
+    // traversing this node.
     if (!highlight) {
       return;
-    } // If the node we are currently at is a table, and there was lint
-    // inside the table, then we want to add that lint here
-
+    }
 
+    // If the node we are currently at is a table, and there was lint
+    // inside the table, then we want to add that lint here
     if (node.type === "table") {
       if (tableWarnings.length) {
         nodeWarnings.push(...tableWarnings);
-      } // We're not in a table anymore, and don't have to remember
-      // the warnings for the table
-
+      }
 
+      // We're not in a table anymore, and don't have to remember
+      // the warnings for the table
       insideTable = false;
       tableWarnings = [];
     } else if (!insideTable) {
@@ -1821,14 +1702,17 @@ function runLinter(tree, context, highlight) {
       // do this check each time... We can just wait until we ascend
       // up to the table, then we'll know we're out of it.
       insideTable = state.ancestors().some(n => n.type === "table");
-    } // If we are inside a table and there were any warnings on
+    }
+
+    // If we are inside a table and there were any warnings on
     // this node, then we need to save the warnings for display
     // on the table itself
-
-
     if (insideTable && nodeWarnings.length) {
+      // @ts-expect-error [FEI-5003] - TS2345 - Argument of type 'any' is not assignable to parameter of type 'never'.
       tableWarnings.push(...nodeWarnings);
-    } // If there were any warnings on this node, and if we're highlighting
+    }
+
+    // If there were any warnings on this node, and if we're highlighting
     // lint, then reparent the node so we can highlight it. Note that
     // a single node can have multiple warnings. If this happends we
     // concatenate the warnings and newline separate them. (The lint.jsx
@@ -1841,19 +1725,17 @@ function runLinter(tree, context, highlight) {
     // Note that even if we're inside a table, we still reparent the
     // linty node so that it can be highlighted. We just make a note
     // of whether this lint is inside a table or not.
-
-
     if (nodeWarnings.length) {
       nodeWarnings.sort((a, b) => {
         return a.severity - b.severity;
       });
-
       if (node.type !== "text" || nodeWarnings.length > 1) {
         // If the linty node is not a text node, or if there is more
         // than one warning on a text node, then reparent the entire
         // node under a new lint node and put the warnings there.
         state.replace({
           type: "lint",
+          // @ts-expect-error [FEI-5003] - TS2345 - Argument of type '{ type: string; content: TreeNode; message: string; ruleName: any; blockHighlight: any; insideTable: boolean; severity: any; }' is not assignable to parameter of type 'TreeNode'.
           content: node,
           message: nodeWarnings.map(w => w.message).join("\n\n"),
           ruleName: nodeWarnings[0].rule,
@@ -1887,28 +1769,27 @@ function runLinter(tree, context, highlight) {
         // single line, so keeping them combined in that case might
         // be the best thing, anyway.
         //
-        // $FlowFixMe[prop-missing]
+        // @ts-expect-error [FEI-5003] - TS2339 - Property 'content' does not exist on type 'TreeNode'.
         const content = node.content; // Text nodes have content
-
         const warning = nodeWarnings[0]; // There is only one warning.
         // These are the lint boundaries within the content
-
         const start = warning.start || 0;
         const end = warning.end || content.length;
         const prefix = content.substring(0, start);
         const lint = content.substring(start, end);
         const suffix = content.substring(end);
+        // TODO(FEI-5003): Give this a real type.
         const replacements = []; // What we'll replace the node with
-        // The prefix text node, if there is one
 
+        // The prefix text node, if there is one
         if (prefix) {
           replacements.push({
             type: "text",
             content: prefix
           });
-        } // The lint node wrapped around the linty text
-
+        }
 
+        // The lint node wrapped around the linty text
         replacements.push({
           type: "lint",
           content: {
@@ -1919,17 +1800,18 @@ function runLinter(tree, context, highlight) {
           ruleName: warning.rule,
           insideTable: insideTable,
           severity: warning.severity
-        }); // The suffix node, if there is one
+        });
 
+        // The suffix node, if there is one
         if (suffix) {
           replacements.push({
             type: "text",
             content: suffix
           });
-        } // Now replace the lint text node with the one to three
-        // nodes in the replacement array
-
+        }
 
+        // Now replace the lint text node with the one to three
+        // nodes in the replacement array
         state.replace(...replacements);
       }
     }
@@ -1938,7 +1820,8 @@ function runLinter(tree, context, highlight) {
 }
 function pushContextStack(context, name) {
   const stack = context.stack || [];
-  return { ...context,
+  return {
+    ...context,
     stack: stack.concat(name)
   };
 }