Theory of Computation (Automata)
What term describes the following? a formal grammar in which every production rule has a single non-terminal on its left-hand side.
Difficulty: Hard
About this MCQ
This Hard Theory of Computation (Automata) MCQ checks one syllabus fact.
The question is: “What term describes the following? a formal grammar in which every production rule has a single non-terminal on its left-hand side.”
The accepted answer is C. Context-free grammar. Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.
- A. Alphabet
Why not A: “Alphabet” is not correct. The accepted answer is C. Context-free grammar. Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.
- B. Deterministic finite automaton (DFA)
Why not B: “Deterministic finite automaton (DFA)” is not correct. The accepted answer is C. Context-free grammar. Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.
- C. Context-free grammar ✓
- D. Non-deterministic finite automaton (NFA)
Why not D: “Non-deterministic finite automaton (NFA)” is not correct. The accepted answer is C. Context-free grammar. Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.
Correct answer
C. Context-free grammar
Explanation
Context-free grammar refers to a formal grammar in which every production rule has a single non-terminal on its left-hand side.
Source: Theory of Computation (Automata) Official Reference Guide
Tags: computer science, automata theory, theory of computation, formal languages
Submitted by: MCQsHub Editorial
Related MCQs
- The concept in which a finite sequence of symbols drawn from an alphabet is best known as which of these terms...
- Identify the correct definition of String (formal language).
- What term describes the following? a set of strings composed of symbols from a defined alphabet.
- In computer science, Formal language refers to which of the following?
- Select the correct name for: an operation on a set of symbols or strings that produces the set of all possible...
- Which statement correctly explains Kleene star?