July2016 cs Q35
- Option : B
- Explanation :
- The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous. When we will try to generate an expression then one string can be generated by more then one parse tree.
- LALR is more powerful then SLR.
- An LL(1) parser is a top-down parser.
- YACC tool is an LALR(1) parser generator.
So, option (B) is correct.
