Home / Engineering / Theory of Computation and Compiler Design / Question
M
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?
Related MCQs on Theory of Computation and Compiler Design
Q. Which of the following is not Application Areas of Fuzzy Logic?
Q. Which operation is not performed by computer
Q. Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.
Q. Which of the following uses multiple hard disk platters mounted on a single central shift?
Q. Sniffers can be deployed in
Q. Which of the following is / are types of Software Maintenance?
Q. The expression for Absorption law is given by
Q. The growing phase is a phase in which?
Q. In a normal n-bit adder, to find out if an overflow as occurred we make use of
Discusssion
Login to discuss.