McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Discrete Mathematics
→
Context free grammar is also known as __...
Q.
Context free grammar is also known as _______ grammar.
A.
type 0
B.
type 1
C.
type 2
D.
type 3
Answer» C. type 2
2.4k
0
Do you find this helpful?
12
View all MCQs in
Discrete Mathematics
Discussion
No comments yet
Login to comment
Related MCQs
Let S be a start symbol and S -> aA, A -> BA, A -> a, B -> b be the productions in a grammar then one of the string derived form the grammar is _____.
If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____.
S -> aAB, AB -> bB, B -> b, A -> aB satisfies ___________ type of grammar
A regular grammar contains rules of the form _____.
A type-2 grammar contains the rules of the form is____.
The grammar G ={{S},{0,1},P,S}} where P={S tends to 0S1 , S tends to S1} is a ________.
In a grammar or language LAMDA is used to denote _______.
An example for regular grammar is _____.
If all the productions have single non-terminal in the left hand side then the grammar defined is ________grammar.
If S is a start symbol and S -> AB, A -> aB, B -> b are the productions then a string generated by the grammar is _______.