Parse and query computer programs source code

Usage no npm install needed!

<script type="module">
  import renovatebotParserUtils from 'https://cdn.skypack.dev/@renovatebot/parser-utils';


Renovate parser utils

Code parsing library filling the gap between ad-hoc regular expressions and parsers generated with complete grammar description.

License: MIT Trunk


We are creating Renovate as a multi-language tool for keeping dependency versions up to date. While most package managers can rely on the programming language they're written in, we need some uniform way to deal with the variety of dependency description conventions using only TypeScript.

Some package managers use the relatively simple JSON format, like Node.js for example. Other tools, mostly related to DevOps, use the more elaborate YAML format. The trickiest thing is to deal with dependencies described by particular programming languages: for example, Gemfiles and Podfiles are written in Ruby, build.gradle files use Groovy, sbt leverages Scala, while bazel created its own language Starlark.

One approach is to use regular expressions, which is very easy but doesn't scale well to cover all syntactic variations. For example, we want to treat string literals 'foobar', "foobar" and """foobar""" as equivalent.

Another approach could be that we describe languages with tools like PEG.js or nearley.js. Although these are great tools, this approach has downsides for our use-case:

  • We have to define and test the complete grammar for each language, even if we're interested mostly in string literals, variable definitions and their scopes
  • Even small source errors lead to rejecting the whole file, while we want to skip the fragments that are misunderstood by the parser
  • We still would need to deal with a variety of language-specific AST tree formats, which may or may not have things in common.

The parser-utils library is an attempt to fill the gap between the approaches mentioned above. We leverage the moo library to produce tokens, which we group into the tree available for your queries. The query API is inspired by parsimmon, though it operates on the token level instead of the raw character sequence.


  • Be good enough for source code written well enough.
  • Go much further than is possible with regular expressions.
  • Respect location info. Once something interesting is found, it can be located in the source test via offset info. Once something is written, it should not affect the whole document formatting.
  • Incorporate poorly recognized fragments into the output and continue parsing.
  • Expressive API which helps you focus on syntactic structure, not the space or quote variations.
  • Allow to define a language of interest quickly. Provide definitions for popular languages out-of-the-box.


  • Catch all syntactic edge-cases
  • Compete with parsing tools with strict grammar definitions


npm install @renovatebot/parser-utils


yarn add @renovatebot/parser-utils


The library is divided into multiple levels of abstraction, from the lowest to the highest one:


Configures the moo tokenizer for specific language features such as:

  • Brackets: (), {}, [], etc
  • Strings: 'foo', "bar", """baz""", etc
  • Templates: ${foo}, {{bar}}, $(baz), etc
  • Single-line comments: #..., //..., etc
  • Multi-line comments: /*...*/, (*...*), etc
  • Identifiers: foo, Bar, _baz123, etc
  • Line joins: if the line ends with \, the next one will be treated as its continuation

Refer to the LexerConfig interface for more details. Also check out our usage example for Python.


This layer is responsible for transforming the token sequence to the nested tree with the tokens as leafs. Internally, we're using functional zipper data structure to perform queries on the tree.


To understand parser-utils queries, it's useful to keep in mind the principle of how regular expressions work. Each query represents sequence of adjacent tokens and tree elements.

For example, consider following query:


It will match on the following fragments 2 + 2 = 4 or 2+2=4, but won't match on 2+2==4 nor 4=2+2.

Once brackets are defined, their inner contents will be wrapped into a tree node. It's possible to query tree nodes:

  search: q.num('2').op('+').num('2'),

The above query will match these strings:

  • (2 + 2) = 4
  • [2 + 2] = 4
  • (1 + 2 + 2 - 1) = 4
  • (1 + (2 + 2) - 1) = 4

It won't match 2 + 2 = 4 because there is no any nesting.


Add link to CONTRIBUTING.md file that will explain how to get started developing for this package. This can be done once things stabilize enough for us to accept external contributions.