Compiler Construction (Lectures during COVID-19 Quarantine days)



COMPILER CONSTRUCTION
Course Outline

S.No
Topic

1
High Level Languages and Need of Translators

2
History of Compiler: Past, Present and Future of CC

3
Machine Language (Why Binary)

4
Compilation Process

5
Phases of Compiler

6
Compiler Vs Interpreter Vs Assembler

7
Cousins of Compiler: Preprocessor, Assembler, Linker and Loader

8
Symbol Table Management  and Attributes of ST

9
Error Handler

10
Regular Expressions

11
Finite Automata, DFA & NFA

12
Lexical Analysis Phase

13
Parse Tree and Parsing, Syntactic Structure

14
Syntax Analysis Phase, Tree Generation and Verification

15
Semantic Analysis Phase

16
Type Checking and Semantic verifications

17
Intermediate Code Generation

18
Three Address Code Generation and Relevant Concepts  

19
Code Optimization Phase

20
Copy Propagation & Dead Code Elimination

21
Code Motion, Loop Roiling

22
Loop unjamming and Loop Optimization

23
Target Code Generation

24
Relocatable Machine Code & Target Machine Code

25
A Review on Compiler Construction














Compiler Construction Lectures
_____________
Arslan Ali Raza

Comments

Post a Comment

Popular posts from this blog

Compiler Construction (Conversion of NFA to DFA)

Image
Conversion from NFA to DFA An NFA can have zero, one or more than one move from a given state on a given input symbol. An NFA can also have NULL moves (moves without input symbol). On the other hand, DFA has one and only one move from a given state on a given input symbol. Conversion from NFA to DFA (Video Here)   Suppose there is an NFA N < Q, ∑, q0, δ, F > which recognizes a language L. Then the DFA D < Q’, ∑, q0, δ’, F’ > can be constructed for language L as: Step 1: Initially Q’ = ɸ. Step 2: Add q0 to Q’. Step 3: For each state in Q’, find the possible set of states for each input symbol using transition function of NFA. If this set of states is not in Q’, add it to Q’. Step 4: Final state of DFA will be all states with contain F (final states of NFA) Example Consider the following NFA shown in Figure 1. Following are the various parameters for NFA. Q = { q0, q1, q2 } ∑ = ( a, b ) F = { q2 } δ (Transition Function of NFA) Step 1: Q’ = ɸ Step 2: Q’ = {q...
Read more

Intro to Programming (MCS) & PF (BSSE) (Topic: Recursion & Iteration in C++)

Image
Recursion & Iteration  (Video Here)   Recursion and iteration both repeatedly executes the set of instructions. Recursion is when a statement in a function calls itself repeatedly. The iteration is when a loop repeatedly executes until the controlling condition becomes false. The primary difference between recursion and iteration is that is a  recursion  is a process, always applied to a function. The  iteration  is applied to the set of instructions which we want to get repeatedly executed. // C++ program to find factorial of given number #include<bits/stdc++.h> using namespace std;     // ----- Recursion ----- // method to find factorial of given number int factorialUsingRecursion( int n) {      if (n == 0)          return 1;          // recursion call      return n * factorialUsingRecu...
Read more