Dominator Algorithms

This repository contains implementations of the following commonly used dominator algorithms:

1. Purdom's algorithm
2. The iterative data-flow algorithm
3. Cooper's algorithm
4. The Lengauer-Tarjan algorithm (both simple and sophisticated versions)
5. Planned: The Semi-NCA algorithm

Warning: This is an educational project, not a production-ready library. It is no longer maintained.

References

TODO: Add complete bibliographic details for each reference.

• Building an Optimizing Compiler, 1st edition
• Compilers: Principles, Techniques, and Tools, 2nd edition
• Engineering a Compiler, 3rd edition
• A Simple, Fast Dominance Algorithm
• A Fast Algorithm for Finding Dominators in a Flowgraph
• Applications of Path Compression on Balanced Trees