Diploma in Compiler Design




    Compiler Introduction:

    Finite automata and regular expressions, cross compilers, lexical analysis and relations.

    Finite Automata and Regular Expression:

    lexical analyser, finite automata, nfa with epsilon as well as minimization of dfa, regular expressions and transformation from nfa to dfa.

    Contextfree Grammar and Syntax Analysis:

    Syntax analyser, context free grammar, regular grammar as well as right left grammar.

    Topdown Parsing:

    Top-down parsing with its predictives.

    Bottom Up Parsing:

    Bottom-up parsing, right sentinel grammar, l-r parser and parsing table data structures.

    Syntax Directed Definition and Translations:

    Syntax directed definitions and translations, intermediate code generation, three address, implementation of increment and decrement, array reference and switch cases.

    Symbol Table:

    Symbol table management as well as symbol table organization and run time storage.

    Storage Management:

    Storage, stack and static allocations.

    Error Handling:

    Error handling, lexical phase errors, automatic error recovery with yacc and also l-r phase, predictive parsing error recovery.

    Code Optimisation:

    Code optimization, elimination of induction variables, eliminating global common subexpressions, loop optimization, unrolling and jamming.

    Code Generation:

    Code generation, machine model, using dag as code generation and peephole optimization.

    Course Reviews


    • 5 stars0
    • 4 stars0
    • 3 stars0
    • 2 stars0
    • 1 stars0

    No Reviews found for this course.