GTU · BE Computer · Semester 7
GTU 3170701 Compiler Design (CD) Old Question Papers & Solutions PDF
Official Gujarat Technological University (GTU) old question papers PDF (Regular & Remedial) and step-by-step solved questions for Compiler Design (CD) across 2023 – 2026 examinations.
39 questions GTU asked more than onceAsked in 6 of 7 papers: Explain error recovery strategies.See listExam papers
Most repeated questions
39 questions GTU set in two or more of 7 papers, most repeated first. Tap a year to open that paper at the question.
Explain error recovery strategies.
Summer 2026 Q4b Winter 2025 Q4c Summer 2025 Q4b Winter 2024 Q4c Summer 2024 Q2b Summer 2023 Q4b OR
Write a short note on activation record.
Summer 2026 Q4a OR Winter 2025 Q4b OR Winter 2024 Q5b OR Summer 2024 Q5a Winter 2023 Q4a Summer 2023 Q4a
Draw DFA for the following regular expression without construction of NFA. (1 | 0) * 1 (1 | 0) #
Winter 2025 Q2c OR Winter 2024 Q2c OR Summer 2024 Q2c Winter 2023 Q2c Summer 2023 Q2c
Describe code generator design issues.
Summer 2026 Q5c Winter 2025 Q5c Summer 2024 Q5c OR Winter 2023 Q5c OR Summer 2023 Q5c OR
Explain different phases of compiler. For an expression given below, write output of all phases of a complier. Assume a, b and c of type float. a = b + c * 60
Winter 2025 Q1c Summer 2025 Q1c Winter 2024 Q1c Winter 2023 Q1c Summer 2023 Q1c
Explain parameter passing techniques for procedure.
Summer 2026 Q5b OR Summer 2025 Q4b OR Winter 2024 Q5b Summer 2024 Q4a OR Summer 2023 Q5b OR
Translate following arithmetic expression - ( a * b ) + ( c + d ) - ( a + b + c + d ) into 1. Quadruples 2. Triple 3. Indirect Triple
Summer 2026 Q4c Summer 2025 Q4c Winter 2024 Q4c OR Winter 2023 Q4c
Explain any three code optimization techniques in detail
Winter 2024 Q5c OR Summer 2024 Q5c Winter 2023 Q5c Summer 2023 Q5c
Explain Shift-Reduce parser with proper example.
Summer 2026 Q3b Summer 2024 Q4c OR Winter 2023 Q3a Summer 2023 Q3a OR
Explain Peephole Optimization.
Summer 2026 Q4b OR Winter 2025 Q4a OR Summer 2025 Q5c OR Winter 2024 Q5c
Show 29 more repeated questionsHide the 29 more
Explain Indirect Left Recursion with proper example.
Summer 2026 Q1b Winter 2024 Q2b Summer 2024 Q3b OR Winter 2023 Q2b
Write the regular expression R over {0,1} or {a,b}:
Summer 2026 Q2b Summer 2025 Q2b Winter 2023 Q2a Summer 2023 Q1b
Explain input buffering methods.
Summer 2026 Q2a Winter 2024 Q1b Summer 2024 Q1b Summer 2023 Q2b
What is an ambiguous grammar? Show that S → if E then S | if E then S else S | other is an ambiguous grammar.
Summer 2026 Q3a Winter 2025 Q3b Winter 2024 Q3b OR Summer 2023 Q2a
Differentiate Top Down Parsing and Bottom up parsing.
Summer 2026 Q3a OR Summer 2025 Q5a OR Winter 2024 Q3a Summer 2023 Q3b OR
Discuss symbol table management
Winter 2025 Q4a Summer 2025 Q5b OR Winter 2024 Q4a OR Summer 2023 Q4b
Explain recursive decent parser with suitable example.
Draw NFA from regular expression using Thomson’s construction and convert it into DFA. (a | b)* a b b.
Give syntax directed definition for simple desk calculator. Also show annotated parse tree for 6*5+7n.
Explain left factoring with suitable example
Explain code-scheduling constraints
Explain Syntax-Directed Definitions (SDD) with suitable example
What is inherited attribute? Explain with suitable example.
Compare: Static v/s Dynamic Memory Allocation
Discuss blocks and flow graphs
Implement the following grammar using Recursive Descent Parser. S -> Aa | bAc | bBa A -> d B -> d
Explain rules to satisfy operator grammar. Generate precedence function table for following grammar. E -> ESE | id S -> + | *
Explain operator precedence parser with suitable example
Explain various storage allocation strategies in detail
Check the following grammar is SLR(1) or not S → Aa | bAc | Bc | bBa A → d B → d
Check whether the following grammar is SLR or not S -> AaAb | BbBa A -> ε B -> ε
Check that following grammar is LL (1) or not E→E+T | T T→T*F | F F→(E) | id
Generate canonical parsing table for following augmented grammar. S’->S S->CC C->Cc/d.
Write down the algorithm for partitioning of basic blocks.
Draw a DAG for expression: a + a * (b – c) + (b – c) * d.
Give difference between compiler and interpreter
Explain lexeme, token and pattern with an example
What do you mean by dangling references?
List the cousins of compiler and explain cross-compiler.
Which branches take this subject
GTU's syllabus lists 3170701 for 3 branches. One set of papers serves all of them.
Semester 7: 2 branches
Computer Engineering, Computer Science & Engineering
Semester 7, elective: 1 branch
Information & Communication Technology
Other Semester 7 subjects
Common questions
Are these GTU 3170701 Compiler Design papers valid for both Regular and Remedial exams?
Yes. Gujarat Technological University (GTU) follows the same 70-mark syllabus, exam blueprint, and 23-mark passing cutoff for both Regular and Remedial (ATKT/backlog) examinations. All 7 past exam sessions (2023 – 2026) serve as comprehensive preparation for either attempt.
How can I download GTU 3170701 Compiler Design old question papers PDF?
You can download official GTU 3170701 original question paper PDFs directly from the table above with 1 click and zero deceptive ads or wait timers. Every paper also includes interactive online questions with AI study prompts.
What is the passing mark for GTU Compiler Design (3170701)?
The external theory exam carries 70 marks. The minimum passing cutoff is 23 marks (33%). Exam duration is 2.5 hours.
What is the GTU exam pattern for 3170701?
The examination contains 5 main questions of 14 marks each, totaling 70 marks. Questions 2 through 5 provide internal OR choices, typically split into 3-mark, 4-mark, and 7-mark questions.