Paper Tayyari

Lecture 34: Regular Grammar

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

Start mock testMock test shuru karein
DoneHal kiye 0/8
– correctsahi
1.
★ Final term Fall 2012

Which of the following is a regular Context Free Grammar:

  1. AS → abS | baS | Λ
  2. BS → aSb | baS | Λ
  3. CS → abS | bSa | Λ
  4. DS → aSb | Sa | Λ

In S → abS | baS | Λ each production is terminals followed by at most one nonterminal at the right end.

2.
★ Final term Spring 2006

Semi-word is a string having some terminals and one non-terminal at the right of string.

  1. ATrue
  2. BFalse

A semiword is terminals followed by exactly one nonterminal at the end.

3.
★ Final term Spring 2006

CFG may also represent a regular language.

  1. ATrue
  2. BFalse

Every regular language has a CFG (a regular grammar).

4.
★ Final term past paper

The language generated by that CFG is regular if ________

  1. ANonterminal → semi word
  2. BNonterminal → word
  3. CBoth a and b
  4. DNone of given

A CFG whose productions are all nonterminal → semiword or word is a regular grammar.

5.
★ Final term past paper

The CFG which generates the regular language is called

  1. ARegular expression
  2. BFinite Automata
  3. CRegular grammar
  4. DNone of the given options

A CFG for a regular language in semiword form is a regular grammar.

6.
★ Final term past paper

The language generated by that CFG is regular if _________

  1. ANo terminal → semi word
  2. BNo terminal → word
  3. CBoth a and b
  4. DNone of given

If every production is non-terminal → semiword or non-terminal → word, the language is regular.

7.
★ Final term past paper

If every production in CFG is one of the following forms Nonterminal → semi word, Nonterminal → word. Then the language generated by that CFG is :

  1. ARegular
  2. BNonregular
  3. CFinite
  4. DInfinite

Such a grammar is a regular grammar, so the language is regular.

8.
★ Final term past paper

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:

  1. AThree forms
  2. BOne form
  3. CFour forms
  4. DTwo forms

Non-terminal → semiword or non-terminal → word.