See: Description
| Interface | Description |
|---|---|
| FunctionNode |
Common interface for all nodes in the trees representing logical functions.
|
| OperandFactory |
A factory to create operands (leaves in a logical function) and associate them to MDDVariables.
|
| OperatorFactory |
Create FunctionNode for a given operator.
|
| Class | Description |
|---|---|
| AbstractOperand |
An operand in a logical function.
|
| FunctionParser |
Parser for logical functions.
|
| OperatorCollection |
Define a collection of operators to be used by a BooleanParser.
|
| SimpleOperandFactory<T> |
Simple factory for logical function operands, using a list of predefined operands.
|
| ValueNode |
Terminal FunctionNode representing fixed value
|
Nodes (operands and operations) in this tree must implement the BooleanNode interface.
This interface allows logical functions to be represented as decision diagrams (for evaluation).
Logical functions can be built directly by assembling BooleanNode objects, by parsing a text representing the function. For flexibility, the parser is an abstract class and implementors are responsible for creating operands based on their text representation.
Copyright © 2009–2020. All rights reserved.