A static analysis tool for Go that generates control flow graphs and computes cyclomatic complexity
-
Updated
Jul 27, 2024 - Go
A static analysis tool for Go that generates control flow graphs and computes cyclomatic complexity
Single Static Assignment (SSA) Example Showcasing Conversion of Immediate Representation (IR) into SSA form. Building a Control-Flow Graph (CFG), Computing Dominance Frontiers & Inserting Phi (Φ) Functions
Add a description, image, and links to the control-flow-graph topic page so that developers can more easily learn about it.
To associate your repository with the control-flow-graph topic, visit your repo's landing page and select "manage topics."