Bump version

Author: StanimirIglev

.github/workflows/publish_to_pypi.yml

@@ -42,7 +42,6 @@ jobs:
       url: https://pypi.org/p/syntax-symphony
     permissions:
       id-token: write  # IMPORTANT: mandatory for trusted publishing
-
     steps:
     - name: Download all the dists
       uses: actions/download-artifact@v3

pyproject.toml

@@ -4,7 +4,7 @@ build-backend = "setuptools.build_meta"
 
 [project]
 name = "syntax_symphony"
-version = "0.0.2"
+version = "0.1.0"
 description = "Efficient grammar-based fuzzer."
 readme = "README.md"
 requires-python = ">=3.10"
@@ -18,8 +18,13 @@ keywords = ["fuzzer", "fuzzing", "testing", "grammar", "grammars"]
 classifiers = [
     "Operating System :: OS Independent",
     "Programming Language :: Python :: 3",
-    "Development Status :: 2 - Pre-Alpha",
+    "Programming Language :: Python :: 3.10",
+    "Development Status :: 3 - Alpha",
+    "Topic :: Software Development",
+    "Topic :: Software Development :: Quality Assurance",
     "Topic :: Software Development :: Testing",
+    "Topic :: Security",
+    "Topic :: Utilities",
     "Intended Audience :: Developers",
 ]
 dependencies = ["schema >= 0.7.7"]

setup.py

@@ -1,3 +1,3 @@
 from setuptools import setup
 
-setup(name="syntax_symphony", version="0.0.2")
+setup(name="syntax_symphony", version="0.1.0")

src/syntax_symphony/fuzzer.py

@@ -1,4 +1,5 @@
 import copy
+from itertools import chain
 import random
 from collections import deque
 from typing import Callable, Generator, Iterable
@@ -9,7 +10,7 @@
 class SyntaxSymphony:
     """An efficient grammar-based fuzzer.
 
-    The Kalashnikov fuzzer aims to cover all elements of the grammar
+    The SyntaxSymphony fuzzer aims to cover all elements of the grammar
     utilizing a k-path coverage strategy. The size of the k-paths can be
     adjusted by the user.
     Additionally, the fuzzer provides a mechanism to control the size
@@ -314,6 +315,16 @@ def expand_tree(tree: DT, path: list[list[str]], depth: int) -> DT:
         assert item.children is None
         return expand_tree(DT(item.symbol, None), path, 0)
 
+    def remaining_k_paths(self) -> int:
+        """Computes the number of remaining uncovered k-paths.
+
+        Returns:
+            int: The number of remaining uncovered k-paths.
+        """
+        return len(
+            list(chain.from_iterable(list(self.uncovered_k_paths.values())))
+        )
+
     def tree_fuzz(self, tree: DT) -> DT:
         """Fuzzes a derivation tree by expanding the unexpanded nonterminals.