expr-lang/expr
Expr
Expr is a statically typed expression engine and domain-specific language for parsing and evaluating dynamic logic strings within Go applications. It functions as a bytecode expression evaluator that executes compiled logic with guaranteed termination and memory safety.
The engine utilizes a specialized compiler and virtual machine to achieve high-performance execution. It employs static type validation during the compilation phase to ensure operand compatibility and prevent runtime crashes.
The project provides a data transformation engine capable of mapping, filtering, and aggregating collections through functional operators. It ensures security by using a pure-function execution model that calculates results without modifying external state or introducing side effects.
Features
- Dynamic Rule Engines - Provides a dynamic rule engine to evaluate custom logic strings at runtime based on changing data environments.
- Bytecode Virtual Machines - Utilizes a custom bytecode virtual machine to execute compiled expressions with high performance and guaranteed termination.
- Expression Evaluators - Parses and executes dynamic logic expressions against specific data environments to determine results at runtime.
- Type Validation - Validates that dynamic expressions adhere to expected data types during compilation to prevent runtime errors.
- Statically Typed Evaluators - Ships a statically typed engine that validates type compatibility during compilation to prevent runtime data errors.
- Expression Languages - Provides a domain-specific expression language for parsing and evaluating dynamic logic strings within Go applications.
- High-Performance Expression Evaluators - Running complex logic via a bytecode compiler and virtual machine to achieve faster evaluation than standard interpreters.
- Sandboxed Logic Execution - Ensures memory safety and guaranteed termination when executing user-defined logic within Go applications.
- Expression Sandboxes - Provides a security layer ensuring user-defined expressions terminate reliably and execute without memory vulnerabilities.
- Pure Functional Logic Implementations - Uses a pure-function execution model to calculate results without modifying external state or introducing side effects.
- Static Analysis - Performs static analysis during the compilation phase to validate operand compatibility and prevent runtime crashes.
- Data Transformation - Enables the restructuring and mapping of data collections using a flexible, runtime-evaluated expression language.
- Collection Operators - Provides functional operators such as map and filter to transform, refine, and aggregate data collections.
- Context-Aware Variable Resolution - Resolves variable identifiers by looking up values within a provided data context during expression evaluation.
- Expression Tree Compilation - Transforms human-readable expressions into an executable internal format to eliminate repeated parsing overhead at runtime.
- Abstract Syntax Tree Parsing - Implements a system to convert expression strings into structured trees for logical analysis and grammar enforcement.
