Q1: Create a CLR Parsing Table for the given Grammar: A V = E E V | A E E + E | E E | E * E | E ^ E | ( E ) | E ? E | ! E

Q2: Check the given grammar is SLR (1) or not? where # is the end-marker A E# E T | E ; T T epsilon | T a

Q3: Explain, why the given grammar is not SLR (1)? where # is the end-marker A E# E b E a | a E b |b a

Q4: Generate LR(0) machine for the given grammar after removing conflicts, if any? A L L L P | P P ( P ) | ( )

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 + | | |