Topic outline

  • Compiler Design Lab // Course Code: CSE 331L // Credits: 2


    •                                                   Welcome Message from Instructor

    • Instructor Name : Sharun Akter Khushbu                                                            

      Designation         : Lecturer
      Office Address    : Department of CSE
      Contact No          :  01730599307
      Email                    : sharun.cse@diu.edu.bd


               The course is intended to teach the students the basic techniques that underlie the practice of Compiler Construction. The course will introduce the theory and tools that can be standard employed in order to perform syntax-directed translation of a high-level programming language into an executable code. These techniques can also be employed in wider areas of application, whenever we need a syntax-directed analysis of symbolic expressions and languages and their translation into a lower-level description. They have multiple applications for man-machine interaction, including verification and program analysis.

                The main objective of this course is to introduce the major concept areas of language translation and compiler design and to develop an awareness of the function and complexity of modern compilers. This course is a study of the theory and practice required for the design and implementation of interpreters and compilers for programming languages.

      After successful completion of this course, the students should be able to
      • CO1 : Explain various phases of a compiler.
      • CO2 : Design token recognizer using modern tools.
      • CO3 : Design Top-down and Bottom-up parsing Techniques.
      • CO4 : Translate given input to intermediate code.
      • CO5 : Identify various types of optimizations on intermediate code and generate assembly code.


        Theory Course
      Lab Course
      Class Attendance: 7%
      Class Attendance: 10%
      Class Test/Quiz: 15%
      Lab Submissions: 40%
      Assignment: 5%
      Lab Performance: 25%
      Presentation: 8%
      Report Submission: 25%
      Midterm Examination: 25%
       
      Final Examination: 40%
       

    • Lab Course Outline [View]

    • Course Related Books

      Text Book

      1. Compiler Principles, Techniques and Tools By Aho, Ullman, Sethi [Download]

      Reference Books:

      1.  Implementations of Compiler, A new approach to Compilers including the algebraic methods By Yunlin su, Song Y. Yan. [Download]

      2. Compiler construction, Principles and Practice, By Kenneth C Louden. [Download]

      3. Basics of Compiler Design by Torben. [Download]


    • Permanent Live Class Google Meet Link [Join]

  • Week 1: Preparing Background and Learn about Language Processing System

    Week1

    The ability to research, understand and implement computer programs in the areas related to algorithms.

    compiler for debugging of programs.

  • Week - 2: Phase of a Compiler

    Week2

    Discussion Topics: 

    • Learn about the structure of a compiler.
    • Learn about the phases of a compiler.




  • Week - 3: Context Free Grammar: LMD, RMD

    Week3


    • Laboratory 3 Task: [View]

  • Week - 4: Regular Expression

    Week4



  • Week - 5: NFA and DFA

    Week5


  • Week - 6: NFA to DFA Conversion

    Week6


  • Week - 8: Left Recursion and Left Factoring Elimination

    Week8

    Discussion Topics: 

    • Discuss about LMD and RMD
    • Discuss and Illustrate the elimination techniques

    Expected Learning Outcomes:

    • Recognize the elimination techniques
    • Understand the importance of Left Elimination

    Resources of Learning:


    • Laboratory 7 Task: [View]

  • Week - 9: Determination of FIRST and FOLLOW Function

    Week9


  • Report Submission

  • Week - 10: LR0 Parser and Canonical Table

    Week10

    Discussion Topics: 

    • Discuss and illustrate Kernel item, Non Kernel Item.
    • Discuss about Augmented grammar.
    • Discuss about Canonical Table.

    Expected Learning Outcomes:

    • Recognize kernel and non-kernel item.
    • Construct LR 0 Parser.
    • Design and construct canonical table.
    Resources of Learning:


    • Laboratory 9 Task: [View]

  • Week - 11: Intermediate Code Generation

    Week11

    Discussion Topics: 

    • Discuss abstract syntax trees and Directed acyclic graph
    • Discuss and illustrate three address code, quadruples, and triples.
    • Discuss about Class Text.

    Expected Learning Outcomes:

    • Recognize techniques to eliminate common sub tree.
    • Design triples.
    Resources of Learning:


    • Laboratory 10 Task: [View]

  • Week - 12: Code Generation and Basic Block

    Week12

    Discussion Topics: 

    • Discuss about the rules for leader selection.
    • Discuss and illustrate the techniques to create basic block.
    • Discuss the techniques to design flow graph.

    Expected Learning Outcomes:

    • Recognize three address codes.
    • Design basic blocks for high level languages.
    • Understand the necessity of flow graph.

    Resources of Learning:

    • Lecture Slide (Basic Block)
    • Lecture Video
    • Test Question

    • Laboratory 11 Task: [View]

  • Week - 13: Code Optimization

    Week13

    Discussion Topics: 

    • Discuss about Machine independent code optimization.
    • Discuss and illustrate the techniques of code optimization.

    Expected Learning Outcomes:

    • Recognize machine independent code.
    • Able to apply techniques to optimize codes.

    Resources of Learning:


    • Week - 14: Preparation for Final Examination

      Week14

      Topics Covered for Final Examination

      • Left Recursion and Left Factoring Elimination
      • Determination of FIRST and FOLLOW Function
      • LR0 Parser and Canonical Table
      • Intermediate Code Generation
      • Code Generation and Basic Block
      • Code Optimization

      • Final Exam