Convert the following grammar into an equivalent LL(1) grammar and derive the LL(1) parse table:
S ::= a | (b L L)
L ::= L , a | b
Given the following grammar, convert it to LL(1) form, find the necessary FIRST and FOLLOW set and create an LL(1) parse table:
A ::= AB | B
B ::= Bd | e