Diploma in Compiler Design
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.
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 management as well as symbol table organization and run time storage.
Storage, stack and static allocations.
Error handling, lexical phase errors, automatic error recovery with yacc and also l-r phase, predictive parsing error recovery.
Code optimization, elimination of induction variables, eliminating global common subexpressions, loop optimization, unrolling and jamming.
Code generation, machine model, using dag as code generation and peephole optimization.
No Reviews found for this course.