Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

13 votes
2 answers
301
GATE CSE 2021 Set 1 | Question: 31
Consider the following context-free grammar where the set of terminals is $\{a,b,c,d,f\}$ ...
Consider the following context-free grammar where the set of terminals is $\{a,b,c,d,f\}$. $$\begin{array}{lll} \text{S} & \rightarrow & d \: a \: \text{T} \mid \text{R} ...
User Avatar
1 votes
3 answers
305
NIELIT Scientific Assistant A 2020 November: 52
In case of the dynamic programming approach the value of an optimal solution is computed in : Top down fashion Bottom up fashion Left to Right fashion Right to Left fashion
In case of the dynamic programming approach the value of an optimal solution is computed in :Top down fashionBottom up fashionLeft to Right fashionRight to Left fashion
User Avatar
1 votes
1 answer
306
NIELIT Scientific Assistant A 2020 November: 53
Which of the following is not true for tree and graph? A tree is a graph A graph is a tree Tree can have a cycle Tree is a $\text{DAG}$
Which of the following is not true for tree and graph?A tree is a graphA graph is a treeTree can have a cycleTree is a $\text{DAG}$
User Avatar
1 votes
1 answer
307
NIELIT Scientific Assistant A 2020 November: 66
Peephole optimization is a : Loop optimization Local optimization Constant folding Data flow analysis
Peephole optimization is a :Loop optimizationLocal optimizationConstant foldingData flow analysis
User Avatar
1 votes
1 answer
309
NIELIT Scientific Assistant A 2020 November: 69
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________. Shift-reduce conflict Shift-Shift conflict Both “Shift-reduce conflict” & “Shift-Shift conflict” None of the options
Type of conflicts that can arise in $\text{LR(0)}$ techniques are ________.Shift-reduce conflictShift-Shift conflictBoth “Shift-reduce conflict” & “Shift-Shift conf...
User Avatar
1 votes
1 answer
310
NIELIT Scientific Assistant A 2020 November: 94
Shift reduce parsing can also be called as: Reverse of the Right Most Derivation Right Most Derivation Left Most Derivation None of the options
Shift reduce parsing can also be called as:Reverse of the Right Most DerivationRight Most DerivationLeft Most DerivationNone of the options
User Avatar
1 votes
4 answers
312
NIELIT Scientific Assistant A 2020 November: 118
The $\text{LL(1)}$ and $\text{LR(0)}$ techniques are ___________ Both same in power Both simulate reverse of right most derivation Both simulate reverse of left most derivation Incomparable
The $\text{LL(1)}$ and $\text{LR(0)}$ techniques are ___________Both same in powerBoth simulate reverse of right most derivationBoth simulate reverse of left most derivat...
User Avatar
5 votes
1 answer
313
UGC NET CSE | October 2020 | Part 2 | Question: 30
Which of the following is not an intermediate code form? Syntax trees Three address codes Quadrupules Post fix Notation
Which of the following is not an intermediate code form?Syntax treesThree address codesQuadrupulesPost fix Notation
User Avatar
0 votes
2 answers
316
NIELIT 2016 MAR Scientist C - Section C: 9
Which of the following can be accessed by transfer vector approach of linking? External data segments External subroutines Data located in other procedure All of these
Which of the following can be accessed by transfer vector approach of linking?External data segmentsExternal subroutinesData located in other procedureAll of these
User Avatar
0 votes
2 answers
317
NIELIT 2016 MAR Scientist C - Section C: 10
Relocation bits used by relocating loader are specified by Relocating loader itself Linker Assembler Macro processor
Relocation bits used by relocating loader are specified byRelocating loader itselfLinkerAssemblerMacro processor
User Avatar
1 votes
1 answer
318
NIELIT 2016 MAR Scientist C - Section C: 11
The most powerful parser is $\text{SLR}$ $\text{LALR}$ Canonical $\text{LR}$ Operator-precedence
The most powerful parser is$\text{SLR}$$\text{LALR}$Canonical $\text{LR}$Operator-precedence
User Avatar
1 votes
1 answer
319
NIELIT 2016 MAR Scientist C - Section C: 12
$\text{YACC}$ builds up $\text{SLR}$ parsing table Canonical $\text{LR}$ parsing table $\text{LALR}$ parsing table None of these
$\text{YACC}$ builds up$\text{SLR}$ parsing tableCanonical $\text{LR}$ parsing table$\text{LALR}$ parsing tableNone of these
User Avatar
0 votes
6 answers
320
NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)
Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)
User Avatar
Page: