Given the following grammar G$,$ please determine if it is ambiguous or not. If it is$,$ please

provide an example illustrating its ambiguity and rewrite it to make it unambiguous. If this

cannot be done, please say so$.$ Otherwise, if it is not ambiguous, please state clearly that it is not.

Question $2$

Utilizing the grammar from the end of Question $1,$ please determine if the grammar contains any

left$-$recursion. If it does, please remove it$.$ If it does not, please state clearly that it does not.

Question $3$

Left$-$factorization is a grammar transformation technique that can help better prepare a grammar

for recognition by a predictive parser. When faced with a choice between two different

A$-$productions, it may not be possible to determine which production to utilize.

If $A{}_1|{}_2$ are two A $-$productions, and the input begins with a nonempty string derived

from $,$ we may not know which production to utilize. By introducing a new nonterminal into the

grammar, we may delay the decision until more of the input has been seen, allowing us to make

the correct choice.

Here, we introduce A$\text{'}$ and reformulate the productions to become

$A{A}^{\text{'}}$

$A^{\text{'}}{}_1|{}_2$

In general, the procedure for doing this is as follows:

For each nonterminal A$,$ find the longest prefix $$ common to two or

more of its alternatives. If $,$ replace all A$-$productions of the form

$A{}_1|{}_2|dots||$

where $$ represents all alternatives that do not begin with $,$ with

$A{A}^{\text{'}}|$

$A^{\text{'}}{}_1|{}_2|dots|$

Apply this transformation until no two alternatives for a nonterminal have

a common prefix.

Utilizing the grammar from the end of Question $2,$ please left$-$factor it$.$

Question $4$

While we will discuss further the nature and generation of First and Follow sets, practice now

makes perfect later Utilizing the grammar from the end of

Question $3,$ please generate the First and Follow sets for each grammar symbol and nonterminal,

respectively. That is$,$ please generate the First sets for the grammar symbols of G and the Follow

sets for the nonterminals of G$.$