0 votes 0 votes Given a grammar : $E \rightarrow E + T / T$ $T \rightarrow i$ Can I directly say that grammar is not $LL(1)$ because $LL(1)$ can't parse Left Recursive Grammar, without drawing parsing table ? Compiler Design compiler-design grammar parsing ll-parser left-recursion + – Rahul Ranjan 1 asked Mar 19, 2018 retagged Jun 19, 2022 by Lakshman Bhaiya Rahul Ranjan 1 4.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes you are right if a grammar is Left Recursive ,left factoring and ambiguous. then it never be LL(1) given grammar is left Recursive. then we can directly say it is not LL(1). abhishekmehta4u answered Mar 19, 2018 edited Nov 6, 2023 by Hira Thakur abhishekmehta4u comment Share Follow See 1 comment See all 1 1 comment reply Rustam Ali commented Mar 21, 2018 reply Follow Share if a grammer is Left Recursive , Non-determinstic(multiple production on RHS part ), and ambigious then it will never be LL(1). To solve non-determinism left factoring of CFG is done. 0 votes 0 votes Please log in or register to add a comment.