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.
Add a description, image, and links to the edge-closure topic page so that developers can more easily learn about it.
To associate your repository with the edge-closure topic, visit your repo's landing page and select "manage topics."