Your roadmap · आपका रोडमैप
- 1
Admission & first meetingप्रवेश और पहली मुलाकातEnquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.
- 2
Part 1 of the syllabusपाठ्यक्रम भाग 1Unit-wise coaching with notes and doubt classes.
Unit 1: Introduction and Lexical AnalysisUnit 2: Parsing TechniquesUnit 3: Syntax-Directed Translation and Intermediate Code
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: Symbol Tables, Run-time Administration and Error RecoveryUnit 5: Code Generation and Optimisation
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 6 exam (university / board)विश्वविद्यालय / बोर्ड परीक्षाPrevious papers and full revision before the exam.
- 6
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
सिलेबस · पाठ्यक्रम
1 subject · 5 chapters · 28 topics
01Unit 1: Introduction and Lexical Analysis
6 टॉपिक+
- Compiler phases and passes, bootstrapping
- Finite automata and regular expressions for lexical analysis
- Optimisation of DFA-based pattern matchers
- Implementation of lexical analysers and LEX
- Formal grammars, BNF, ambiguity and YACC
- Context-free grammars, derivations and parse trees
02Unit 2: Parsing Techniques
6 टॉपिक+
- Shift-reduce and operator precedence parsing
- Top-down parsing, left recursion and left factoring
- FIRST, FOLLOW and predictive LL(1) parsing
- LR(0) items and SLR parsing tables
- Canonical LR and LALR parsing tables
- Using ambiguous grammars and parser generators
03Unit 3: Syntax-Directed Translation and Intermediate Code
6 टॉपिक+
- Syntax-directed definitions and translation schemes
- Postfix notation, syntax trees and three-address code
- Quadruples and triples
- Translation of assignments and Boolean expressions
- Flow-of-control statements and backpatching
- Array references, procedure calls, declarations and case statements
04Unit 4: Symbol Tables, Run-time Administration and Error Recovery
4 टॉपिक+
- Symbol table data structures and scope information
- Activation records and stack allocation
- Storage allocation in block-structured languages
- Lexical, syntactic and semantic error detection and recovery
05Unit 5: Code Generation and Optimisation
6 टॉपिक+
- Issues in code generation and the target language
- Basic blocks and flow graphs
- DAG representation and optimisation of basic blocks
- Machine-independent optimisation: constant folding, common sub-expressions, dead code
- Loop optimisation: code motion, strength reduction, induction variables
- Global data-flow analysis
About this course
आप यह कर पाएँगे
- Explain the phases and passes of a compiler and bootstrapping
- Design lexical analysers using regular expressions, finite automata and LEX
- Compute FIRST and FOLLOW and build LL(1), operator precedence, SLR, CLR and LALR parsers
- Write syntax-directed translation schemes and generate three-address code, quadruples and triples
- Explain symbol tables, activation records, storage allocation and error recovery
- Apply basic block, DAG, loop and data-flow optimisations and generate target code
यह किसके लिए है
- B.Tech Computer Science & Engineering students of Semester 6 (AKTU)
- Students of other universities studying the same subject who want unit-wise coaching
आपको क्या चाहिए
- Theory of Automata and Formal Languages
- Data Structure and C programming
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
सवाल
Which syllabus does the Compiler Design course follow?
It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Compiler Design. If your own university's syllabus differs, the centre follows your university syllabus.
Will this help in the university examination?
Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.
Are parsing table numericals covered?
Yes. FIRST / FOLLOW, LL(1), SLR, CLR and LALR tables and three-address code are solved step by step, as they carry high marks in AKTU papers.
