If the non-terminal on the left-hand side is repeated as the first symbol of the right-hand side. The phenomenon is called-
If the non-terminal on the left-hand side is repeated as the first symbol of the right-hand side. The phenomenon is called left recursion.
Left recursionis a special case of recursion where a string is recognized as part of a language by the fact that it decomposes into a string from that same language (on the left) and a suffix (on the right).
The production is left-recursive if the left most symbol on the right side is the same as the non- terminal on the left side.