Is it possible to detect and warn about the left recursion? Assuming a data structure representing the grammar is built at runtime to be interpreted.

Won't it be possible to detect the left recursion instead of going into an infinite loop?