Consider the following context$-$free grammar:

$```$ebnf

G $=$ G$,$ B $|$ G$,$ N $|$ e;

B $="(",$ E$,")"$;

E $=$ E$,"(",$ E$,")"|$ e;

N $="(",$ L$,"]"$;

L $=$ L$,$ E $|$ L$,"("|$ e;

$```$

$1.$ Describe in English the language generated by this grammar. What does this langauge does this grammar recognize? Hint: B stands for "balanced", N stands for "non$-$balanced".

$2.$ Give a parse tree for the string $"((]()".$

$3.$ Give a parse tree for the string $"((()))".$