These notes are from the Week 10 of the Compilers course by Stanford. Arrays One problem that Java arrays resolve lies in inheritance. If we have classes A and B which B inherits from A the relationship…
Tag: study-notes
Compilers – Register Allocation and Garbage Collection: my study notes
These notes are from the Week 9 of the Compilers course by Stanford. Register Allocation When we generate intermediate code, we are not concerned about how many registers the target machine has. Therefore, the last phase should…
Read more of Compilers – Register Allocation and Garbage Collection: my study notes
Compilers – Local Optimization & Global Optimization: my study notes
These notes are from the Week 8 of the Compilers course by Stanford. An intermediate language provides an intermediate level of abstraction while compiling languages, helping optimizations by including more details than the source language has, but…
Read more of Compilers – Local Optimization & Global Optimization: my study notes
Compilers – Code Generation & Operational Semantics: my study notes
These notes are from the Week 7 of the Compilers course by Stanford. This focuses on the discussion about code generation. The architecture chosen for this class is a Stack Machine architecture on top of the MIPS architecture.…
Read more of Compilers – Code Generation & Operational Semantics: my study notes
Compilers – Cool Type Checking & Runtime Organization: my study notes
These notes are from the Week 6 of the Compilers course by Stanford. This week is going over how the Cool type checking and runtime organization are going to be organized. Static and Dynamic typing Dynamic and…
Read more of Compilers – Cool Type Checking & Runtime Organization: my study notes
Compilers – Semantic Analysis and Type Checking: my study notes
These notes are from the Week 5 of the Compilers course by Stanford. The semantic analysis phase is the last line of defense for the compiler, meaning the next phase will always have a valid program to…
Read more of Compilers – Semantic Analysis and Type Checking: my study notes
Compilers – Bottom-Up Parsing: my study notes
These notes are from the Week 4 of the Compilers course by Stanford. Predictive Parsing Predictive Parsing is one type of recursive parsing that does not require backtracking. It does so by looking at the next few…
Compilers – Top-Down Parsing: my study notes
These notes are from the Week 3 of the Compilers course by Stanford. The parsing phase comes right after the lexing phase is complete with its result as input. The basic difference between the two is that…
Compilers – Lexical Analysis: my study notes
These notes are from the Week 2 of the Compilers course by Stanford. You may notice that this week also covers Finite Automata, but I left this out on purpose. Lexical Analysis This phase transforms…
Compilers – Introduction: my study notes
These notes are from the Week 1 of the Compilers course by Stanford. History The problem that compilers tried to solve, in the ’50s was basically to improve the software developers’ productivity. At that time,…