Aug2016 cs Q35

0. Which of the following is FALSE?

  • Option : B
  • Explanation :
  • The grammar S→aS|aSbS|∈, where S is the only non-terminal symbol, and ∈ is the null string, is ambiguous.Correct
  • An unambiguous grammar has same left most and right most derivation.Inorrect
  • An ambiguous grammar can never be LR(k) for any k.Correct
  • Recursive descent parser is a top-down parser.Correct
  • So, option (B) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *