compiler/io.github.aplcornell.viaduct.syntax.intermediate/Node

Node

abstract class Node : TreeNode<Node> , HasSourceLocation, PrettyPrintable

A node in the intermediate language abstract syntax tree.

The intermediate language is similar to the surface language, but with the following changes:

For and while loops are elaborated into loop-until-break statements.
Expressions are in A-normal form. Briefly, this means all intermediate results are stored in immutable temporary variables.
Every loop and break statement has a JumpLabel.
All Variables within a process have unique names.

Constructors

fun Node()

Functions

abstract fun copy(children: List<Node> = this.children.toList()): Node

Returns a shallow copy of this node where the child nodes are replaced by children.

override fun toDocument(): Document

toDocumentWithMetadata

fun toDocumentWithMetadata(metadata: Metadata): Document

Returns a pretty representation of this Node where each descendant is decorated using metadata.

abstract fun toSurfaceNode(metadata: Metadata = mapOf()): Node

Returns a representation of this node in the surface syntax.

Properties

abstract val children: Iterable<Node>

The list of all children nodes. This is empty for leaf nodes.

abstract val sourceLocation: SourceLocation

Inheritors

OutParameterInitializerNode

FunctionArgumentNode

TopLevelDeclarationNode

Extensions

fun Node.deepCopy(): Node

Like Node.copy, but recursively copies all descendant nodes also.

fun Node.descendants(): Sequence<Node>

Returns this node and all its descendants in post order.

descendantsIsInstance

inline fun <T : Node> Node.descendantsIsInstance(): Sequence<T>

Returns all instances of T contained in this node (which may include this node).

freshVariableNameGenerator

fun Node.freshVariableNameGenerator(): FreshNameGenerator

A FreshNameGenerator that will avoid all Variable names in this node.