BAMU Final Year IT syllabus

BAMU · Final Year B.E. Information Technology · CBCS (2019)

Compiler Design

ITD442 · Elective I · Semester VII · 4 credits · CT 20 + theory 80

One of the Elective I options.

All notes for this subject
  1. Unit 1: Introduction

    6 hours

    Compilers and translators, compiler structure, bootstrapping and construction tools; lexical analysis, finite automata as recognisers and LEX; context-free grammars, derivations, parse trees and ambiguity.

    Examined in the 80-mark end-semester paper

    • Compiler phases
    • Bootstrapping and compilers versus interpreters
    • Lexical-analyser generators: Lex
    • Parse trees and ambiguity
  2. Unit 2: Syntax Analyzers

    7 hours

    Shift-reduce and top-down parsing, recursive descent and left factoring, predictive parsing with FIRST and FOLLOW; LR parsers, LR(0) items and LALR parsers; YACC.

    Examined in the 80-mark end-semester paper

    • Recursive-descent and predictive parsing
    • Top-down parsing: FIRST, FOLLOW and LL(1)
    • Bottom-up parsing: LR parsers
    • Parser generators: YACC
  3. Unit 3: Syntax Directed Translation

    7 hours

    SDT schemes and a desk calculator; intermediate code: postfix, syntax trees, quadruples, triples and indirect triples; translating assignments, Boolean expressions, if-then-else, while-do, procedure calls, declarations and case statements.

    Examined in the 80-mark end-semester paper

    • Syntax-directed translation
    • Three-address code
    • Control flow and backpatching
  4. Unit 4: Symbol Tables

    7 hours

    Symbol-table contents and data structures, and scope information; run-time storage: stack allocation and displays for block-structured languages; error detection and recovery, panic mode and recovery in LR parsing and YACC.

    Examined in the 80-mark end-semester paper

    • Symbol tables
    • Run-time storage organisation
    • Error detection and recovery in compilers
  5. Unit 5: Code Optimization

    7 hours

    Principal sources of optimisation; basic blocks, flow graphs and loops; code motion and induction variables; DAGs for basic blocks; global data-flow analysis; loop unrolling and jamming.

    Examined in the 80-mark end-semester paper

    • Basic blocks and flow graphs
    • DAG representation of basic blocks
    • Global data-flow analysis and loop optimisation
  6. Unit 6: Code Generation

    6 hours

    Object programs and the code generator's environment, run-time addresses, problems in code generation, a simple code generator, register allocation and peephole optimisation.

    Examined in the 80-mark end-semester paper

    • Code generation issues
    • Code optimisation and peephole optimisation

Unit contents are summarised from the official BAMU syllabus . AiCanCode.org is not affiliated with Dr. Babasaheb Ambedkar Marathwada University (BAMU).