miller/pkg/dsl/cst/functions.go
John Kerl af1adf80ad
Replace GOCC parser-generator with PGPG (#2015)
* Porting

* Update some tests that depend on AST-print output

* iterating on GOCC -> PGPG

* iterating

* iterating

* iterating

* iterating

* iterating

* Modify expout files that need only AST-print-syntax updates

* iterating

* iterating

* iterating

* iterating

* iterating

* iterating

* iterating

* iterating

* iterating

* iterating

* iterating

* sync test cases from mlr-6.17.0, except AST-prints ...

* sync test cases from mlr-6.17.0, except AST-prints ...

* Fix lashed emit for $* and @*

* Fix --1 and ++1 chained unary ops

* Emit with function callsite

* test cases

* dot operator

* M_PI and M_E

* Iterating on lashed emit cases

* error-wording differences

* rm some should-fail files

* Fix issue with leading semicolon

* trailing comma in func params; most AST-print deltas

* error-wording delta

* fix unset all

* AST-print deltas

* go mod tidy: forced `go 1.25` to `go 1.25.0`

* Depend on PGPG v1.0.0

* Fix Windows CI failure

* Remove cmd/experiments/dsl_parser

* GOCC -> PGPG

* neaten

* Fix regex issue found in doc gen
2026-03-15 22:28:57 -04:00

102 lines
3.5 KiB
Go

// CST build/execute for AST operator/function nodes.
//
// Operators and functions are semantically the same thing -- they differ only
// syntactically. Binary operators are infix, like '1+2', while functions are
// prefix, like 'max(1,2)'. Both parse to the same AST shape.
package cst
import (
"github.com/johnkerl/miller/v6/pkg/lib"
"github.com/johnkerl/pgpg/go/lib/pkg/asts"
)
// Function lookup:
//
// * Try builtins first
// * Absent a match there, try UDF lookup (i.e. the UDF has been defined before being called)
// * Absent a match there:
// o Make a UDF-placeholder node with present signature but nil function-pointer
// o Append that node to CST to-be-resolved list
// o On a next pass, we will walk that list resolving against all encountered
// UDF definitions. (It will be an error then if it's still unresolvable.)
func (root *RootNode) BuildFunctionCallsiteNode(astNode *asts.ASTNode) (IEvaluable, error) {
lib.InternalCodingErrorIf(
astNode.Type != asts.NodeType(NodeTypeFunctionCallsite) &&
astNode.Type != asts.NodeType(NodeTypeOperator),
)
lib.InternalCodingErrorIf(astNode.Token == nil)
lib.InternalCodingErrorIf(astNode.Children == nil)
functionName := tokenLit(astNode)
// PGPG produces ternary (cond ? a : b) with "?" token; builtin is registered as "?:"
if functionName == "?" && len(astNode.Children) == 3 {
functionName = "?:"
}
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Special-case the dot operator, which is:
// * string + string, with coercion to string if either side is int/float/bool/etc.;
// * map attribute access, if the left-hand side is a map.
if functionName == "." {
dotCallsiteNode, err := root.BuildDotCallsiteNode(astNode)
if err != nil {
return nil, err
}
return dotCallsiteNode, nil
}
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Look for a builtin function with the given name.
builtinFunctionCallsiteNode, err := root.BuildBuiltinFunctionCallsiteNode(astNode)
if err != nil {
return nil, err
}
if builtinFunctionCallsiteNode != nil {
return builtinFunctionCallsiteNode, nil
}
// - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
// Look for a user-defined function with the given name.
callsiteArity := len(astNode.Children)
udf, err := root.udfManager.LookUp(functionName, callsiteArity)
if err != nil {
return nil, err
}
// AST snippet for '$z = f($x, $y)':
// * Assignment "="
// * DirectFieldValue "z"
// * FunctionCallsite "f"
// * DirectFieldValue "x"
// * DirectFieldValue "y"
//
// Here we need to make an array of our arguments at the callsite, to be
// paired up with the parameters within he function definition at runtime.
argumentNodes := make([]IEvaluable, callsiteArity)
for i, argumentASTNode := range astNode.Children {
argumentNode, err := root.BuildEvaluableNode(argumentASTNode)
if err != nil {
return nil, err
}
argumentNodes[i] = argumentNode
}
if udf == nil {
// Mark this as unresolved for an after-pass to see if a UDF with this
// name/arity has been defined farther down in the DSL expression after
// this callsite. This happens example when a function is called before
// it's defined.
udf = NewUnresolvedUDF(functionName, callsiteArity)
udfCallsiteNode := NewUDFCallsite(argumentNodes, udf)
root.rememberUnresolvedFunctionCallsite(udfCallsiteNode)
return udfCallsiteNode, nil
}
udfCallsiteNode := NewUDFCallsite(argumentNodes, udf)
return udfCallsiteNode, nil
}