test series

Question

Consider the SDT having left recursion .

X→XY{X.x=f(X.x,Y.y)}

X→Z{X.x=G(Z.z)}       

prove that after removal of left recursion it will be

X→Z{X.x=G(Z.z)} R

R→Y{X.x=f(X.x,Y.y)}R

R→ℇ

Comments

@talha hashim

You've to give test-series name