Q. Which among the following is not a tool to construct lexical analyzer from a regular expression?

View solution

Q. A program that performs lexical analysis is termed as:

View solution

Q. Lexers and parsers are not found in which of the following?

View solution

Q. Which phase of compiler includes Lexical Analysis?

View solution

Q. Which of the following characters are ignored while lexical analysis?

View solution

Q. ____________ is used for grouping up of characters into token.

View solution

Q. The action of parsing the source code into proper syntactic classes is known as:

View solution

Q. Which of the following is the task of lexical analysis?

View solution

Q. The minimum length of a string {0,1}* not in the language corresponding to the given regular expression:
(0*+1*)(0*+1*)(0*+1*)

View solution

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

View solution

Q. The minimum number of 1’s to be used in a regular expression of the given language:
R(x): The language of all strings containing exactly 2 zeroes.

View solution

Q. The given regular language corresponds to which of the given regular language
e+1+(1+0)*0+(0+1)*11

View solution

Q. Statement: If we take the union of two identical expression, we can replace them by one copy of the expression.
Which of the following is a correct option for the given statement?

View solution

Q. Which among the following can be an annihilator for multiplication operation?

View solution

Q. Statement: A digit, when used in the CFG notation, will always be used as a terminal.
State true or false?

View solution

Q. Choose the incorrect process to check whether the string belongs to the language of certain variable or not?

View solution

Q. Statement: Left most derivations are lengthy as compared to Right most derivations.
Choose the correct option:

View solution

Q. A->aAa|bAb|a|b|e
Which among the following is the correct option for the given production?

View solution