Note: Its a question of compiler construction. kindly do not copy paste and give the answers accurately just like it is asked.

Topic: PARSING Q1: Create a CLR Parsing Table for the given Grammar: AV=E E VIA E > E+E | E-EE* ELE^E(E)TE?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# EbEa a Ebba Q4: Generate LR(O) machine for the given grammar after removing conflicts, if any? AL LLPIP 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 +| 1:1