Practice Library
All MCQs
Browse exam-wise, subject-wise, and country-wise MCQs with explanations.
Choose an option to check your answer.
A.
a grammar type powerful enough to generate recursively enumerable languages
B.
a grammar that only generates finite languages
C.
a grammar without variables
D.
a grammar equal to every DFA
Show Answer
Correct Answer: A. a grammar type powerful enough to generate recursively enumerable languages
Explanation:
The correct answer is a grammar type powerful enough to generate recursively enumerable languages.
Choose an option to check your answer.
A.
a grammar that generates only undecidable languages
B.
a grammar with an unrestricted left side
C.
a grammar that generates regular languages
D.
a grammar that always has ambiguous parse trees
Show Answer
Correct Answer: C. a grammar that generates regular languages
Explanation:
The suitable explanation is a grammar that generates regular languages.
Choose an option to check your answer.
A.
a grammar that always has ambiguous parse trees
B.
a grammar with an unrestricted left side
C.
a grammar that generates regular languages
D.
a grammar that generates only undecidable languages
Show Answer
Correct Answer: C. a grammar that generates regular languages
Explanation:
In this course context, regular grammar means a grammar that generates regular languages.
Choose an option to check your answer.
A.
a grammar with an unrestricted left side
B.
a grammar that generates only undecidable languages
C.
a grammar that generates regular languages
D.
a grammar that always has ambiguous parse trees
Show Answer
Correct Answer: C. a grammar that generates regular languages
Explanation:
regular grammar is correctly described as a grammar that generates regular languages.
Choose an option to check your answer.
A.
a grammar that generates regular languages
B.
a grammar with an unrestricted left side
C.
a grammar that always has ambiguous parse trees
D.
a grammar that generates only undecidable languages
Show Answer
Correct Answer: A. a grammar that generates regular languages
Explanation:
The correct answer is a grammar that generates regular languages.
Choose an option to check your answer.
A.
the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
B.
a method for database indexing
C.
a list of all compiler phases
D.
a programming language syntax only
Show Answer
Correct Answer: A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
Explanation:
The suitable explanation is the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.
Choose an option to check your answer.
A.
the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
B.
a method for database indexing
C.
a programming language syntax only
D.
a list of all compiler phases
Show Answer
Correct Answer: A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
Explanation:
In this course context, Chomsky hierarchy means the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.
Choose an option to check your answer.
A.
the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
B.
a method for database indexing
C.
a programming language syntax only
D.
a list of all compiler phases
Show Answer
Correct Answer: A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
Explanation:
Chomsky hierarchy is correctly described as the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.
Choose an option to check your answer.
A.
the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
B.
a programming language syntax only
C.
a list of all compiler phases
D.
a method for database indexing
Show Answer
Correct Answer: A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes
Explanation:
The correct answer is the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes.
Choose an option to check your answer.
A.
a TM with infinite output symbols only
B.
a DFA with exactly one transition
C.
a restricted Turing machine whose tape is bounded by a linear function of input length
D.
a PDA with no stack
Show Answer
Correct Answer: C. a restricted Turing machine whose tape is bounded by a linear function of input length
Explanation:
The suitable explanation is a restricted Turing machine whose tape is bounded by a linear function of input length.
Choose an option to check your answer.
A.
a DFA with exactly one transition
B.
a PDA with no stack
C.
a restricted Turing machine whose tape is bounded by a linear function of input length
D.
a TM with infinite output symbols only
Show Answer
Correct Answer: C. a restricted Turing machine whose tape is bounded by a linear function of input length
Explanation:
In this course context, linear bounded automaton means a restricted Turing machine whose tape is bounded by a linear function of input length.
Choose an option to check your answer.
A.
a restricted Turing machine whose tape is bounded by a linear function of input length
B.
a DFA with exactly one transition
C.
a PDA with no stack
D.
a TM with infinite output symbols only
Show Answer
Correct Answer: A. a restricted Turing machine whose tape is bounded by a linear function of input length
Explanation:
linear bounded automaton is correctly described as a restricted Turing machine whose tape is bounded by a linear function of input length.
