Menu

Question Discussion & Solution

MCQ

Q.

The grammar defined by regular expressions is known as?

A

regular language

B

regular grammar

C

regular notations

D

regular operation

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Regular expression x/y denotes which of the following set?

A

{x,y}

B

{xy}

C

{x}

D

{y}

Discussion

MCQ

2.

Which of the following regular expression denotes zero or more instances of an a or b?

A

a/b

B

(a/b)*

C

(ab)*

D

a*Ib

Discussion

MCQ

3.

E(q) is known ?-closure of q.

A

True

B

False

C

May be

D

Can't say

Discussion

MCQ

4.

The grammar G: S ? SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G

A

bbb

B

ab

C

All of the mentioned

D

None of the mentioned

Discussion

MCQ

5.

The set of all strings over ? = {a,b} in which strings consisting a

A

ab

B

a*bbb

C

(a+b)* bb

D

All of the mentioned

Discussion

More Compiler Design Topics

Compiler Design Basics

61 MCQs

Non Deterministic Finite Automata

26 MCQs

Lexical Analysis

64 MCQs

Regular Expressions

64 MCQs

Finite Automata

48 MCQs

Syntax Analyser

29 MCQs

Semantic Analyser

11 MCQs

Run Time Environment

10 MCQs

Code Generation

12 MCQs

Code Optimization

22 MCQs

Parsing

110 MCQs

Transformation from NFA to DFA

15 MCQs

Cross Compiler

15 MCQs

Epsilon Moves

15 MCQs