always start from the first rule

bring 2 color pens for dependency graph

start from the lowest leaf for the graph (Depth First Search)

if there no value yet go to a diff leaf

kind of brute force as long as it makes sense with the final result

E1 is the child of E

Execute the parent rule first then the child

if no dependency graph is asked no need to draw arrows, just the values

Example Kenny Jingga Responsi 2024

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

---

References