📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    Backtracking problem is seen in

    :
    A Predictive parser Correct Answer Incorrect Answer
    B LR parser Correct Answer Incorrect Answer
    C Recursive descent parser Correct Answer Incorrect Answer
    D All of the above Correct Answer Incorrect Answer
    E None of the above Correct Answer Incorrect Answer

    Solution

    In computer science, a  recursive descent parser  is a kind of top-down  parser  built from a set of mutually  recursive  procedures (or a non- recursive  equivalent) where each such procedure implements one of the non terminals of the grammar. Recursive descent  with  backtracking  is a technique that determines which production to use by trying each production in turn.

    Practice Next

    Relevant for Exams:

    ask-question