Theory of Computation (Automata)
In computer science, Context-free grammar refers to which of the following?
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) question asks: In computer science, Context-free grammar refers to which of the following? The correct choice is A. A formal grammar in which every production rule has a single non-terminal on its left-hand side.. 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 formal grammar in which every production rule has a single non-terminal on its left-hand side. ✓
- B. An automaton that uses a stack to recognize context-free languages.
Why not B: “An automaton that uses a stack to recognize context-free languages.” does not fit this question. The answer is A formal grammar in which every production rule has a single non-terminal on its left-hand side..
- C. A property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer.
Why not C: “A property of a problem indicating whether an algorithm can be constructed that always provides a correct yes/no answer.” does not fit this question. The answer is A formal grammar in which every production rule has a single non-terminal on its left-hand side..
- D. A classification of formal grammars into four types based on their generative power.
Why not D: “A classification of formal grammars into four types based on their generative power.” does not fit this question. The answer is A formal grammar in which every production rule has a single non-terminal on its left-hand side..
Correct answer
A. A formal grammar in which every production rule has a single non-terminal on its left-hand side.
Explanation
A formal grammar in which every production rule has a single non-terminal on its left-hand side option A is the accepted answer to In computer science Context-free grammar refers to which of the following Option B An automaton that uses a stack to recognize context-free languages does not fit this question Option C A property of a problem indicating whether an algorithm can be constructed that always provides a correct yes no answer does not fit this question Option D A classification of formal grammars into four types based on their generative power does not fit this question For this Theory of Computation Automata question the accepted answer 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
- Identify the correct definition of Turing machine.
- Which statement correctly explains Regular language?
- The concept in which an abstract computational model that manipulates symbols on an infinite tape according to...
- Which concept is defined as follows: the undecidable problem of determining whether a given program will finis...
- What is the function or purpose of Pushdown automaton?
- What is Halting problem primarily used for?