suffices to convert an arbitrary CFG to an LL(1) grammar – Gate cs 2003

0

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? (GATE CS 2003)
(a) Removing left recursion alone
(b) Factoring the grammar alone
(c) Removing left recursion and factoring the grammar
(d) None of the above

 

admin edited question
    0
    Sonali Kapoor (anonymous)

    Answer(d)
    Removing left recursion and factoring the grammar do not suffice to convert an arbitrary CFG to LL(1) grammar.

    Sonali Kapoor answered
      Add image to editor add image from link

      Question stats

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