NPTEL Online Certification Courses Indian
Institute of Technology Kharagpur
Compiler
DesignAssignment‐
Week 2
TYPE OF QUESTION:MCQ
Number ofquestions:13 Total mark: 13 X 1 = 13
1. A regular expression represents
a) Part of a language
b) Cannot represent any language
c) Constituent strings of a language
d) None of the other options
Ans: C) Constituent strings of a language
2. When expression sum=3+2 is tokenized then what is the token category of 3
a) Identifier
b) Assignment operator
c) Integer literal
d) Addition operator
Ans : c)
Explanation:
Lexeme
Token category
Sum “Identifier”
= “Assignment operator”
3 “Integer literal”
+ “Addition operator”
2 “Integer literal”
; “End of statement”
3. For the Fortran language statement “DO 5 I = 1.25” returns token IDENTIFIER for DO 5
I after looking upto
a) I
b) =
c) .
d) 5
Ans: C)
4. Which of the following are Lexemes?
a) Identifiers
b) Constants
c) Keywords
d) All of the mentioned
Ans : d) Explanation: Different Lexical Classes or Tokens or Lexemes Identifiers, Constants,
Keywords, Operators.
5.
A regular expression for accepting strings with exactly one 1 more than 0’s is
a) 0*1
b) (0|1)*1(0|1)*
c) (0|1)*1(0|1)*|1(0|1)*
d) Not Possible
Ans: d)
6.
Which one of the following languages over the alphabet {0,1} is described by the regular
expression: (0+1)*0(0+1)*0(0+1)*
a) The set of all strings containing the substring 00.
b) The set of all strings containing at most two 0’s.
c) The set of all strings containing at least two 0’s.
d) The set of all strings that begin and end with either 0 or 1.
Ans : C)Explanation: The regular expression has two 0′s surrounded by (0+1)* which means
accepted strings must have at least 2 0′s.
7.
Finite automata is an implementation of
a) Regular expression
b) Any grammar
c) Part of the regular expression
d) None of the other options
Ans: A)
8.
The automation which allows transformation to a new state without consuming any input
symbols:
a) NFA
b) DFA
c) Pushdown automata
d) All of the mentioned
Ans: A)
9.
The __________ of a set of states, P, of an NFA is defined as the set of states reachable from
any state in P following ε-transitions
a) ε-closure
b) ε-park
c) Q in the tuple
d) None of the mentioned
Ans: A) Explanation: The ε-closure of a set of states, P, of an NFAis defined as the set of states
reachable from any state in P following e-transitions.
10.
Between NFA and DFA which one is powerful
a) NFA
b) DFA
c) Equally powerful
d) Cannot be said definitely
Ans: c)
11.
Subset Construction method refers to
a) Conversion of NFA to DFA
b) DFA minimization
c) Eliminating null references
d) ε-NFA to NFA
Ans: A) Explanation: The conversion of a non-deterministic automata into a deterministic
one is a process we call subset construction or power set construction.
12.
Which of the following do we use to form an NFA from a regular expression
a) Subset construction method
b) Powerful set construction method
c) Thompson construction method
d) Scott construction method
Ans: C) Explanation: Thompson Construction method is used to turn a regular expression in
an NFA by fragmenting the given regular expression through the operations performed on the
input alphabets.
13.
A certain compiler corrects errors like “fi” to “if” automatically. This is an example of
recovery in
a) Panic mode
b) Delete character
c) Replace Character
d) Transpose character
Ans: D)
END of Assignment
