A c++ code to find dominator of a given control flow graph Shell script has been written for the execution of the programs. Initially the CFG is taken as input and a new graph is produced as output after eliminating all the back edges. This generated graph is used to generate the dominator tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
AdithyaKaranth/Dominators
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
A c++ code to find dominator of a given control flow graph
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published