microsoft/Power-Fx
Power Fx
Power-Fx is a declarative logic framework and low-code formula language based on Excel formulas. It functions as an expression parser and evaluator that transforms formula strings into an abstract syntax tree to execute logical operations and resolve values.
The project provides a standardized integration layer to connect formula-based logic to external data sources for querying and pushing records. This allows for the definition of business rules and calculations that can be shared as consistent logic across different applications and platforms.
Features
- Low-Code Formula Languages - Provides a declarative low-code formula language based on Excel syntax for standardizing business logic across applications.
- Formula Evaluators - Functions as a formula evaluator that computes results from variable inputs based on a defined set of language rules.
- Data Provider Abstractions - Provides a standardized abstraction layer to connect formula-based logic to external data sources for querying and pushing records.
- Abstract Syntax Tree Parsers - Implements components that transform formula strings into structured tree representations for logical analysis and execution.
- Context-Aware Variable Resolution - Provides mechanisms for retrieving values from data objects based on hierarchical scope and current execution context.
- Cross-Application Logic Standards - Enables the sharing of consistent functional rules and calculation logic across multiple different platforms and user interfaces.
- Cross-Language Logic Standardization - Standardizes the semantics and execution of business logic expressions across different software applications.
- Declarative Logic Frameworks - Provides a framework for expressing functional rules and data transformations using a high-level spreadsheet-like syntax.
- Environment Variable Resolution - Resolves variable names and references by retrieving values from the runtime environment context.
- Expression Evaluators - Provides an engine for processing mathematical and logical expressions based on declarative language rules.
- Expression Tree Evaluators - Executes logical operations by recursively traversing the formula's abstract syntax tree.
- Core Business Logic - Implements a processing engine for defining the primary business rules and calculations of an application via formulas.
- Expression Type Resolution - Determines the expected data types of dynamic formula expressions by analyzing inputs and operators.
- Formula Expression Parsers - Evaluates complex formula expressions by parsing them according to defined language rules to produce consistent results.
- Data Abstraction Layers - Implements an abstraction layer that decouples the formula engine logic from specific external data storage backends.
- External Data Integrations - Provides mechanisms to connect to external data sources to enrich formulas with additional real-time context.
- Query Abstraction Layers - Implements a query abstraction layer that provides a unified interface for executing data queries across different storage engines.
- Unified Data Provider Interfaces - Ships a standardized communication layer that translates formula queries into specific API requests for external backend services.
- Lazy Evaluation - Employs computational techniques to delay the evaluation of formula expressions until the final value is explicitly requested.
- AST Visitor Patterns - Uses the visitor design pattern to walk the expression tree for compilation and evaluation purposes.
