The following grammar G is left recursive.
E → E + T | T
T → T * F | F
F → (E) | id
Which of the following is a correct left-recursive variant of G?
E → TE'
E' → T + E'
1
T → FT'
T' → F* T'
F → (E) |id
E → TE'
E' → TE' + | ε
2
T → FT'
T' → FT'* | ε
F → (E) | id
E → E'T
E' → +TE' | ε
3
T → T'F
T' → *FT' | ε
F → (E) | id
E → TE'
E' → ε | +TE'
4
T → FT'
T' → *FT' | ε
F → (E) | id
5
Question Not Attempted