need help on number (e)

this is the answer for (c)

1.the grammar should not be an non deterministic

2.the grammar should not have the left recursion

Consider the following BNF grammar that we saw in class: EXP:= EXP + TERM EXP - TERM TERM TERM ::= TERM * FACTOR TERM/FACTOR FACTOR FACTOR ::= (EXP DIGIT DIGIT ::=0|123 (a) Translate into EBNF. (b) Draw syntax diagrams. (c) What are the two requirements on a grammar for a predictive parser to be able to make right choice? (d) Compute First and Follow sets for each of the non-terminals (e) Prove that the grammar satisfy the two requirements defined in (C). Consider the following BNF grammar that we saw in class: EXP:= EXP + TERM EXP - TERM TERM TERM ::= TERM * FACTOR TERM/FACTOR FACTOR FACTOR ::= (EXP DIGIT DIGIT ::=0|123 (a) Translate into EBNF. (b) Draw syntax diagrams. (c) What are the two requirements on a grammar for a predictive parser to be able to make right choice? (d) Compute First and Follow sets for each of the non-terminals (e) Prove that the grammar satisfy the two requirements defined in (C)