Question #$3$: Write Context$-$free grammars describe the syntax of any expression that has the form: $G=$ any digits separated by $+$ or $-$ signs $>(1$ mark$)$

Question #$4$: Using the grammar you have written above, use the left side derivation to the following string. $(2$ mark$)$

Question #$5$: Using the grammar you have written above, draw right and leftassociative parse trees for the following string $(2$ mark$)$

Question #$6$: is the grammar above Ambiguous? And why? $(1/2$ mark$)$

Question #$7$: When can we say a CFG is ambiguous? $(1/2$ mark$)$

Question #$8$: Convert the following ambiguous grammar to unambiguous grammar: $(1$ mark$)$

Exp$$Exp$+$Exp

Exp$$Exp$-$Exp

Exp$$ num