Consider the regular expressions:

R1 = (01)* (0*1*) (10)
R2 = (101)* (01)*
R3 = (10) (01*)*(01)
R4 = 10(R2*)|R3

Recall that, for a list of regular expressions, the function getToken() returns the next token from the input that matches one of the regular expressions. If there is more than one match, the longest match is returned. If there is more than one longest match, the token with the longest match that appears first in the list is returned. If there is no match, ERROR is returned. If the function getToken() is called once on input 1000101, it will return:

a. R1
b. R2
c. R3
d. R4
e. ERROR

Respuesta :

Answer:

c. R3

Explanation:

For R1;

there are 10 matches, after these 10 no matches occur again

for R2;

this also does not match more than 10 as we have in R1

for r3;

R3 has the longest match. Its matching can be done 1000101 times.

for r4;

The whole of r4 can be matched.

Error;

we cannot have an error because matches exist.

so in answer to this question we pick R3 as the solution because there are more than one longest march and the one returned in the list is that which appeared first. R3 came first

In this exercise we have to use computer knowledge to identify which is the correct sequence of code that best corresponds to the given question, in this way we have that the correct alternative is:

[tex]c. R3[/tex]

So analyzing the first alternative, we find;  

For R1, there are 10 matches, after these 10 no matches occur again.

So analyzing the second alternative, we find;

For R2, this also does not match more than 10 as we have in R1

So analyzing the third alternative, we find;

R3 has the longest match. Its matching can be done 1000101 times.

So analyzing the fourth alternative, we find;

For R4, the whole of r4 can be matched.

So analyzing the fifth alternative, we find;

Error; we cannot have an error because matches exist.

So in answer to this question we pick R3 as the solution because there are more than one longest march and the one returned in the list is that which appeared first.

See more about computer at brainly.com/question/950632

ACCESS MORE
ACCESS MORE
ACCESS MORE
ACCESS MORE