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

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. Which of the following regular expression is equivalent to R(1,0)?
R(1,0)={111*}*

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 is the task of lexical analysis?

View solution

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

View solution

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

View solution

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

View solution

Q. Which phase of compiler includes Lexical Analysis?

View solution

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

View solution

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

View solution

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

View solution

Q. The phase of compilation which involves type checking is:

View solution

Q. The scanner outputs:

View solution

Q. State true or false:
Statement: A lexical analyzer reads the source code line by line.

View solution

Q. The methodology to show an error when the analyzer faces a keyword over an user’s input is based on:

View solution

Q. If the lexical analyser finds a lexeme with the same name as that of a reserved word,it _________

View solution

Q. Lexemes can be referred to as:

View solution

Q. Which of the following does not support regular expressions?

View solution

Q. What does “X?” do regular expression operator?

View solution