Q. 40 Consider the following expression grammar G.
E -> E - T | T T -> T + F | F F -> (E) | id
Which of the following grammars are not left recursive, but equivalent to G.
A) E -> E - T | T T -> T + F | F F -> (E) | id B) E -> TE' E' -> -TE' | ε T -> T + F | F F -> (E) | id C) E -> TX X -> -TX | ε T -> FY Y -> +FY | ε F -> (E) | id D) E -> TX | (TX) X -> -TX | +TX | ε T -> id
Answer: (C)
Explanation:
