Compiler Design (AL-703 (A)) - Important Questions
-
Unit 15 Marks Medium Priority Asked: 2024
Discuss Write a regular expression to represent a language consisting of strings made up of odd number of a and odd number of b.
Direct extraction from COMPILER DESIGN - DEC 2024 paper.
-
Unit 17 Marks Medium Priority Asked: 2025
Show the output generated by each phase for the following expression $$a = \left( \frac{x}{y} \right) * \left( y + x - z \right)$$
From COMPILER DESIGN - JUN 2025; tests understanding of the output of all compiler phases for a given expression.
-
Unit 17 Marks Medium Priority Asked: 2025
Write a simple Lex program to recognize identifiers.
Direct extraction from COMPILER DESIGN - JUN 2025; practical Lex programming question frequently asked in unit 1.
-
Unit 17 Marks Medium Priority Asked: 2025
Explain how identifiers and keywords are recognized by lexical analysis with an example.
Direct extraction from COMPILER DESIGN - JUN 2025; conceptual question on token recognition by lexical analyzer.
-
Unit 17 Marks High Priority Asked: 2024, 2025
Input Buffering
Core topic in Unit 1; high-frequency according to analytics (appeared across multiple recent papers).
-
Unit 110 Marks High Priority Asked: 2024, 2025
Lexical-analysis related question: write a regular expression or Lex program to recognize identifiers/keywords or explain input buffering and token recognition.
Aggregated lexical-analysis theme appearing repeatedly in past papers: specification and recognition of tokens using regular expressions and Lex.
Quick Add to Notes
Save questions, your own notes and screenshots into notes filed by unit. It takes a free account.
Create free accountHave an account? Log in
Notes Panel