confirm that a SpiderMonkey format AST represents an ECMAScript program
-
Updated
Aug 24, 2015 - JavaScript
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
confirm that a SpiderMonkey format AST represents an ECMAScript program
为代码自动加 try-catch,捕获异常。wrap function body with try-catch
esmangle is mangler / minifier for Mozilla Parser API AST
A small ECMAScript parser, tokenizer and minifier written in JavaScript.
Babel plugin that scans the AST for require calls and import statements
Proper (AST-based) JavaScript code templating with source maps support.
Javascript AST parser
Plugin that adds a `.captureSet()` method to snapdragon, for matching and capturing substrings that have an `open` and `close`, like braces, brackets, etc
Snapdragon plugin that adds an `isInside` method to the compiler instance for checking if a node is currently inside a given node type.
Snapdragon plugin that adds a capture method to the parser instance, which allows you to capture tokens with a single line of code
Snapdragon plugin for converting a cheerio AST to a snapdragon AST.
A parser class for simple formulae.
A developer tool for visualizing a React application's component hierarchy.
relatively small and ridiculously fast parser for all versions of ECMAScript/Javascript, written in the greatest common divisor of all versions of ECMAScript