Consider the following grammar, note that id, + , [, ], ,, are terminates.

E -> E + T | T

T -> id | id[] | id[X]

X -> E,E | E

Eliminate left recursion.

Then, perform left factoring for the grammar.

Compute the First set for all symbols in the grammar.

Compute the Follow set for all non-terminals in the grammar.

Build an LL(1) parser for the grammar.

Parse the string id+id[id+id,id[]]. Show the stack, the input, and the action taken.

Build the parse tree while you are parsing. Show your parse tree.