Note: its a question of compiler construction, Topic Parsing, kindly copy and paster the answer from any source.

Q3: Explain, why the given grammar is not SLR (1)? where # is the end-marker A E# E Ea a Ebba Q4: Generate LR(O) machine for the given grammar after removing conflicts, if any? AL L LPP P (PIO) Q5: Generate LALR machine for the following set of productions? block label : assignments jump assignments var = expr assignments E jump goto label | if expr goto label else label | return expr expr constant op expr expr label identifier | number op + 1