Subject: Compiler Construction

Question 2 [9 Marks + 6 Marks = 15 Marks Consider the following grammar along with their abbreviations: Non-terminals/Abbreviations Grammar PU USU UCU SA; A + Id =E ETE E' - TETE P = Program U = Statements S=Statement A = Assignment Statement E = Expression T = Term F Factor is TFT TFTC F- () Id Note: There is no left-recursion and common prefixes (first/first conflicts) Answer Following: a. Generate LL (1) Parsing Table along with Panic mode recovery? b. Give detail for how a non-recursive predictive parser will parse the sentence "a=b*c*;" using the table you constructed above