Syntax Analysis16

0. Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

  • Option : C
  • Explanation :
    LL(1) grammar is top down parsing. It is used in removing left recursion and factoring the grammar.
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 *