Consider the following grammar G, which represents a fragment ofa simple programming language:
L → LE | E
E → (C) | (F) | V | T
C →ifEE |ifEEE
F → +L |−L |∗L |printL
V → a | b | c | d
T → 0 | 1 | 2 | 3
Q: Find an equivalent grammar G′ which is LL(1), by using thegrammar transformation techniques
Expert Answer
An answer will be send to you shortly. . . . .