Added support for Python 3.9

Author: Cubix1729

README.md

@@ -25,7 +25,7 @@ With pip:
 pip install logicalpy
 ```
 
-Note than the library needs a Python version higher than 3.10.
+Note than the library needs a Python version higher than 3.9.
 
 ## Contributing
 

docs/index.md

@@ -23,7 +23,7 @@ With pip:
 pip install logicalpy
 ```
 
-Note than the library needs a Python version higher than 3.10.
+Note than the library needs a Python version higher than 3.9.
 
 ## Usage
 

pyproject.toml

@@ -10,7 +10,7 @@ authors = [
     {name = "Timothée Monin"}
 ]
 dependencies = ["lark>=1.2.2"]
-requires-python = ">= 3.10"
+requires-python = ">= 3.9"
 readme = "README.md"
 license = "MIT"
 keywords = [
@@ -20,7 +20,11 @@ keywords = [
 ]
 classifiers = [
     "License :: OSI Approved :: MIT License",
-    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.9",
+    "Programming Language :: Python :: 3.10",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Programming Language :: Python :: 3.13",
 ]
 
 [project.urls]

src/logicalpy/base.py

@@ -280,23 +280,22 @@ def _eliminate_conditionals(self):
 
 
 def _interpret_formula_tree(tree: lark.Tree):
-    match tree.data:
-        case "start":
-            return _interpret_formula_tree(tree.children[0])
-        case "proposition":
-            return Proposition(str(tree.children[0]))
-        case "negation":
-            return Not(_interpret_formula_tree(tree.children[0]))
-        case "disjunction":
-            return Or(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
-        case "conjunction":
-            return And(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
-        case "implication":
-            return Implies(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
-        case "biconditional":
-            return BiImplies(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
-        case "formula":
-            return _interpret_formula_tree(tree.children[0])
+    if tree.data == "start":
+        return _interpret_formula_tree(tree.children[0])
+    elif tree.data == "proposition":
+        return Proposition(str(tree.children[0]))
+    elif tree.data == "negation":
+        return Not(_interpret_formula_tree(tree.children[0]))
+    elif tree.data == "disjunction":
+        return Or(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
+    elif tree.data == "conjunction":
+        return And(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
+    elif tree.data == "implication":
+        return Implies(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
+    elif tree.data == "biconditional":
+        return BiImplies(_interpret_formula_tree(tree.children[0]), _interpret_formula_tree(tree.children[1]))
+    elif tree.data == "formula":
+        return _interpret_formula_tree(tree.children[0])
 
 
 class Formula: