Question

Make the following grammar unambiguous:
E -> E + T
E -> T
E -> TF
T -> F
F -> F*
F -> (E)
F -> L
L -> -a
L -> -b

Answer 1

No, the symbols represent terminals and non-terminals

Answer 2

It represents expressions whose letters are prefixed by hyphens

Answer 3

I believe that the approach will be to remove left factoring and recursion

Answer 4

I think we need to focus on
E -> T
E -> TF

Answer 5

Compilers, Computation Theory, Discrete Mathmatics