kitejs/io.github.yuroyami.kitejs.ast/AstNode

AstNode

abstract class AstNode(pos: Int = -1, len: Int = 1) : Node, Comparable<AstNode>

Base class for AST node types. The AST represents the physical source code, which makes it useful for IDEs and pretty-printers; the parser must not rewrite the tree when producing it.

The hierarchy sits on top of the older Node class, which was designed for code generation and keeps its children in a weakly typed linked list. AstNode is a strongly typed facade over that list with named accessors, plus position, length and parent.

All offset fields in subclasses are relative to the parent. During parsing the positions are absolute; adding a node to its parent rewrites them to be relative, so by the time a visitor sees the tree all offsets are relative.

Inheritors

Constructors

AstNode

constructor(pos: Int = -1, len: Int = 1)

Types

Companion

object Companion

PositionComparator

class PositionComparator : Comparator<AstNode>

Sorts nodes by relative start position, so it only compares siblings.

Properties

absolutePosition

val absolutePosition: Int

The absolute document position, computed by adding this node's relative position to the relative positions of all its parents.

astRoot

val astRoot: AstRoot?

The AstRoot at the top of this node's parent chain, or null if there is none.

bigInt

open var bigInt: KBigInt?

Only valid when type == Token.BIGINT.

column

open val column: Int

The column where this node is defined in source, one-based. -1 means it was never initialized. May be overridden by subclasses.

double

var double: Double

Only valid when type == Token.NUMBER.

enclosingFunction

val enclosingFunction: FunctionNode?

The innermost enclosing function, or null. The search begins with the parent.

enclosingScope

val enclosingScope: Scope?

The innermost enclosing Scope, or null. The search begins with the parent. This is not the same as the defining scope for a Name.

firstChild

val firstChild: Node?

inlineComment

var inlineComment: AstNode?

Comments on the same line as the statement, for example the trailing comment in if (x == 2) // note.

jsDoc

val jsDoc: String?

The JsDoc comment string attached to this node, or null.

jsDocNode

var jsDocNode: Comment?

The JsDoc Comment attached to this node, or null.

lastChild

val lastChild: Node?

lastSibling

val lastSibling: Node

length

var length: Int

Number of characters spanned by this node in the source text.

lineno

open override val lineno: Int

The line number recorded for this node. If none was recorded, searches the parent chain and returns -1 when nothing is found.

parent

var parent: AstNode?

The node parent, or null. Setting it adjusts this node's start position to be relative to the new parent.

position

var position: Int

Relative position in the parent.

scope

open var scope: Scope?

Only valid when the node has String context.

string

var string: String?

Only valid when the node has String context.

type

open var type: Int

The node type, e.g. Token.NAME.

Functions

addChild

fun addChild(kid: AstNode)

Adds a child to the end of the block. Sets the child's parent to this node, rewrites the child position to be relative, and grows this node to include the child.

addChildAfter

fun addChildAfter(newChild: Node, node: Node)

Add newChild after node.

addChildBefore

fun addChildBefore(newChild: Node, node: Node)

Add newChild before node.

addChildrenToBack

fun addChildrenToBack(children: Node)

addChildrenToFront

fun addChildrenToFront(children: Node)

addChildToBack

fun addChildToBack(child: Node)

addChildToFront

fun addChildToFront(child: Node)

compareTo

open operator override fun compareTo(other: AstNode): Int

Sorts by start position, then by length, then arbitrarily by hash code. Lets Comment and error nodes be mixed into a sorted collection of other AST nodes.

debugPrint

open fun debugPrint(): String

A debugging representation of the parse tree starting at this node. Each line reads abs-pos name position length [identifier].

depth

fun depth(): Int

The depth of this node. The root is depth 0, its children depth 1, and so on.

getChildBefore