By using the grammar G: S

$$

aBDh; B

$$

cC ; C

$$

bc$/$; D

$$

EF $|$ BS; E

$$

g$/$;

F

$$

f$/.$

a$.$ CFG of given G$.$

b$.$ Construct parse tree for $$acbcgfh$.$

c$.$ Consider D is starting symbol of G and verify $$cacgf$$is accepted or not.

d$.$ Prove that the given grammar is LL$(1)$