Start
Q1
Question 1: NFA is easy to implement as compared to DFA.
Q2
Question 2: AST summarizes the grammatical structure with the details of derivations.
Q3
Question 3: The non-terminal __________ is left recursive.
Q4
Question 4: Left factoring is enough to make a grammar LL(1).
Q5
Question 5: Lexer and scanner are two different phases of compiler
Q6
Question 6: __________ of a two-pass compiler is consists of Instruction selection, Register allocation and Instruction scheduling.
Start
None of given
Front end
Back end
Q7
Question 7: In LL1() parsing algorithm __________ contains a sequence of grammar symbols.
Array
None
Link list
Stack
Q8
Question 8: Compilers are sometimes classified as.
Multi pass
All of the given
Single pass
Load and go
Q9
Question 9: In multi pass compiler during the first pass it gathers information about __________ .
None of the given
Static information
Bindings
Declaration
Q10
Question 10: __________avoid hardware stalls and interlocks.
None of given
Instruction scheduling
Instruction selection
Register allocation