Gate2018 cs Q57

0. A lexical analyzer uses the following patterns to recognize three tokens T₁, T₂, and T₃ over the alphabet {a,b,c}.
T₁: a?(b∣c)*a
T₂: b?(a∣c)*b
T₃: 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 processed by the analyzer, which one of the following is the sequence of tokens it outputs?

Answer
Comment
Array

Option : D
Explanation : T₃T₃ because from first T₃ bbaac is taken from second T₃ abc is taken longest possible prefix. Hence T₃T₃ token output.

Forgot your password?

I agree with the Terms.