Quiz on Context-Free Grammars

The entity which generate Language is termed as:

• Automata

• Tokens

• Grammar

• Data

Production Rule: aAb->agb belongs to which of the following category?

• Regular Language

• Context free Language

• Context Sensitive Language

• Recursively Ennumerable Language

Which of the following statement is false?

• Context free language is the subset of context sensitive language

• Regular language is the subset of context sensitive language

• Recursively ennumerable language is the super set of regular language

• Context sensitive language is a subset of context free language

The Grammar can be defined as: G=(V, ∑, p, S) In the given definition, what does S represents?

• Accepting State

• Starting Variable

• Sensitive Grammar

• None of these

Which among the following cannot be accepted by a regular grammar?

• L is a set of numbers divisible by 2

• L is a set of binary complement

• L is a set of string with odd number of 0

• L is a set of 0n1n

Which of the expression is appropriate? For production p: a->b where a∈V and b∈_______

• V

• S

• (V+∑)*

• V+ ∑

For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?

• Non regular language

• 0n1n | n>=0

• 0n1n | n>=1

• None of the mentioned

The minimum number of productions required to produce a language consisting of palindrome strings over ∑={a,b} is

• 3

• 7

• 5

• 6

Which of the following statement is correct?

• All Regular grammar are context free but not vice versa

• All context free grammar are regular grammar but not vice versa

• Regular grammar and context free grammar are the same entity

• None of the mentioned

Are ambiguous grammar context free?

• Yes

• No