0 votes 0 votes Show that no grammar that has cycles can be LL(1). Is it true ?? It is saying if the grammar has cycle it can't be LL(1) But what if the cycle in grammar is due to RIGHT RECURSiON which is allowed in LL(1) ??? Compiler Design compiler-design ll-parser + – jatin khachane 1 asked Nov 16, 2018 jatin khachane 1 213 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.