Package - jsdoc-type-pratt-parser

This project is a parser for jsdoc types. It is heavily inspired by the existing libraries catharsis and jsdoctypeparser, but does not use PEG.js, instead it is written as a pratt parser.

Live Demo

Simple live demo can be found at: https://simonseyock.github.io/jsdoc-type-pratt-parser/

Getting started

npm install jsdoc-type-pratt-parser@alpha

import { parse } from 'jsdoc-type-pratt-parser'

const result = parse('myType.<string>', 'closure')

This library supports compatibility modes for catharsis and jsdoctypeparser. The provided transform functions attempt to transform the output to the expected output of the target library. This will not always be the same as some types are parsed differently. These modes are thought to make transition easier, but it is advised to use the native output as this will be more uniform and will contain more information.

Catharsis compat mode:

import { parse, catharsisTransform } from 'jsdoc-type-pratt-parser'

const result = catharsisTransform(parse('myType.<string>', 'closure'))

Jsdoctypeparser compat mode:

import { parse, jtpTransform } from 'jsdoc-type-pratt-parser'

const result = jtpTransform(parse('myType.<string>', 'closure'))

Stringify:

import { stringify } from 'jsdoc-type-pratt-parser'

const val = stringify({ type: 'NAME', value: 'name'}) // -> 'name'

You can customize the stringification by using stringifyRules and transform:

import { stringifyRules, transform } from 'jsdoc-type-pratt-parser'

const rules = stringifyRules()

// `result` is the current node and `transform` is a function to transform child nodes.
rules.NAME = (result, transform) => 'something else'

const val = transform(rules, { type: 'NAME', value: 'name'}) // -> 'something else'

You can traverse a result tree with the traverse function:

import { traverse } from 'jsdoc-type-pratt-parser'

// property is the name of the property on parent that contains node
function onEnter(node, parent, property) {
    console.log(node.type)
}

// an onEnter and/or an onLeave function can be supplied
traverse({ type: 'NAME', value: 'name'}, onEnter, console.log)

You can also build your own transform rules by implementing the TransformRules<TransformResultType> interface or you can build upon the identity ruleset like this:

import { identityTransformRules, transform } from 'jsdoc-type-pratt-parser'

const myRules = identityTransformRules()
myRules.NAME = () => ({ type: 'NAME', value: 'funky' })

const val = transform(myRules, result)

Available Grammars

Three different modes (grammars) are supported: 'jsdoc', 'closure' and 'typescript'

Tests Status

This parser runs most tests of https://github.com/hegemonic/catharsis and https://github.com/jsdoctypeparser/jsdoctypeparser. It compares the results of the different parsing libraries. If you want to find out where the output differs, look in the tests for the comments // This seems to be an error of ... or the differ keyword which indicates that differing results are produced.

API Documentation

An API documentation can be found here: https://simonseyock.github.io/jsdoc-type-pratt-parser/docs/modules.html

Performance

A simple performance comparision using Benchmark.js produced the following results:

Testing expression: Name
catharsis x 10,194 ops/sec ±22.98% (58 runs sampled)
jsdoc-type-pratt-parser x 238,233 ops/sec ±2.11% (84 runs sampled)
jsdoctypeparser x 29,201 ops/sec ±15.65% (76 runs sampled)
The fastest was jsdoc-type-pratt-parser

Testing expression: Array<number>
catharsis x 5,063 ops/sec ±2.89% (82 runs sampled)
jsdoc-type-pratt-parser x 84,744 ops/sec ±5.34% (77 runs sampled)
jsdoctypeparser x 10,964 ops/sec ±24.98% (52 runs sampled)
The fastest was jsdoc-type-pratt-parser

Testing expression: { keyA: Type<A | "string val" >, keyB: function(string, B): A }
catharsis x 206 ops/sec ±17.93% (59 runs sampled)
jsdoc-type-pratt-parser x 7,706 ops/sec ±12.20% (54 runs sampled)
jsdoctypeparser x 2,456 ops/sec ±22.06% (49 runs sampled)
The fastest was jsdoc-type-pratt-parser

catharsis was used without cache, as this is just a simple lookup table that could easily be implemented for any parser.

Current Tags

1.0.0-alpha.24 ... alpha (4 years ago)
3.2.0-dev.3 ... dev (2 years ago)
4.1.0 ... latest (5 months ago)

51 Versions

4.1.0 ... 5 months ago
4.0.0 ... 2 years ago
3.2.0-dev.3 ... 2 years ago
3.2.0-dev.2 ... 2 years ago
3.2.0-dev.1 ... 2 years ago
3.1.0 ... 3 years ago
3.0.1 ... 3 years ago
3.0.0 ... 3 years ago
2.2.5 ... 3 years ago
2.2.4 ... 3 years ago
2.2.3 ... 3 years ago
2.2.2 ... 3 years ago
2.2.1 ... 3 years ago
2.2.0 ... 3 years ago
2.1.0 ... 3 years ago
2.0.2 ... 3 years ago
2.0.1 ... 3 years ago
2.0.0 ... 3 years ago
1.2.0 ... 3 years ago
1.1.1 ... 3 years ago
1.0.8 ... 4 years ago
1.0.7 ... 4 years ago
1.0.6 ... 4 years ago
1.0.4 ... 4 years ago
1.0.3 ... 4 years ago
1.0.2 ... 4 years ago
1.0.1 ... 4 years ago
1.0.0 ... 4 years ago
1.0.0-alpha.24 ... 4 years ago
1.0.0-alpha.23 ... 4 years ago
1.0.0-alpha.22 ... 4 years ago
1.0.0-alpha.21 ... 4 years ago
1.0.0-alpha.20 ... 4 years ago
1.0.0-alpha.19 ... 4 years ago
1.0.0-alpha.18 ... 4 years ago
1.0.0-alpha.17 ... 4 years ago
1.0.0-alpha.16 ... 4 years ago
1.0.0-alpha.15 ... 4 years ago
1.0.0-alpha.14 ... 4 years ago
1.0.0-alpha.13 ... 4 years ago
1.0.0-alpha.12.0 ... 4 years ago
1.0.0-alpha.11.0 ... 4 years ago
1.0.0-alpha.10.0 ... 4 years ago
1.0.0-alpha.9.0 ... 4 years ago
1.0.0-alpha.8.0 ... 4 years ago
1.0.0-alpha.7.0 ... 4 years ago
1.0.0-alpha.6.0 ... 4 years ago
1.0.0-alpha.4.0 ... 4 years ago
1.0.0-alpha.3.0 ... 4 years ago
1.0.0-alpha.2 ... 4 years ago
1.0.0-alpha.1 ... 4 years ago