Compiler Design - Computer Science & Information Technology Previous Year Questions
Practice Compiler Design - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
29Papers
19Years
94Questions
1Topics
Compiler Design question pattern
Every graph below is calculated only from this selection.
Questions by year
Compare question counts across years.
Difficulty distribution
How the classified questions are distributed by difficulty.
94questions
Medium64
68.1%
Easy25
26.6%
Hard5
5.3%
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
94questions
MCQ71
75.5%
Numerical Answer Type (NAT)13
13.8%
MSQ8
8.5%
Fill in the blanks2
2.1%
Subject weightage
Top subjects by unique question coverage.
Computer Science & Information Technology
94 Qs
Most asked topics
Top topics across the included previous year papers.
Compiler Design
94 Qs
Subtopic coverage
Top subtopics inside this exact selection.
Lexical and Syntax Analysis
53 Qs
Code Generation and Optimization
25 Qs
Translation and Runtime Environments
16 Qs
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science and Information Technology (CS) 2026
3 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2017 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
2 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
4 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
4 Qs
Computer Science & Information Technology (CS) 2011
4 Qs
Computer Science & Information Technology (CS) 2010
5 Qs
Computer Science & Information Technology (CS) 2009
2 Qs
Computer Science & Information Technology (CS) 2008
4 Qs
Computer Science & Information Technology (CS) 2007
4 Qs
Browse by subtopics
Open a focused page built from the same verified paper data.
2013 · Computer Science & Information Technology · Compiler Design · Lexical and Syntax Analysis
Computer Science & Information Technology (CS) 2013 [Session 1]
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type \(A \rightarrow \epsilon\) and \(A \rightarrow a\)) to parse a string with \(n\) tokens?
2013 · Computer Science & Information Technology · Compiler Design · Lexical and Syntax Analysis
Computer Science & Information Technology (CS) 2013 [Session 3]
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → ε and A → a) to parse a string with n tokens?