Compiler Design PYQ 2025-26 AKTU Question Paper

AKTU · BTECH · Semester 6 · Compiler Design · Session 2025-26 · PYQ

AKTU Compiler Design previous year question paper 2025-26 for B.Tech Semester 6. Covers Compiler Foundations, Lexical Analysis and Syntactic Specification…

Open the interactive reader to study this resource on AcademicArk.

Compiler Design AKTU syllabus

  1. Unit 1: Compiler Foundations, Lexical Analysis and Syntactic Specification
  2. Unit 2: Basic Parsing Techniques and Automatic Construction of Efficient Parsers
  3. Unit 3: Syntax-Directed Translation and Intermediate Code
  4. Unit 4: Symbol Tables, Run-Time Administration and Error Recovery
  5. Unit 5: Code Generation and Code Optimization

Questions in Compiler Design AKTU PYQ 2025-26

  1. Q1a. What is a lexical analyzer generator? Name any one tool. (2 marks, 2025-26)
  2. Q1b. Construct DFA for the regular expression: (a+b)∗ab (2 marks, 2025-26)
  3. Q1c. Differentiate between top-down and bottom-up parsing. (2 marks, 2025-26)
  4. Q1d. Define Boolean expression translation. (2 marks, 2025-26)
  5. Q1e. Why are quadruples preferred over triples in an optimizing compiler? (2 marks, 2025-26)
  6. Q1f. List various error recovery strategies for a lexical analysis. (2 marks, 2025-26)
  7. Q1g. What is common subexpression elimination? (2 marks, 2025-26)
  8. Q2a. Check whether given grammar is ambiguous or not. If ambiguous then convert it into unambiguous grammar: E → E + E | E*E | id (7 marks, 2025-26)
  9. Q2b. Describe bottom-up parsing techniques in detail. Explain shift-reduce parsing with example. (7 marks, 2025-26)
  10. Q2c. Describe translation schemes for assignment statements and arithmetic expressions. (7 marks, 2025-26)
  11. Q2d. Discuss run-time storage administration and explain static, stack, and heap allocation schemes. (7 marks, 2025-26)
  12. Q2e. Explain the issues involved in code generation and discuss characteristics of target machine. (7 marks, 2025-26)
  13. Q3a. Explain context-free grammars and their applications in syntax analysis. Discuss derivation and parse trees. (7 marks, 2025-26)
  14. Q3b. Design a lexical analyzer to recognize identifiers, keywords, integers, and operators of a programming language. (7 marks, 2025-26)
  15. Q4a. Discuss LR parsing in detail. Explain LR(0), SLR, CLR, and LALR parsers with comparison. (7 marks, 2025-26)
  16. Q4b. Construct CLR parsing table for the following grammar: S→ CC C→ cC |d (7 marks, 2025-26)
  17. Q5a. Explain three-address code representation and discuss quadruples, triples, and indirect triples. (7 marks, 2025-26)
  18. Q5b. Generate postfix notation and three-address code for : (a+b)∗(c−d)+e (7 marks, 2025-26)
  19. Q6a. Explain symbol table organization and discuss different data structures used for symbol tables. (7 marks, 2025-26)
  20. Q6b. Discuss various error recovery techniques used in compiler design. (7 marks, 2025-26)
  21. Q7a. Discuss machine-dependent optimization techniques and register allocation strategies. (7 marks, 2025-26)
  22. Q7b. Construct DAG for the expression and optimize the code: a = b ∗ c + b ∗ c + d (7 marks, 2025-26)

AKTU paper codes: BCS602

Compiler Design previous year papers

More Compiler Design resources

Browse all notes · Semester 6 notes · Compiler Design notes