astq

ASTq

Abstract Syntax Tree (AST) Query Engine

Installation

Node environments (with NPM package manager):

$ npm install astq

Browser environments (with Bower package manager):

$ bower install astq

About

ASTq is a Abstract Syntax Tree (AST) query engine library for JavaScript, i.e., it allows you to query nodes of an arbitary AST-style hierarchical data structure with the help of a powerful XPath-inspired query language.

Usage

The ASTq API, here assumed to be exposed through the variable ASTQ, provides the following methods (in a notation somewhat resembling TypeScript type definitions) is:

Selector/Query Domain Specific Language

ASTq uses an XPath-inspired Domain Specific Language (DSL) for querying the supplied AST-style hierarchical data structure.

By Example

At its simplest form it looks like a POSIX filesystem path:

Foo/Bar/Quux

This means: query and return all nodes of type Quux, which in turn are childs of nodes of type Bar, which in turn are childs of nodes of type Foo, which in turn has to be start node.

A little bit sophisticated query, showing more of axis and a filter:

// Foo [ /Bar [ @bar == 'baz1' || @bar == 'baz2' ] && /Quux ]

This means: query and return all nodes anywhere under the start node which are of type Foo and which have both childs of type Bar -- and with an attribute bar of values baz1 or baz2 -- and childs of type Quux.

By Grammar

In general a query consists of one or more individual query paths, separated by comma. A path consists of a mandatory initial query step and optionally zero or more subsequent query steps:

query            ::= path (, path)*
path             ::= step-initial step-subsequent*
step-initial     ::= axis? match filter?
step-subsequent  ::= axis  match filter?

A query step consists of an (optional) axis (direct/any child, direct/any left/right sibling or direct/any parent), a (mandatory) type match and an (optional) filter expression:

axis             ::= "//" | "/" | "~~>" | "~>" | "<~~" | "<~" | "~~^" | "~^"
match            ::= id | "*"
filter           ::= "[" expr "]"

The power comes through the optional filter expression: it can be applied to each query step and it recursively(!) can contain sub-queries! A combined example is:

// Foo / Bar [ / Baz [ @bar == 'baz' ] && / Quux ], // Foo2
+------------------------------------------------+  +-----+  query
+----+ +-----------------------------------------+  +-----+  path
+----+ +-----------------------------------------+  +-----+  step
++     +       +                          +         ++       axis
   +-+   +-+     +-+                        +--+       +--+  match
             +-----------------------------------+           filter
               +-------------------------------+             expr
                     +---------------+                       filter
                       +----------+                          expr

The result of a query are always all nodes which match against the last query step of any path. The queries in filter expressions just lead to a boolean decision for the filter, but never cause any resulting nodes theirself.

An expression can be either a ternary/binary conditional expression, logical expression, bitwise expression, relational expression, arithmethical expression, functional call, attribute reference, query parameter, literal value, parenthesis expression or path of a sub-query.

expr             ::= conditional
                   | logical
                   | bitwise
                   | relational
                   | arithmentical
                   | function-call
                   | attribute-ref
                   | query-parameter
                   | literal
                   | parenthesis
                   | sub-query
conditional      ::= expr "?" expr ":" expr
                   | expr "?:" expr
logical          ::= expr ("&&" | "||") expr
                   | "!" expr
bitwise          ::= expr ("&" | "|" | "<<" | ">>") expr
                   | "~" expr
relational       ::= expr ("==" | "!=" | "<=" | ">=" | "<" | ">" | "=~" | "!~") expr
arithmethical    ::= expr ("+" | "-" | "*" | "/" | "%" | "**") expr
function-call    ::= id "(" (param ("," param)*)? ")"
attribute-ref    ::= "@" id
query-parameter  ::= "{" id "}"
literal          ::= string | regexp | number | value
parenthesis      ::= "(" expr ")"
sub-query        ::= path           // <-- ESSENTIAL RECURSION !!

ASTQ API

• new ASTQ(): ASTQ:
  Create a new ASTQ instance.

• ASTQ#adapter(adapter: ASTQAdapter): ASTQ:
  Register a custom tree access adapter to support arbitrary AST-style data structures. The ASTQAdapter has to conform to a particular duck-typed interface. See below for more information.

    /*  the built-in implementation for supporting ASTy  */
    astq.adapter({
        taste:            function (node)       { return (typeof node === "object" && node.ASTy) },
        getParentNode:    function (node)       { return node.parent()  },
        getChildNodes:    function (node)       { return node.childs()  },
        getNodeType:      function (node)       { return node.type()    },
        getNodeAttrNames: function (node)       { return node.attrs()   },
        getNodeAttrValue: function (node, attr) { return node.get(attr) }
    }
  

• ASTQ#func(name: String, func: (adapter: Adapter, node: Object, [...]) => Any): ASTQ:
  Register function named name by providing the callback func which has to return an arbitrary value and optionally can access the current node with the help of the selected adapter.

    /*  the built-in implementation for "type"  */
    astq.func("type", function (adapter, node) => {
        var depth = 1
        while ((node = adapter.getParentNode(node)) !== null)
            depth++
        return depth
    })
  

• ASTQ#cache(num: Number): ASTQ:
  Set the upper limit for the internal query cache to num, i.e., up to num ASTs of parsed queries will be cached. Set num to 0 to disable the cache at all.

• ASTQ#compile(selector: String, trace?: Boolean): ASTQQuery { Compile selectorDSL into an internal query object for subsequent processing byASTQ#execute. If traceistrue` the compiling is dumped to the console.

• ASTQ#execute(node: Object, query: ASTQQuery, params, trace?: Boolean): Object[]:
  Execute the previously compiled query (see compile above) at node. The optional params object can provide parameters for the {name} query constructs. If trace is true the execution is dumped to the console.

• ASTQ#query(node: Object, selector: String, params?: Object, trace: Boolean): Object[]:
  Just the convenient combination of compile and execute: execute(node, compile(selector, trace), params, trace). Use this as the standard query method except you need more control. The optional params object can provide parameters for the {name} query constructs. If trace is true the compiling and execution is dumped to the console.

ASTQAdapter API

For accessing arbitrary AST-style data structures, an adapter has to be provided. By default ASTq has adapters for use with ASTy, XML DOM and Mozilla AST. The ASTQAdapter interface is:

• ASTQAdapter#taste(node: Object): Boolean:
  Taste node to be sure this adapter is intended to handle it.

• ASTQAdapter#getParentNode(node: Object): Object:
  Return parent node of node. In case the underyling data structure does not support traversing to parent nodes, throw an exception.

• ASTQAdapter#getChildNodes(node: Object): Object[]:
  Return the list of all child nodes of node.

• ASTQAdapter#getNodeType(node: Object): String:
  Return the type of node.

• ASTQAdapter#getNodeAttrNames(node: Object): String[]:
  Return the list of all attribute names of node.

• ASTQAdapter#getNodeAttrValue(node: Object, attr: String): Any:
  Return the value of attribute attr of node.

License

Copyright (c) 2014-2015 Ralf S. Engelschall (http://engelschall.com/)

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.