Question 1
Describe the role of the symbol table in relation to the six phases of a compiler.
Describe the role of the symbol table in relation to the six phases of a compiler.
Draw NFA from regular expression using Thomson’s construction and convert it into DFA. (a | b)* a b b.
Implement the following grammar using Recursive Descent Parser.S -> Aa | bAc | bBaA -> dB -> dWhat is an ambiguous grammar?Show that S → if E then S | if E then S else S | other is an ambiguousgrammar.Generate canonical parsing table for following augmented grammar.S’->SS->CCC->Cc/d.Generate LR(0) Item set forS → AAA → aA | bExplain rules to satisfy operator grammar. Generate precedence function tablefor following grammar.E -> ESE | idS -> + | *Translate following arithmetic expression
Give syntax directed definition for simple desk calculator. Also show annotated parse tree for 6*5+7n.
Explain copy propagation and dead code elimination with respect to loop optimization.
What is DAG? What are its advantages in context of optimization? How does it help in eliminating common sub expression?
Circulate this solved paper with KaTeX formulas and 1-click AI step solvers to your batchmates on WhatsApp or Telegram.
Official Gujarat Technological University (GTU) examination paper and step-by-step solutions for Compiler Design (CD) (Summer 2026, B.E. · Computer Engineering, Sem 7). Features complete 70-mark regular & remedial examination pattern, official marking distribution across all 5 questions, and direct 1-click official PDF download.
Transcribed for student exam preparation from Gujarat Technological University official examination archives. Questions, syllabus guidelines, and curriculum marking schemes remain the intellectual property of Gujarat Technological University.