06. Modular Nodes
A modular node is defined once and referenced from several places in the tree, so a subtree that several rules depend on is maintained in one location. This chapter defines how such nodes are declared, how they evaluate when reached by more than one path, and the limits that keep a rulemap finite.
- 6.1 Concept — What a modular node is, and when to use one
- 6.2 Implementation — Declaring
modular: trueand referencing it - 6.3 Evaluation and Copy Behavior — Why results are indexed by path, not by LexID
- 6.4 Recursion — Self-reference, the operators it requires, and termination
- 6.5 Nesting — Modular nodes inside modular nodes