tests + fixed unreachable states left in intersection

Author: Theomat

grape/automaton/tree_automaton.py

@@ -146,7 +146,9 @@ def __product_rules__(
 
     def read_intersection(self, other: "DFTA[W, V]") -> "DFTA[tuple[U, W], V]":
         new_finals = set(el for el in itertools.product(self.finals, other.finals))
-        return DFTA(self.__product_rules__(other), new_finals)
+        d = DFTA(self.__product_rules__(other), new_finals)
+        d.reduce()
+        return d
 
     def read_union(self, other: "DFTA[W, V]") -> "DFTA[tuple[U, W], V]":
         new_finals = set(

tests/cli/test_intersection.py

@@ -0,0 +1,27 @@
+from grape.automaton_generator import (
+    depth_constraint,
+    grammar_by_saturation,
+    size_constraint,
+)
+from grape.dsl import DSL
+
+
+dsl = DSL(
+    {
+        "1": ("int", 1),
+        "+": ("int -> int -> int", lambda x, y: x + y),
+    }
+)
+
+max_size = 5
+
+
+def test():
+    size = grammar_by_saturation(dsl, "int->int", [size_constraint(0, 5)])
+    depth = grammar_by_saturation(dsl, "int->int", [depth_constraint(0, 2)])
+    inter = size.read_intersection(depth)
+    other = grammar_by_saturation(
+        dsl, "int->int", [depth_constraint(0, 2), size_constraint(0, 5)]
+    )
+    a = inter.trees_by_size(100)
+    assert a == other.trees_by_size(100)