9 releases (4 breaking)

0.5.7 Mar 12, 2024
0.5.6 Mar 12, 2024
0.4.0 Jan 9, 2024
0.3.1 Nov 26, 2023
0.0.2 Sep 28, 2023

#383 in Development tools

Download history 1696/week @ 2024-08-18 1598/week @ 2024-08-25 1681/week @ 2024-09-01 1610/week @ 2024-09-08 1715/week @ 2024-09-15 1887/week @ 2024-09-22 1895/week @ 2024-09-29 1737/week @ 2024-10-06 1615/week @ 2024-10-13 1526/week @ 2024-10-20 2971/week @ 2024-10-27 2459/week @ 2024-11-03 2598/week @ 2024-11-10 3906/week @ 2024-11-17 4226/week @ 2024-11-24 3502/week @ 2024-12-01

14,266 downloads per month
Used in 4 crates

MIT/Apache

4.5MB
108K SLoC

Biome - Toolchain of the web

Discord chat cargo version

biome_js_parser

Biome's JavaScript parser implementation. Follow the documentation.


lib.rs:

Extremely fast, lossless, and error tolerant JavaScript Parser.

The parser uses an abstraction over non-whitespace tokens. This allows us to losslessly or lossly parse code without requiring explicit handling of whitespace. The parser yields events, not an AST, the events are resolved into untyped syntax nodes, which can then be casted into a typed AST.

The parser is able to produce a valid AST from any source code. Erroneous productions are wrapped into ERROR syntax nodes, the original source code is completely represented in the final syntax nodes.

You probably do not want to use the parser struct, unless you want to parse fragments of Js source code or make your own productions. Instead use functions such as [parse_script], and [parse_module] which offer abstracted versions for parsing.

For more finer control, use parse or [parse_js_with_cache],

Notable features of the parser are:

  • Extremely fast parsing and lexing through the extremely fast lexer.
  • Ability to do Lossy or Lossless parsing on demand without explicit whitespace handling.
  • Customizable, able to parse any fragments of JS code at your discretion.
  • Completely error tolerant, able to produce an AST from any source code.
  • Zero cost for converting untyped nodes to a typed AST.
  • Ability to go from AST to SyntaxNodes to SyntaxTokens to source code and back very easily with nearly zero cost.
  • Very easy tree traversal through SyntaxNode.
  • Descriptive errors with multiple labels and notes.
  • Very cheap cloning, cloning an ast node or syntax node is the cost of adding a reference to an Rc.
  • Cheap incremental reparsing of changed text.

The crate further includes utilities such as:

  • ANSI syntax highlighting of nodes or text through lexer.

It is inspired by the rust analyzer parser but adapted for JavaScript.

Syntax Nodes vs AST Nodes

The crate relies on a concept of untyped biome_js_syntax::JsSyntaxNodes vs typed biome_rowan::AstNodes. Syntax nodes represent the syntax tree in an untyped way. They represent a location in an immutable tree with two pointers. The syntax tree is composed of biome_js_syntax::JsSyntaxNodes and biome_js_syntax::JsSyntaxTokens in a nested tree structure. Each node can have parents, siblings, children, descendants, etc.

biome_rowan::AstNodes represent a typed version of a syntax node. They have the same exact representation as syntax nodes therefore a conversion between either has zero runtime cost. Every piece of data of an ast node is optional, this is due to the fact that the parser is completely error tolerant.

Each representation has its advantages:

SyntaxNodes

  • Very simple traversing of the syntax tree through functions on them.
  • Easily able to convert to underlying text, range, or tokens.
  • Contain all whitespace bound to the underlying production (in the case of lossless parsing).
  • Can be easily converted into its typed representation with zero cost.
  • Can be turned into a pretty representation with fmt debug.

AST Nodes

  • Easy access to properties of the underlying production.
  • Zero cost conversion to a syntax node.

In conclusion, the use of both representations means we are not constrained to acting through typed nodes. Which makes traversal hard and you often have to resort to autogenerated visitor patterns. AST nodes are simply a way to easily access subproperties of a syntax node.event;

Parser Tests

Parser tests are comments that start with test or test_err followed by the test name, and then the code on its own line.

// test js feature_name
// let a = { new_feature : "" }
// let b = { new_feature : "" }
fn parse_new_feature(p: &mut Parser) -> ParsedSyntax {}
  • test: Test for a valid program. Should not produce any diagnostics nor missing nodes.
  • test_err: Test for a program with syntax error. Must produce a diagnostic.

By default, the test runs as a JavaScript Module. You can customize the source type by specifying the file type after test or test_err

// test ts typescript_test
// console.log("a");
if a {
    // ..
}

The supported source types are:

  • js
  • jsx
  • ts
  • tsx
  • d.ts

To enable script mode, add a // script comment to the code.

To extract the test cases, run cargo codegen test. Running the codegen is necessary whenever you add, change, or remove inline tests .

To update the test output, run

Linux/MacOs:

env UPDATE_EXPECT=1 cargo test

Windows

set UPDATE_EXPECT=1 & cargo test

Dependencies

~9–19MB
~245K SLoC