Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Compiler Design:
Recent questions tagged compiler-design
10
votes
2
answers
301
GATE CSE 2021 Set 1 | Question: 5
Consider the following statements. $S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$. $S_2:$ For any context-free grammar, there is a parser that takes at most $O(n^3)$ time to parse a ... false $S_1$ is false and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
Consider the following statements.$S_1:$ Every $\text{SLR(1)}$ grammar is unambiguous but there are certain unambiguous grammars that are not $\text{SLR(1)}$.$S_2:$ For a...
Arjun
7.9k
views
Arjun
asked
Feb 18, 2021
Compiler Design
gatecse-2021-set1
compiler-design
lr-parser
1-mark
+
–
18
votes
3
answers
302
GATE CSE 2021 Set 1 | Question: 26
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ ... used to type-check syntactically correct boolean variable declarations and boolean expressions. The actions will lead to an infinite loop
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ acti...
Arjun
10.5k
views
Arjun
asked
Feb 18, 2021
Compiler Design
gatecse-2021-set1
compiler-design
syntax-directed-translation
2-marks
+
–
13
votes
2
answers
303
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} ...
Arjun
6.4k
views
Arjun
asked
Feb 18, 2021
Compiler Design
gatecse-2021-set1
compiler-design
grammar
2-marks
+
–
12
votes
4
answers
304
GATE CSE 2021 Set 1 | Question: 50
Consider the following $C$ code segment: a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f; In a compiler, this code segment is represented internally as a directed acyclic graph $\text{(DAG)}$. The number of nodes in the $\text{DAG}$ is _____________
Consider the following $C$ code segment:a = b + c; e = a + 1; d = b + c; f = d + 1; g = e + f;In a compiler, this code segment is represented internally as a directed acy...
Arjun
10.5k
views
Arjun
asked
Feb 18, 2021
Compiler Design
gatecse-2021-set1
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
2-marks
+
–
1
votes
1
answer
305
NIELIT Scientific Assistant A 2020 November: 46
Assume that the $\text{SLR}$ parser for a grammar $\text{G}$ has $n_{1}$ states and the $\text{LALR}$ parser for $\text{G}$ has $n_{2}$ states. The relationship between $n_{1}$ and $n_{2}$ is : $n_{1}$ is necessarily less than $n_{2}$ $n_{1}$ is necessarily equal to $n_{2}$ $n_{1}$ is necessarily greater than $n_{2}$ none of the options
Assume that the $\text{SLR}$ parser for a grammar $\text{G}$ has $n_{1}$ states and the $\text{LALR}$ parser for $\text{G}$ has $n_{2}$ states. The relationship between $...
gatecse
405
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
parsing
+
–
1
votes
1
answer
306
NIELIT Scientific Assistant A 2020 November: 50
Some code optimizations are carried out on the intermediate code because: they enhance the portability of the compiler to other target processors program analysis is more accurate on intermediate code than on machine code the ... cannot otherwise be used for optimization the information from the front end cannot otherwise be used for optimization
Some code optimizations are carried out on the intermediate code because:they enhance the portability of the compiler to other target processorsprogram analysis is more a...
gatecse
601
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
normal
+
–
1
votes
3
answers
307
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
gatecse
669
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
dynamic-programming
+
–
1
votes
1
answer
308
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}$
gatecse
447
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
directed-acyclic-graph
+
–
1
votes
1
answer
309
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
gatecse
457
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
code-optimization
+
–
1
votes
1
answer
310
NIELIT Scientific Assistant A 2020 November: 67
Which one of the following statements is $\text{FALSE}$? Context-free grammar can be used to specify both lexical and syntax rules. Type checking is done before parsing High level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
Which one of the following statements is $\text{FALSE}$?Context-free grammar can be used to specify both lexical and syntax rules.Type checking is done before parsingHigh...
gatecse
422
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
easy
compilation-phase
+
–
1
votes
1
answer
311
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...
gatecse
406
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
parsing
+
–
1
votes
1
answer
312
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
gatecse
424
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
parsing
lr-parser
+
–
2
votes
2
answers
313
NIELIT Scientific Assistant A 2020 November: 100
The number of tokens in the following C/C++ statement is : printf("i=%d, &i=%xx", i&i); $9$ $6$ $10$ $12$
The number of tokens in the following C/C++ statement is :printf("i=%d, &i=%xx", i&i);$9$$6$$10$$12$
gatecse
602
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
lexical-analysis
compiler-tokenization
+
–
1
votes
4
answers
314
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...
gatecse
1.1k
views
gatecse
asked
Dec 9, 2020
Compiler Design
nielit-sta-2020
compiler-design
parsing
+
–
5
votes
1
answer
315
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
go_editor
7.6k
views
go_editor
asked
Nov 20, 2020
Compiler Design
ugcnetcse-oct2020-paper2
compiler-design
intermediate-code
+
–
3
votes
1
answer
316
UGC NET CSE | October 2020 | Part 2 | Question: 41
Which of the following are applications of symbol table? Storage allocation Checking type compatibility Suppressing duplicate error messages Choose the correct answer from the options given below: $\text{(i)}$ and $\text{(ii)}$ only $\text{(i)}$ and $\text{(iii)}$ only ... $\text{(iii)}$ only $\text{(i)}$ $\text{(ii)}$ and $\text{(iii)}$
Which of the following are applications of symbol table?Storage allocationChecking type compatibilitySuppressing duplicate error messagesChoose the correct answer from th...
go_editor
2.4k
views
go_editor
asked
Nov 20, 2020
Compiler Design
ugcnetcse-oct2020-paper2
compiler-design
symbol-table
+
–
3
votes
1
answer
317
UGC NET CSE | October 2020 | Part 2 | Question: 74
Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$. $001$ $010$ $011$ $0001$ $0101$ Choose the correct answer from the options given below: $001 < 010 < 011 < 0001 < 0101$ ... $0001 < 0101 < 001 < 010 < 011$ $001 < 010 < 0001 < 0101 < 011$
Find the lexicographic ordering of the bit strings given below based on the ordering $0<1$.$001$$010$$011$$0001$$0101$Choose the correct answer from the options given bel...
go_editor
1.7k
views
go_editor
asked
Nov 20, 2020
Compiler Design
ugcnetcse-oct2020-paper2
compiler-design
+
–
0
votes
2
answers
318
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
admin
880
views
admin
asked
Apr 2, 2020
Compiler Design
nielit2016mar-scientistc
compiler-design
+
–
0
votes
2
answers
319
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
admin
1.0k
views
admin
asked
Apr 2, 2020
Compiler Design
nielit2016mar-scientistc
compiler-design
+
–
1
votes
1
answer
320
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
admin
1.7k
views
admin
asked
Apr 2, 2020
Compiler Design
nielit2016mar-scientistc
compiler-design
parsing
+
–
Page:
« prev
1
...
6
7
8
9
10
11
12
13
14
15
16
...
68
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register