Consider this subset of the tree grammar:

a$)$ L $->[]$

b$)$ L $->[$ LL $]$

c$)$ LL $->$

d$)$ LL $->$ LL $,$

Add a brand new starting non$-$terminal

S $->$ L $

Then:

a$)$ Define the states for the grammar.

b$)$ Make a table the grammar.

c$)$ Use your table to parse the expression:

$[$ "Hello" $,$ "there" $]$