Exams wasn't easy, you have to prepare max especially the concepts definitions ans differences Some of question I remember are Q1 4 steps of LALR 1 DFA Q2 Write Three Ways to Evaluate Attribute Grammar Q3 LR Parse Tree / Grammar Long Question 1: Write the LALR(1) Algorithm Short Q . Syntax Directed Translation (SDT) – If-Then-Else Question (3 Marks) Complete the SDT for: S → if E then M1 S1 N else M2 S2 using M.quad E.truelist E.falselist S.nextlist N.nextlist makelist() merge() backpatch() Long question Control Flow Graph (CFG) is given. Find: Total Vertices (V) Total Edges (E) Basic Blocks Live Variables In that graph there is also start and exit point present in a rectangular box and exit is joined by B4 and start is joined by B 1 and B2 is joined by B4 by two arrows one in opposi