Time Left - 10:00 mins

GATE CS 2018 - Compiler Design Quiz- 3 (Parsing)

Attempt now to get your rank among 510 students!

Question 1

An LALR (1) parser for a grammar G can have shift–reduce (S–R) conflicts if and only if

Question 2

Consider the following two statements:
P: Every regular grammar is LL(1)
Q: Every regular set has a LR(1) grammar
Which of the following is TRUE?

Question 3

Consider two binary operators ‘ and with the precedence of operator being lower than that of the operator . Operator is right associative while operator is left associative. Which one of the following represents the parse tree for expression (7 3 4 3 2)?

Question 4

Which of the following describes a handle (as applicable to LR–parsing) appropriately?

Question 5

Which one of the following is a top–down parser?
  • 510 attempts
  • 2 upvotes
  • 16 comments
Aug 27GATE & PSU CS