M

Mr. Dubey • 100.69K Points
Coach

Q. A lexical analyzer uses the following patterns to recognize three tokens T1, T2, and T3 over the alphabet {a,b,c}. T1: a?(b∣c)*a T2: b?(a∣c)*b T3: c?(b∣a)*c Note that ‘x?’ means 0 or 1 occurrence of the symbol x. Note also that the analyzer outputs the token that matches the longest possible prefix. If the string bbaacabc is processes by the analyzer, which one of the following is the sequence of tokens it outputs?

  • (A) T1T2T3
  • (B) T1T1T3
  • (C) T2T1T3
  • (D) T3T3
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. We indicate roles in E-R diagrams by labeling the lines that connect to

Q. What are the operations that can be invoked on a condition variable?

Q. In Smart Device Form Factors, can be spread into physical

Q. The ____________ is the distributed-memory version of the OpenMP busywait loop.

Q. A Database Procedure is stored in the Database

Q. Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle?

Q. The last statement of the source program should be

Q. The number of iterations in apriori ___________ Select one: a. b. c. d.

Q. The root node in the file system is write as

Q. Multiple object can be sent over a TCP connection between client and server in

Question analytics