I don't "see" why the following syntax is equivalent to the second
syntax1:
E -> E + T
E -> T
syntax2:
E -> T E'
E' -> + T E'
E' ->
(it is to avoid left recursion and I am not understanding why the solution works)
How do I mathematically prove that both syntax definitions are equivalent