Which of the following is a regular Context Free Grammar:
- AS → abS | baS | Λ
- BS → aSb | baS | Λ
- CS → abS | bSa | Λ
- DS → aSb | Sa | Λ
In S → abS | baS | Λ each production is terminals followed by at most one nonterminal at the right end.
MCQs, short and long questions from lecture 34.Lecture 34 ki MCQs, short aur long sawal.
8 MCQs · 8 MCQs from past papers8 MCQs · 8 MCQs past papers se
Which of the following is a regular Context Free Grammar:
In S → abS | baS | Λ each production is terminals followed by at most one nonterminal at the right end.
Semi-word is a string having some terminals and one non-terminal at the right of string.
A semiword is terminals followed by exactly one nonterminal at the end.
CFG may also represent a regular language.
Every regular language has a CFG (a regular grammar).
The language generated by that CFG is regular if ________
A CFG whose productions are all nonterminal → semiword or word is a regular grammar.
The CFG which generates the regular language is called
A CFG for a regular language in semiword form is a regular grammar.
The language generated by that CFG is regular if _________
If every production is non-terminal → semiword or non-terminal → word, the language is regular.
If every production in CFG is one of the following forms Nonterminal → semi word, Nonterminal → word. Then the language generated by that CFG is :
Such a grammar is a regular grammar, so the language is regular.
CFG is said to be a regular grammar if it generates the regular language i.e.a CFG is said to be a regular grammar in which each production is one of the:
Non-terminal → semiword or non-terminal → word.
No MCQs match this filter.Is filter mein koi MCQ nahi.
No short questions added yet.Abhi koi short sawal shamil nahi.
No long questions added yet.Abhi koi long sawal shamil nahi.