. After removal of left recursion the grammar becomes

E T E'

E' + T E' | ε

T F T'

T' * F T' | ε

F ( E ) | id

As another example, a grammar having left recursion and its modified version with left recursion removed has been shown.