Directed Acyclic Graph
steps
- Look for Three Address Code (TAC)
- Create DAGDirected Acyclic Graphsteps 1. Look for Three Address Code (TAC) 1. Create DAG based on TAC From left to right Don't repeat any nodes Example Alvina Aulia Directed Acyclic Graph Pasted image 20241231162515.png T1 = b - c T2 = a \* T1 T3 = T1 \* d T4 = a + T2 T5 = T4 + T3 x = T5 Screenshot 2024-12-09 at 1.06.21 PM.png Status: #idea Tags: compilation-techniques > Final Exam References based on TAC
From left to right
Don't repeat any nodes
Example Alvina Aulia Directed Acyclic Graph
T1 = b - c
T2 = a * T1
T3 = T1 * d
T4 = a + T2
T5 = T4 + T3
x = T5
Status: #idea
Tags: compilation-techniques > Final ExamCompilation Techniques NotesMid Exam
RE to DFA
RE to E-NFA to DFA
Context Free Grammar
Top down parsing
Final Exam
Bottom Up Parsing
Directed Acyclic Graph
TAC, Triples, Quadriples
Intermediate Code Generator
Code Generator
Annotated Parse Tree
Three Address Statement
resources:
https://www.youtube.com/watch?v=6yRB6dszSUo&ab_channel=HIMTIBINUS
* [x] watch all alvina aulia vids
* [x] watch responsi
(after OS)
* [ ] try example questions from kenny
* [ ] try example questions from others
* [ ] practice weak