EeZee Language - Compiler Engineering Basics
-
Updated
Jul 10, 2026 - Java
EeZee Language - Compiler Engineering Basics
Dominator tree construction and immediate dominator calculation over directed control-flow graphs
Dominator tree construction and immediate dominator calculation over directed control-flow graphs
SSA form construction engine calculating dominator trees, dominance frontiers, and minimal phi-node placements over Control Flow Graphs (CFG).
SSA form construction engine calculating dominator trees, dominance frontiers, and minimal phi-node placements over Control Flow Graphs (CFG).
Sea of nodes intermediate representation prototipe for JIT/AOT compilation
Educational implementations of dominator algorithms in Common Lisp.
Keystone-finder MCP server for Linear: dominator analysis, critical path (CPM), inferred code coupling, cold-start prediction & graph hygiene. Deterministic, read-only.
Provisional solutions to the longmemeval v2 bench
Tiny, header-only C++20 implementation of the dominator tree algorithm by Lengauer and Tarjan
Find the C/C++ headers whose removal would delete the most preprocessed code, proven by dominators
Generic, no_std control-flow graph library for binary analysis, decompilation, and compiler infrastructure
To associate your repository with the dominator-tree topic, visit your repo's landing page and select "manage topics."