Reqular Expressions Questions

MCQ bookmark_border

71.

Which of the following regular expression is equivlant to R(1,0)?R(1,0)={111*}*

A

(11+111)*

B

(111+1111)*

C

(111+11*)*

D

All of the mentioned

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

72.

Which of the following is/are the suitable approches for inferencing?

A

Recursive Interference

B

Derivations

C

Both Recursive Interference and Derivations

D

None of the mentioned

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

73.

For an automata, which of the following are equivalant variants ?DFA,NFA and NFA  with epsilon transitions

A

DFA and NFA

B

 NFA and  epsilon NFA

C

DFA and epsilon NFA

D

All of the mentioned

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

74.

Let the class of language accepted by finite state machine be L1 and the class of  languages represented by regular expressions be L2 then

A

L1 < L2

B

L1 >= L2

C

L1 U L2

D

L1=L2

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

75.

Which of the follwing options is incorrect?

A

A language L is regular if and only if ~L has finite number of equivalent classes.

B

Let be a regular Language. if ~L has k equivalent classes,then and DFA that recognizes L must have atmost k states

C

A language is L is NFA-regular if and only if it is DFA-regular

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

76.

Regular expression are

A

Type 0 language

B

Type 1 language

C

Type 2 language

D

Type 3 language

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

77.

what does the following segment of codes here?grep -i men heroes.txt

A

manuelly opens a file called hereos.txt

B

managed hereos.txt

C

search for man in the file heroes.txt

D

none of the mentioned

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

78.

For the given Regular expression, the minimum number of terminals required to derive its grammer is:(011+1)*(01)*

A

4

B

3

C

5

D

6

Correct Answer: B

The grammer can be writter as : S->BC B->AB|e A->011|1 C->DC|e D->01

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

79.

Choose the correct option:Statement: Unambiguity is the ideal structure of a language

A

true

B

partially true

C

false

D

cant be said

Correct Answer: A

Idealy,there should be only one parse tree of each string,i.e the language should be unambiguous

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

80.

Which of the following parsers do not relate to bottom up parsing ?

A

LL parser

B

Recursive descent parser

C

Earley parsers

D

All of the mentioned

Correct Answer: D

All the following mentioned are top down parsers and begin their operation from the starting symbol.

Check Answer report_problem Report forum Discussion