Automata Theory Chomsky Normal Form Online Exam Quiz
Automata Theory Chomsky Normal Form GK Quiz. Question and Answers related to Automata Theory Chomsky Normal Form. MCQ (Multiple Choice Questions with answers about Automata Theory Chomsky Normal Form
Which of the production rule can be accepted by Chomsky grammar?
Options
A : A->BC
B : A->a
C : S->e
D : All of the mentioned
The format: A->aB refers to which of the following?
Options
A : Chomsky Normal Form
B : Greibach Normal Form
C : Backus Naur Form
D : None of the mentioned
Which of the following does not have left recursions?
Options
A : Chomsky Normal Form
B : Greibach Normal Form
C : Backus Naur Form
D : All of the mentioned
In which of the following, does the CNF conversion find its use?
Options
A : CYK Algorithm
B : Bottom up parsing
C : Preprocessing step in some algorithms
D : All of the mentioned
Every grammar in Chomsky Normal Form is:
Options
A : regular
B : context sensitive
C : context free
D : all of the mentioned
Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be in ___________.
Options
A : restricted form
B : parsed form
C : normal form
D : all of the mentioned
Which of the following grammars are in Chomsky Normal Form:
Options
A : S->AB|BC|CD, A->0, B->1, C->2, D->3
B : S->AB, S->BCA|0|1|2|3
C : S->ABa, A->aab, B->Ac
D : All of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Campus Interviews
Automata Theory Cfl Closure Properties
Automata Theory Cfl Substitution Theorem
Automata Theory Construction Yield Parse Tree
Automata Theory Context Free Grammar Derivations Definitions