Assume that the SLR parser for a grammar G has n1

0

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between nl and n2 is (GATE CS 2003)
(a) n1 is necessarily less than n2
(b) n1 is necessarily equal to n2
(c) n1 is necessarily greater than n2
(d) none of the above

admin edited question
    0
    Sonali Kapoor (anonymous)

    Answer (b)

    Sonali Kapoor answered
      Add image to editor add image from link

      Question stats

      • Active
      • Views322 times
      • Answers1 answer
      • Followers1 follower
      Question and answer is powered by AnsPress