Consider the following BNF grammar G, based on the TinyQ# syntax:

primary-expression ::= variable | function-call

variable ::= identifier | identifier primary-expression

function-call ::= identifier ( primary-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.