Assignment # 2: Compiler Construction Topic: PARSING Q1: Create a CLR Parsing Table for the given Grammar: AVE EVA E +E+EE-EE* ELE^E (E) | E?E!E Q2: Check the given grammar is SLR (1) or not? where # is the end-marker A E# ETE;T Tepsilon Ta Q3: Explain, why the given grammar is not SLR (1)? where # is the end-marker A E# E Ea a Ebba Q4: Generate LR(0) machine for the given grammar after removing conflicts, if any? AL LLPP P (P)10 Q5: Generate LALR machine for the following set of productions? block label: assignments jump assignments var = expr assignments & jump goto label if expr goto label else label return expr expr constant op expr expr label identifier | number op +| |