Efficient C++ implementation of Grammar-based Labeled Edge Closure (CFL-Reachability). Features a worklist-based algorithm for graph saturation and static analysis applications.
-
Updated
Feb 26, 2026 - C++
Efficient C++ implementation of Grammar-based Labeled Edge Closure (CFL-Reachability). Features a worklist-based algorithm for graph saturation and static analysis applications.
A CLI utility to export stack graphs from source code, run queries against them, convert them to CFL, run queries for CFL using KotGLL or UCFS
Add a description, image, and links to the cfl-reachability topic page so that developers can more easily learn about it.
To associate your repository with the cfl-reachability topic, visit your repo's landing page and select "manage topics."