Subject Details
Dept     : CSE
Sem      : 5
Regul    : R2019
Faculty : Vinodhini B
phone  : NIL
E-mail  : vinodhni.b.cse@snsct.org
465
Page views
56
Files
1
Videos
0
R.Links

Icon
Announcements

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:
    Issues in the design of a code generator& The target machine ,
    Run-time storage management & Basic blocks and flow graphs,
    Next-use information &A simple code generator,
    The DAG representation of basic blocks & Generating code from DAGs,
    Introduction to optimization techniques – The principle sources of optimization,
    Peephole optimization – Optimization of basic blocks,
    Loops in flow graphs – Introduction to global data-flow analysis,
    Code improving transformations.

  • Question Bank

    Dear Students the Question Bank has been uploaded for the following topics:
    QP,
    QP,
    2 MARKS

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:
    Run-Time Environments, Source language issues ,
    Storage organization,
    Storage-allocation strategies ,
    Intermediate Representation: parse tree, 3 address code and postfix Notation,
    Intermediate code representation of Declarations & Assignment statements ,
    Case statements,
    Procedure Calls,
    Back patching

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:
    Regular Expressions, Identity rules for Regular Expressions,
    FSA- Deterministic Finite State Automata(DFA),
    Non Deterministic Finite State Automata(NDFA),
    Equivalence of DFA and NDFA,
    Pushdown Automata - Languages of a Pushdown Automata,
    Turing Machines- Languages of Turing Machine ,
    Introduction to Compiling, Compilers,
    Analysis of the source program ,
    The phases – Cousins – The grouping of phases,
    Compiler construction tools,
    The role of the lexical analyzer,
    Input buffering – Specification and Recognition of tokens,
    Finite automata – Regular expression to finite automata,
    A language for specifying lexical analyzer,
    Syntax Analysis, The role of the parser

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:
    Context-free grammars, Writing a grammar, Top down parsing, Bottom-up Parsing,
    Context-free grammars, Writing a grammar, Top down parsing, Bottom-up Parsing,
    Top Down Parsing: First & Follow, LL(1) Parser,
    Bottom –Up: LR parsers,
    SLR Parsers,
    CLR, LALR Parsers,
    Summary of parsers, Tool to generate parser

  • Youtube Video

    Dear Students the Youtube Video has been uploaded for the following topics:
    Introduction to compiler Design

  • Lecture Notes

    Dear Students the Lecture Notes has been uploaded for the following topics:
    Introduction to Finite Automata,
    Central concepts of Automata Theory,
    Types of Grammars