BAMU SY Computer syllabus

BAMU · Second Year B.E./B.Tech Computer Science and Engineering · NEP 2020

Compiler Construction

HT-2 · Honours (Semester IV) · Semester IV · 3 credits · CIA 40 + SEE 60

Only for the Honours degree, open to students with a first-year CGPA of 7.5 or more. An Honours course: an extra 3-credit course for students on the B.E./B.Tech Honours option (first-year CGPA of 7.5 or more).

All notes for this subject
  1. Module 1: Introduction and Lexical Analysis

    15 hours

    Compilers versus interpreters and the phases of a compiler; the role of the lexical analyser, tokens, patterns and lexemes, regular expressions and finite automata, and building lexers with Lex.

    Examined in the 60-mark end-semester paper

    • Language processors: compilers, interpreters, assemblers, linkers and loaders
    • Phases of a compiler
    • Role of the lexical analyser and input buffering
    • Specifying and recognising tokens
    • Regular expressions to automata for lexers
    • Lex and Flex
  2. Module 2: Syntax and Semantic Analysis

    15 hours

    Top-down and bottom-up parsing, LL(1) parsing tables, LR(0), SLR and LALR parsing; syntax-directed definitions and translation, abstract syntax trees and parse trees; symbol tables and type checking.

    Examined in the 60-mark end-semester paper

    • Top-down parsing: recursive descent and LL(1)
    • Bottom-up parsing and shift-reduce
    • LR parsers: SLR, CLR and LALR
    • Syntax-directed definitions and translation schemes
    • Symbol tables: entries, implementation and scopes
    • Type checking
  3. Module 3: Intermediate Code Generation and Code Optimization

    15 hours

    Three-address code, quadruples and triples; target code and addressing modes; peephole, local and global optimisation; activation records and stack allocation; error detection and recovery.

    Examined in the 60-mark end-semester paper

    • Intermediate code: syntax trees, postfix and three-address code
    • Code generator design and the target machine
    • Peephole optimisation
    • Machine-independent optimisations
    • Run-time storage organisation and activation records
    • Error detection and recovery in compilers

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