com.opendatagroup.hadrian.ast

Ast

trait Ast extends AnyRef

Abstract base class for a PFA abstract syntax tree.

Linear Supertypes
AnyRef, Any
Known Subclasses
Argument, AttrGet, AttrTo, Call, CallUserFcn, CastBlock, CastCase, Cell, CellGet, CellTo, Cond, Do, DoUntil, Doc, EngineConfig, Error, Expression, FcnDef, FcnRef, FcnRefFill, For, Foreach, Forkeyval, If, IfNotNull, Let, Literal, LiteralBase64, LiteralBoolean, LiteralDouble, LiteralFloat, LiteralInt, LiteralLong, LiteralNull, LiteralString, LiteralValue, Log, NewArray, NewObject, Pack, Pool, PoolDel, PoolGet, PoolTo, Ref, SetVar, Try, Unpack, Upcast, While
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Ast
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def jsonNode(lineNumbers: Boolean, memo: Set[String]): JsonNode

    Convert this abstract syntax tree into a Jackson node

    Convert this abstract syntax tree into a Jackson node

    lineNumbers

    if true, include locator marks at the beginning of each JSON object

    memo

    used to avoid recursion; provide an empty set if unsure

    returns

    Jackson representation of the JSON

  2. abstract def pos: Option[String]

    Position in the original source code where this AST element resides (if any).

  3. abstract def walk(task: Task, symbolTable: SymbolTable, functionTable: FunctionTable, engineOptions: EngineOptions, version: PFAVersion): (AstContext, TaskResult)

    Walk over tree applying a Task while checking for semantic errors.

    Walk over tree applying a Task while checking for semantic errors.

    This is how Java is generated from an abstract syntax tree: the Task in that case is JVMCompiler.

    task

    generic task to perform on this abstract syntax tree node's context

    symbolTable

    used to look up symbols, cells, and pools

    functionTable

    used to look up functions

    engineOptions

    implementation options

    version

    version of the PFA language in which to interpret this PFA

    returns

    (information about this abstract syntax tree node after type-checking, result of the generic task)

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. def collect[X](pf: PartialFunction[Ast, X]): Seq[X]

    Walk over tree applying a partial function, returning a list of results in its domain.

    Walk over tree applying a partial function, returning a list of results in its domain.

    pf

    partial function that takes any Ast as an argument, returning anything

    returns

    a result for each abstract syntax tree node in the pf function's domain

  9. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  16. final def notify(): Unit

    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  18. def replace(pf: PartialFunction[Ast, Ast]): Ast

    Walk over tree applying a partial function, returning a transformed copy of the tree.

    Walk over tree applying a partial function, returning a transformed copy of the tree.

    pf

    partial function that takes any Ast as an argument, returning a replacement Ast

    returns

    tree with nodes in the pf function's domain transformed; everything else left as-is

  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  20. def toJson(lineNumbers: Boolean = true): String

    Serialize this abstract syntax tree as a JSON string.

    Serialize this abstract syntax tree as a JSON string.

    lineNumbers

    if true, include locator marks at the beginning of each JSON object

    returns

    JSON string

  21. def toString(): String

    Calls toJson(false).

    Calls toJson(false).

    Definition Classes
    Ast → AnyRef → Any

  22. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  23. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  24. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. def walk(task: Task, version: PFAVersion): TaskResult

    Walk with a blank symbolTable, a blank functionTable, and empty engineOptions

Inherited from AnyRef

Inherited from Any

Ungrouped