Skip to content
Related Articles

Related Articles

Improve Article
UGC-NET | UGC NET CS 2016 July – II | Question 35
  • Last Updated : 20 Apr, 2018

Which of the following is FALSE?
(A) The grammar S → a Sb |bSa|SS|∈, where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.
(B) SLR is powerful than LALR.
(C) An LL(1) parser is a top-down parser.
(D) YACC tool is an LALR(1) parser generator.


Answer: (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.


    Quiz of this Question

    My Personal Notes arrow_drop_up
Recommended Articles
Page :