Notes - Design notes on an update to the match code

1 files changed, 22 insertions, 0 deletions

diff --git a/Notes/MIR-Match.md b/Notes/MIR-Match.md
new file mode 100644
index 00000000..f47d2c88
--- /dev/null
+++ b/Notes/MIR-Match.md
@@ -0,0 +1,22 @@
+% MIR Match Generation Algorithms and Notes
+
+Alternative DecisionTree generator
+=================================
+
+Take the full list of rules and iteratively partition and simplify/propagate
+- Requires that all rules have the same format (which they do)
+
+
+For each index in the rule (all rules must be the same length)
+- Sort the rules (with `_` sorting to the end)
+- If all rules are `_`, skip and continue
+- Group into sub-lists based on the condition
+- Add copies of the default to all sub-lists
+ - NOTE: Default is maintained only if the ruleset is not exhaustive at this level
+
+
+- TODO: The above approach beaks with value ranges (which can overlap)
+ - Requires special handling to resolve the overlaps
+ - Ranges sort after?
+
+