Theory of Computation (Automata)
What is the function or purpose of Ambiguous grammar?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) question asks: What is the function or purpose of Ambiguous grammar? The correct choice is B. A grammar for which some string can be generated by more than one distinct derivation tree.. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Theory of Computation (Automata) items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Theory of Computation (Automata) so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Theory of Computation (Automata) item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. A class of languages for which a Turing machine will accept and halt on strings in the language, but may not halt on strings outside it.
Why not A: “A class of languages for which a Turing machine will accept and halt on strings in the language, but may not halt on strings outside it.” does not fit this question. The answer is A grammar for which some string can be generated by more than one distinct derivation tree..
- B. A grammar for which some string can be generated by more than one distinct derivation tree. ✓
- C. The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.
Why not C: “The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language.” does not fit this question. The answer is A grammar for which some string can be generated by more than one distinct derivation tree..
- D. The sequence of production rule applications used to generate a string from a grammar's start symbol.
Why not D: “The sequence of production rule applications used to generate a string from a grammar's start symbol.” does not fit this question. The answer is A grammar for which some string can be generated by more than one distinct derivation tree..
Correct answer
B. A grammar for which some string can be generated by more than one distinct derivation tree.
Explanation
A grammar for which some string can be generated by more than one distinct derivation tree is the value that answers What is the function or purpose of Ambiguous grammar option B Option A A class of languages for which a Turing machine will accept and halt on strings in the language but may not halt on strings outside it does not fit this question Option C The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language does not fit this question Option D The sequence of production rule applications used to generate a string from a grammar's start symbol does.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- Choose the correct description of Derivation.
- Identify the correct definition of Universal Turing machine.
- The sequence of production rule applications used to generate a string from a grammar's start symbol. What is...
- What term describes the following? a property used to prove that certain languages are not regular by showing...
- DFA minimization is best defined as which of the following?
- In computer science, Pumping lemma refers to which of the following?