Q. Which of the following languages have built in regexps support?

View solution

Q. The following is/are an approach to process a regexp:

View solution

Q. Are the given two patterns equivalent?
(1) gray|grey

(2) gr(a|e)y

View solution

Q. Which of the following are not quantifiers?

View solution

Q. Which of the following cannot be used to decide whether and how a given regexp matches a string:

View solution

Q. Conversion of a regular expression into its corresponding NFA :

View solution

Q. Which among the following is not a UNIX command for regular expressions?

View solution

Q. What is the significance of $ used in regular expression in UNIX?

View solution

Q. Generate the regular expression to match blank lines

View solution

Q. For the given syntax of sed, which among the following is not a correct option?
General syntax of sed: /pattern/action

View solution

Q. What does grep do in UNIX?

View solution

Q. State true or false:
Statement: A regular expression is a sequence of characters that represent a pattern.

View solution

Q. Which of the following options support the given statement?
Statement: A regular expression could be a fixed word or describe something like more general.

View solution

Q. What does the following segment of code does?
grep -i man heroes.txt

View solution

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

View solution

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

View solution

Q. Lexemes can be referred to as:

View solution

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

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. State true or false:
Statement: A lexical analyzer reads the source code line by line.

View solution