SUK · Third Year B.Tech. Computer Science and Engineering (Artificial Intelligence and Machine Learning) · NEP 2020
Compilers
AIML3104 · Elective I · Semester V · 3 credits · ISE 10 + mid-semester 30 + ESE 60
One of the Elective I options. The syllabus prints no lecture hours per unit.
Unit 1: Introduction to Compilers
Compiler phases, front end and back end; error handling and recovery; assemblers, interpreters, linkers and loaders; AI-driven compiler optimisation.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Compilers, translators and interpreters
- Phases and structure of a compiler
- Error detection and recovery
Unit 2: Lexical Analysis
The role of the lexical analyser; tokens, lexemes and patterns; regular expressions and finite automata, NFA to DFA; building a lexical analyser and Lex; tokenisation in code models.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Role of the lexical analyser
- Specification and recognition of tokens
- Finite automata for lexical analysis
- Lexical-analyser generators
Unit 3: Syntax Analysis
Top-down and bottom-up parsing; LL grammars, FIRST and FOLLOW, predictive parsing; LR, SLR and LALR parsing and table construction; YACC; ML-based parsing and syntax-error prediction.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Top-down and predictive parsing
- FIRST and FOLLOW sets
- LR(0) items and SLR parsing
- LALR parsing
- Parser generators: YACC
Unit 4: Semantic Analysis and Intermediate Code Generation
Syntax-directed definitions and semantic actions; type checking and inference; symbol tables; three-address code, quadruples and triples; Boolean expressions and control flow; ASTs and IR.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Syntax-directed definitions
- Type checking and type conversion
- Symbol tables and scope
- Three-address code: quadruples and triples
Unit 5: Code Optimisation
Machine-independent optimisations: constant folding, dead-code elimination and loop optimisation; machine-dependent optimisation; flow graphs and data-flow analysis; peephole optimisation; profile-guided, ML-based and RL-driven optimisation.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Local and global optimisation
- Loop optimisation
- Data-flow analysis
- Peephole optimisation
- Machine learning for compiler optimisation
Unit 6: Code Generation and Modern Compiler Trends
Issues in code generation, register allocation, instruction selection and basic blocks; run-time environments, garbage collection and JIT compilers; neural code generation and LLMs in compilers; LLVM, GCC and TensorFlow XLA.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Issues in code generation
- Register allocation
- Basic blocks and flow graphs
- Run-time storage organisation and activation records
- Modern compiler infrastructure: LLVM, GCC and XLA
Unit contents are summarised from the official SUK syllabus . AiCanCode.org is not affiliated with Shivaji University, Kolhapur.