I am currently reading a paper indicating that a cyclic CFG and a left-recursive CFG are different things:
The original purpose of the LC transform is to allow simulation of left-corner parsing by top-down parsing, but it also eliminates left recursion from any noncyclic CFG. (from page 5 of http://research.microsoft.com/pubs/68869/naacl2k-proc-rev.pdf)
Note the second part of this quote:
it also eliminates left recursion from any noncyclic CFG.
I though that a cyclic grammar and a left-recursive grammar go hand in hand? What's the difference?
Thanks for any hint on this!