Question
a.
True
b.
False
c.
May be
d.
Can't say
Posted under Compiler Design
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Lexers are often generated by a lexer generator, same as parser generators,
Similar Questions
Discover Related MCQs
Q. Which one is a lexer Generator
View solution
Q. Which of the lexical analyser can handle Unicode
View solution
Q. Which NDFA correctly represents the following RE :
a(bab)*∪a(ba)*
View solution
Q. Which is the correct NDFA for the following mentioned expression? (ab)*∪(aba)*.
View solution
Q. Construct a NDFA for the following regular expression :
(a∪b)*aba(a∪b)*
View solution
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. What is the complement of the language accepted by the NFA shown below? Assume ∑ = {a} and ε is the empty string.
View solution
Q. Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. Complete the partially completed DFA that accepts this language is shown below. The missing arcs in the DFA are
View solution
Q. Convert the NFA to DFA
View solution
Q. Examine the following DFA: If input is 011100101, which edge is NOT traversed?
View solution
Q. If string s is accepted by this DFA, which of these strings cannot be suffix of s?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Compiler Design? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
