Automata Theory Cfl Substitution Theorem Online Exam Quiz
Automata Theory Cfl Substitution Theorem GK Quiz. Question and Answers related to Automata Theory Cfl Substitution Theorem. MCQ (Multiple Choice Questions with answers about Automata Theory Cfl Substitution Theorem
Which among the following is a correct option in format for representing symbol and expression in Backus normal form?
Options
A : <symbol> ->expression
B : <symbol>::=_expression_
C : <symbol>=<expression>
D : all of the mentioned
Which of the following is true for Valiants algorithm?
Options
A : an extension of CYK
B : deals with efficient multiplication algorithms
C : matrices with 0-1 entries
D : all of the mentioned
Which of the following grammars is similar to Floyd Normal form?
Options
A : Backus Naur Form
B : Kuroda Normal Form
C : Greibach Normal Form
D : Chomsky Normal Form
Every Kuroda Normal form grammar generates ___________
Options
A : Context free grammar
B : Context sensitive grammar
C : Unrestricted grammar
D : None of the mentioned
The standard version of CYK algorithm operates only on context free grammars in the following form:
Options
A : Greibach Normal form
B : Chomsky Normal form
C : Backus Naur form
D : All of the mentioned
Which of the following can generate Unrestricted grammars?
Options
A : Pentonnen Normal form
B : Floyd Normal form
C : Greibach Normal form
D : None of the mentioned
Which among the following can parse a context free grammar?
Options
A : top down parser
B : bottom up parser
C : CYK algorithm
D : all of the mentioned
Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n.
Options
A : top-down parser
B : bottom-up parser
C : multitape turing machine
D : none of the mentioned
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Campus Interviews
Automata Theory Cfl Closure Properties
Automata Theory Chomsky Normal Form
Automata Theory Construction Yield Parse Tree
Automata Theory Context Free Grammar Derivations Definitions