1 votes 1 votes Consider the grammar given below. It is E -> T+E | T T -> a a. SLR(1) but not LL(1) b. Not an operator grammar c. Ambiguous d. None of these Compiler Design compiler-design parsing ambiguous-grammar + – umang_16 asked Dec 16, 2016 • retagged Jun 23, 2022 by Lakshman Bhaiya umang_16 643 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Answered by gabber: For LL(1) : First(T+E) ⋂⋂ First(T) = PHI {a } ⋂⋂ {a} != PHI SO not LL(1). Tendua answered Dec 20, 2016 Tendua comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Is it a ? Its not LL 1 as first of E one will have conflict of two production s.To chk SLR1 we can construct canonical collections and then chk. Surajit answered Dec 16, 2016 Surajit comment Share Follow See all 2 Comments See all 2 2 Comments reply umang_16 commented Dec 16, 2016 reply Follow Share I dont have the answer. And don't have any idea how to proceed in these questions. 0 votes 0 votes papesh commented Dec 16, 2016 reply Follow Share For LL(1) : First(T+E) $\bigcap_{}^{}$ First(T) = PHI {a } $\bigcap_{}^{}$ {a} != PHI SO not LL(1). 3 votes 3 votes Please log in or register to add a comment.