Test: Egular Grammar


Test Description

15 Questions MCQ Test Compiler Design | Test: Egular Grammar

Test: Egular Grammar for Computer Science Engineering (CSE) 2023 is part of Compiler Design preparation. The Test: Egular Grammar questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Egular Grammar MCQs are made for Computer Science Engineering (CSE) 2023 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Egular Grammar below.
Solutions of Test: Egular Grammar questions in English are available as part of our Compiler Design for Computer Science Engineering (CSE) & Test: Egular Grammar solutions in Hindi for Compiler Design course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Egular Grammar | 15 questions in 15 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study Compiler Design for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
1 Crore+ students have signed up on EduRev. Have you?
Test: Egular Grammar - Question 1

How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

Detailed Solution for Test: Egular Grammar - Question 1

String of length 0 = 1
string of length 1 = 4
string of length 2 = 3
string of length 3 = 3.

Test: Egular Grammar - Question 2

 Which of the following is true?

Detailed Solution for Test: Egular Grammar - Question 2

None.

Test: Egular Grammar - Question 3

A language is regular if and only if

Detailed Solution for Test: Egular Grammar - Question 3

All of above machine can accept regular language but all string accepted by machine is regular only for DFA.

Test: Egular Grammar - Question 4

 Regular grammar is

Detailed Solution for Test: Egular Grammar - Question 4

Regular grammar is subset of context free grammar.

Test: Egular Grammar - Question 5

 Which of the following is not a regular expression?

Detailed Solution for Test: Egular Grammar - Question 5

Except b all are regular expression*.

Test: Egular Grammar - Question 6

Regular expression are

Detailed Solution for Test: Egular Grammar - Question 6

 According to Chomsky hierarchy .

Test: Egular Grammar - Question 7

Which of the following is true?

Detailed Solution for Test: Egular Grammar - Question 7

None.

Test: Egular Grammar - Question 8

L and ~L are recursive enumerable then L is

Detailed Solution for Test: Egular Grammar - Question 8

If L is recursive enumerable and its complement too if and only if L is recursive.

Test: Egular Grammar - Question 9

Regular expressions are closed under

Detailed Solution for Test: Egular Grammar - Question 9

According to definition of regular expression.

Test: Egular Grammar - Question 10

Consider the production of the grammar S->AA A->aa A->bb Describe the language specified by the production grammar.

Detailed Solution for Test: Egular Grammar - Question 10

The production rules give aaaa or aabb or bbaa or bbbb.

Test: Egular Grammar - Question 11

 Give a production grammar that specified language L = {ai b2i >= 1}

Test: Egular Grammar - Question 12

 Let R1 and R2 be regular sets defined over alphabet ∑ then

Detailed Solution for Test: Egular Grammar - Question 12

Union of 2 regular languages is regular.

Test: Egular Grammar - Question 13

Which of the following String can be obtained by the language L = {ai b2i / i >=1}

Detailed Solution for Test: Egular Grammar - Question 13

 Above production rule gives suppose if 3 a’s the corresponding b’s are 6 b’s.

Test: Egular Grammar - Question 14

Give a production grammar for the language L = {x/x ∈ (a,b)*, the number of a’s in x is multiple of 3}.

Detailed Solution for Test: Egular Grammar - Question 14

The above given condition is satisfied by
S->bS S->B
S->aA s->bA A->aB B->bB
B->aS S->a.

Test: Egular Grammar - Question 15

The production Grammar is {S->aSbb, S->abb} is

Detailed Solution for Test: Egular Grammar - Question 15

Type 2 grammar satisfies this production grammar.

15 videos|55 docs|30 tests
Use Code STAYHOME200 and get INR 200 additional OFF
Use Coupon Code
Information about Test: Egular Grammar Page
In this test you can find the Exam questions for Test: Egular Grammar solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Egular Grammar, EduRev gives you an ample number of Online tests for practice