1
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
A
Removing left recursion alone
B
Factoring the grammar alone
C
Removing left recursion and factoring the grammar
D
None of the above
2
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
In a bottom-up evaluation of a syntax directed definition, inherited attributes can
A
always be evaluated
B
be evaluated only if the definition is L- attributed
C
be evaluated only if the definition has synthesized attributes
D
never be evaluated
3
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
The process of assigning load addresses to the various parts of the program and adjusting the code and date in the program to reflect the assigned addresses is called
A
Assembly
B
Parsing
C
Relocation
D
Symbol resolution
4
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements is false?
A
An unambiguous grammar has same leftmost and rightmost derivation
B
An LL(1) parser is a top-down parser
C
LALR is more powerful than SLR
D
An ambiguous grammar can never be LR(k) for any k
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP