Theory of Computation
Authored by Francis Jency X
Computers
University
Used 11+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Type 0 Grammar of Chomsky hierarchy is called as ___________>
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Type 1 Grammar of Chomsky hierarchy is called as ___________>
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Type 2 Grammar of Chomsky hierarchy is called as ___________>
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Type 3 Grammar of Chomsky hierarchy is called as ___________>
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Grammar which has no rules on the productions are called as ___________.
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
6.
MULTIPLE SELECT QUESTION
45 sec • 1 pt
Grammars in which the LHS is restricted to a single non terminal are called as ___________
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Grammar in which the length of RHS is restricted to atmost two is called as ___________
Unrestricted Grammar
Regular Grammar
Context Free Grammar
Context Sensitive Grammar
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
