Question 1 has been answered here in Chegg. Please answer 2 and 3.

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