name of the PFA engine (may be auto-generated)
execution method ("map", "emit", or "fold")
input type as a placeholder (so it can exist before type resolution)
output type as a placeholder (so it can exist before type resolution)
"begin" algorithm
"action" algorithm
"end" algorithm
user-defined functions
initial value for "fold" tally
"merge" algorithm for "fold"
"cell" definitions
"pool" definitions
random number seed
optional documentation string
optional version number
computer-readable documentation
implementation options
source file location from the locator mark
"action" algorithm
"begin" algorithm
"cell" definitions
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.
partial function that takes any Ast as an argument, returning anything
a result for each abstract syntax tree node in the pf
function's domain
optional documentation string
"end" algorithm
Check equality for all fields except pos
.
Check equality for all fields except pos
.
user-defined functions
Compute hash code for all fields except pos
.
Compute hash code for all fields except pos
.
Input type after type resolution.
input type as a placeholder (so it can exist before type resolution)
Convert this abstract syntax tree into a Jackson node
Convert this abstract syntax tree into a Jackson node
if true
, include locator marks at the beginning of each JSON object
used to avoid recursion; provide an empty set if unsure
Jackson representation of the JSON
"merge" algorithm for "fold"
computer-readable documentation
execution method ("map", "emit", or "fold")
name of the PFA engine (may be auto-generated)
implementation options
Output type after type resolution.
output type as a placeholder (so it can exist before type resolution)
"pool" definitions
source file location from the locator mark
source file location from the locator mark
random number seed
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.
partial function that takes any Ast as an argument, returning a replacement Ast
tree with nodes in the pf
function's domain transformed; everything else left as-is
Serialize this abstract syntax tree as a JSON string.
Serialize this abstract syntax tree as a JSON string.
if true
, include locator marks at the beginning of each JSON object
JSON string
Calls toJson(false)
.
Calls toJson(false)
.
optional version number
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.
generic task to perform on this abstract syntax tree node's context
used to look up symbols, cells, and pools
used to look up functions
implementation options
(information about this abstract syntax tree node after type-checking, result of the generic task)
Walk with a blank symbolTable
, a blank functionTable
, and empty engineOptions
Walk with a blank symbolTable
, a blank functionTable
, and empty engineOptions
initial value for "fold" tally
Abstract syntax tree for a whole PFA document.
name of the PFA engine (may be auto-generated)
execution method ("map", "emit", or "fold")
input type as a placeholder (so it can exist before type resolution)
output type as a placeholder (so it can exist before type resolution)
"begin" algorithm
"action" algorithm
"end" algorithm
user-defined functions
initial value for "fold"
tally
"merge" algorithm for "fold"
"cell" definitions
"pool" definitions
random number seed
optional documentation string
optional version number
computer-readable documentation
implementation options
source file location from the locator mark