ЁЯУв Too many exams? DonтАЩt know which one suits you best? Book Your Free Expert ЁЯСЙ call Now!

    Question

    A grammar that produces multiple parse trees for the

    same input string is called:
    A Left-recursive Correct Answer Incorrect Answer
    B Right-recursive Correct Answer Incorrect Answer
    C Ambiguous Correct Answer Incorrect Answer
    D Unambiguous Correct Answer Incorrect Answer
    E Context-free Correct Answer Incorrect Answer

    Solution

    Ambiguous

    Practice Next
    More Compiler Design Questions
    ask-question