Q. A deterministic finite automation (DFA)D with alphabet ∑= {a,b} is given below.
Which of the following is a valid minimal DFA which accepts the same language as D?

View solution

Q. Construct a NDFA for the following regular expression :

(a∪b)*aba(a∪b)*

View solution

Q. Which is the correct NDFA for the following mentioned expression? (ab)*∪(aba)*.

View solution

Q. Which NDFA correctly represents the following RE :

a(bab)*∪a(ba)*

View solution

Q. Which of the lexical analyser can handle Unicode

View solution

Q. Which one is a lexer Generator

View solution

Q. Lexers are often generated by a lexer generator, same as parser generators,

View solution

Q. It has encoded within it information on the possible sequences of characters that can be contained within any of the tokens it handles .Above motioned function is performed by?

View solution

Q. Which grammar defines Lexical Syntax

View solution

Q. When expression sum=3+2 is tokenized then what is the token category of 3

View solution

Q. The process of forming tokens from an input stream of characters is called_____

View solution

Q. Which one is a type of Lexeme

View solution

Q. Lexical Analysis Identifies Different Lexical Units in a _______

View solution

Q. Lexical Analyser’s Output is given to Syntax Analysis.

View solution

Q. An individual token is called ________

View solution

Q. The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is

View solution

Q. Which of the following languages is/are regular?
L1: {wxwR ⎪ w, x ∈ {a, b}* and ⎪w⎪, ⎪x⎪ >0} wR is the reverse of string w

L2: {anbm ⎪m ≠ n and m, n≥0

L3: {apbqcr ⎪ p, q, r ≥ 0}

View solution

Q. Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X0.How are X1 and X2 are related ?
X0 = 1 X1

X1 = 0 X1 + 1 X2

X2 = 0 X1 + {λ}

Which one of the following represents the strings in X0?

View solution

Q. How many minimum states are required to find whether a string has odd number of 0’s or not

View solution

Q. The length of the shortest string NOT in the language (over Σ = {a, b}) of the following regular expression is _____________
a*b*(ba)*a*

View solution