Consider the following BNF grammar G, based on the TinyPython syntax:

param-list ::= param | param-list , param

param ::= identifier : type-expression

type-expression ::= int | List [ type-expression ]

1. Construct the set of LR(1) items for G (the original grammar given above).

2. Merge the sets of items having common cores to give the set of LALR(1) items.

3. Construct the LALR(1) parsing table from the set of LALR(1) items.

4. Simplify the LALR parsing table using the compaction techniques discussed at the end of Section 4.7.

5. Augment the compacted LALR table with appropriate error recovery calls and routines. Give a general explanation of how your error recovery routines work.