GATE Computer Science (CS) 2017 Shift 2 Solved Paper

© examsiri.com

Question : 42 of 65

Marks: +1, -0

Consider the following expression grammar G:
E → E – T | T
T → T + F | F
F → (E) | id
Which of the following grammars is not left recursive, but is equivalent to G?

E → E – T | T
T → T + F | F
F → (E) | id
E → TE’
E’ → -TE’ | ϵ
T → T + F | F
F → (E) | id
E → TX
X → -TX | ϵ
T → FY
Y → +FY | ϵ
F → (E) | id
E → TX | (TX)
X → -TX | +TX | ϵ
T → id

Go to Question:

Prev Question

Next Question