Skip to content

Theory of Computation

CSE · Quiz · Spring 25

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 Quiz 03 (65_B_CSE228) Time: 40 min 1. Define parse tree and syntax tree with example. Marks[5] 2. Define Ambiguous Grammar. Check whether the given grammar is ambiguous or not- S -> AB / aaB A -> a / Aa B -> b Consider a string w generated by the given grammar- {w = aabaa} Marks [5] 3. Define CFG. Find the reduced grammar given below: Marks[5] S -> aAa A -> Sb | bCC | DaA C -> abb | DD E -> aC D -> aDA