Consider the following BNF grammar G:

primary$-$expression ::$=$ variable $|$ function$-$call

variable ::$=$ identifier $|$ identifier $[$ primary$-$expression $1$

function$-$call ::$=$ identifier $($ primary$-$expression $)$

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

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

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

Simplify the LALR parsing table using the compaction techniques discussed at the end of Section $4\mathrm{.}7($section $4\mathrm{.}7\mathrm{.}6).$

Note: you can simplify or rename the terminals and nonterminals of the above grammar $G$ so that it will be easier to construct the sets of LR$(1)$ items for G:

$E$::$=V|F|$

$V$:$=id|id[E]|$

$F$:$=id(E)$