Skip to content

Compiler Design

CSE · Quiz · Fall 25

Paper 3 of 5By SUPAN ROYSwitch

Paper 3 of 5

This browser can’t show the PDF here

Open it, and your phone’s PDF viewer takes it, or download it.

Read the questions as text

Read off the PDF by AI, so it may have mistakes. The PDF is the original.

Daffodil International University Department of Computer Science and Engineering Course: Compiler Design Quiz 2 Questions Q1. Find FIRST() and FOLLOW() functions from the following productions: S -> aBDh | D -> EF B -> cC | E -> g / epsilon C -> bC / epsilon | F -> f / epsilon [8] Q2. Construct an LL(1) parsing table for the grammar given in Question 1. [4] Q3. Consider the following grammar and eliminate left recursion if there exists: S -> A A -> Ad / Ae / aB / ac B -> Bb / BaA'b / cA'b / d [3]