Questions tagged [control-flow-graph]
For questions relating to control flow graphs, or data structures that show the control flow of a program.
5 questions
6
votes
2
answers
752
views
What should the semantics from branching from finally be?
This question is about the expected semantics when combining resource management with branching control flow. From my perspective, it applies equally to all finally-...
- 2,192
5
votes
1
answer
186
views
How is Go's DSE implemented?
Apparently, Go can implement a dead store analysis in the compiler without a CFG. I stumbled upon this example:
...
- 2,192
6
votes
1
answer
165
views
What to do with subroutine calls when translating Abstract Syntax Tree to Control Flow Graph?
A newbie here! I'm implementing my current compiler in Haskell and at the moment I'm trying to do the translation of AST to Basic Blocks. Based on the book "Advanced Compiler Design and ...
- 145
10
votes
2
answers
842
views
Do all nodes (except for the entry) in SSA have an immediate dominator?
I'm reading SSA-driven Compiler Design and I'm having trouble understanding this section from Chapter 2:
The immediate dominator or “idom” of a node N is the unique node that strictly dominates N but ...
- 203
5
votes
2
answers
471
views
How can I implement a control flow graph?
A Control-Flow-Graph is:
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a program during its execution.
The ...
- 1,623