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.
To associate your repository with the edge-closure topic, visit your repo's landing page and select "manage topics."