1 votes 1 votes Compiler Design compiler-design ll-parser test-series + – Himanshu1 asked Jan 1, 2016 • edited Jul 19, 2022 by makhdoom ghaya Himanshu1 1.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes Ans) A. Morphine answered Jan 1, 2016 • selected Jan 1, 2016 by Himanshu1 Morphine comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes S->aA {a} S->B {b,c} so {a} ∩ {b,c}= ∅; {First of the respective RHS} A->aA {a} A->b {b} so, {a} ∩ {b} = ∅ B->bB {b} B->c {c} so, {b} ∩ {c} = ∅ Therefore LL(1) grammar.Hence Deterministic,Not ambiguous and Not Left Recursive. MaheshK answered Jan 1, 2016 • edited Jan 1, 2016 by Himanshu1 MaheshK comment Share Follow See all 0 reply Please log in or register to add a comment.