Theory of Computation (Automata)
What is the function or purpose of Ambiguous grammar?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) MCQ checks one syllabus fact.
The question is: “What is the function or purpose of Ambiguous grammar?”
The accepted answer is B. A grammar for which some string can be generated by more than one distinct derivation tree.. A grammar for which some string can be generated by more than one distinct derivation tree is the fact required by 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 match the stem it is a near-miss used to catch incomplete recall of A grammar for which some string can be generated by more than one distinct derivation tree Option C The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language does not match the stem it is a.
- 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.” is not correct. The accepted answer is B. A grammar for which some string can be generated by more than one distinct derivation tree.. A grammar for which some string can be generated by more than one distinct derivation tree is the fact required by What is the function or purpose of Ambiguous grammar option B Opt
- 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.” is not correct. The accepted answer is B. A grammar for which some string can be generated by more than one distinct derivation tree.. A grammar for which some string can be generated by more than one distinct derivation tree is the fact required by What is the function or purpose of Ambiguous grammar option B Opt
- 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.” is not correct. The accepted answer is B. A grammar for which some string can be generated by more than one distinct derivation tree.. A grammar for which some string can be generated by more than one distinct derivation tree is the fact required by What is the function or purpose of Ambiguous grammar option B Opt
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 fact required by 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 match the stem it is a near-miss used to catch incomplete recall of A grammar for which some string can be generated by more than one distinct derivation tree Option C The process of reducing a deterministic finite automaton to the smallest possible number of states while preserving its language does not match the stem it is a.
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?