Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Compiler Design:
Recent questions tagged compiler-design
0
votes
2
answers
1261
made easy test series
Vineeta Garg
411
views
Vineeta Garg
asked
Feb 5, 2017
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
numerical-answers
made-easy-test-series
+
–
0
votes
0
answers
1262
GateForum Mock Test
The given answer is A) but option A) produces the string "ab" which is not produced by the above grammar so how can the answer be A) ?
The given answer is A) but option A) produces the string "ab" which is not produced by the above grammar so how can the answer be A) ?
Harsh181996
332
views
Harsh181996
asked
Feb 5, 2017
Compiler Design
gateforum-test-series
compiler-design
+
–
1
votes
0
answers
1263
Self Doubt
If in the state table of a LR parser, in some row, we have more than one SR or RR conflict, then is it considered a single conflict? Reference:- https://gateoverflow.in/113114/slr-parsing-table#c113505
If in the state table of a LR parser, in some row, we have more than one SR or RR conflict, then is it considered a single conflict?Reference:- https://gateoverflow.in/11...
Samujjal Das
384
views
Samujjal Das
asked
Feb 4, 2017
Compiler Design
parsing
lr-parser
compiler-design
+
–
–1
votes
1
answer
1264
number of steps in derivation
iita
6.0k
views
iita
asked
Feb 3, 2017
Compiler Design
compiler-design
context-free-grammar
parsing
numerical-answers
test-series
+
–
1
votes
0
answers
1265
compiler-design parsing no of states
The number of states in SLR parser for G is _______. for this type of question , Do we consider augmented entry state like S'->S. ????
The number of states in SLR parser for G is _______.for this type of question , Do we consider augmented entry state like S'->S. ????
sanyam53
638
views
sanyam53
asked
Feb 3, 2017
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
1266
YACC-
in case of shift-reduce and R-R conflict, which is favored by YACC?
in case of shift-reduce and R-R conflict, which is favored by YACC?
Aboveallplayer
472
views
Aboveallplayer
asked
Feb 3, 2017
Compiler Design
compiler-design
parsing
lr-parser
descriptive
+
–
1
votes
2
answers
1267
PARSING
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
ARE NUMBER OF SHIFT ENTRIES / ACTIONS IN PARSING TABLE OF SLR(1) AND LALR(1) SAME ALWAYS??
sushmita
2.6k
views
sushmita
asked
Feb 3, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
+
–
0
votes
1
answer
1268
compiler design important topics?
I have only one day remaining, I haven't done anything of Compiler Design, what topic should I do?
I have only one day remaining, I haven't done anything of Compiler Design, what topic should I do?
PieChuckerr
1.8k
views
PieChuckerr
asked
Feb 2, 2017
Compiler Design
compiler-design
descriptive
+
–
1
votes
1
answer
1269
MadeEasy Subject Test: Compiler Design - Parsing
vaishali jhalani
503
views
vaishali jhalani
asked
Feb 2, 2017
Compiler Design
made-easy-test-series
compiler-design
parsing
+
–
0
votes
1
answer
1270
Compiler design
G : Grammar S1 : Every LALR(1) G is LR(1). S2 : Every LR(1) G is LALR(1). S3: Some LL(1) is Regular. A. TFF B.TFT C. TTF D. FTT E. NONE
G : GrammarS1 : Every LALR(1) G is LR(1).S2 : Every LR(1) G is LALR(1).S3: Some LL(1) is Regular.A. TFF B.TFT C. TTF D. FTT E. NONE
parthbkgadoya
310
views
parthbkgadoya
asked
Feb 1, 2017
Compiler Design
compiler-design
parsing
lr-parser
+
–
2
votes
1
answer
1271
Remove Left recursion from context free grammer
rahuldb
1.9k
views
rahuldb
asked
Jan 31, 2017
Compiler Design
compiler-design
grammar
left-recursion
recurrence-relation
test-series
+
–
0
votes
1
answer
1272
Construct LL(1) Parsing table for the following grammar
rahuldb
4.8k
views
rahuldb
asked
Jan 31, 2017
Compiler Design
compiler-design
parsing
grammar
ll-parser
theory-of-computation
test-series
+
–
0
votes
2
answers
1273
SLR Parsing Table
Consider the grammar- $S \rightarrow BB$ $B \rightarrow aB/bB/a/b$ How many shift-reduce conflicts will occur when we try to make SLR parsing table for the above grammar? A. 0 B. 1 C. 2 D. None
Consider the grammar-$S \rightarrow BB$$B \rightarrow aB/bB/a/b$How many shift-reduce conflicts will occur when we try to make SLR parsing table for the above grammar?A. ...
Samujjal Das
1.9k
views
Samujjal Das
asked
Jan 29, 2017
Compiler Design
parsing
compiler-design
+
–
1
votes
1
answer
1274
Shift register
I feel answer is 70 in hexadecimal.need confirmation?
I feel answer is 70 in hexadecimal.need confirmation?
reena_kandari
601
views
reena_kandari
asked
Jan 29, 2017
Digital Logic
digital-logic
compiler-design
+
–
0
votes
1
answer
1275
MADE EASY_COMPILER
Which of the following is correct? a. One of the purposes of using intermediate code in compilers is to improve the register allocation. b. Leaf node of the tree always have only inherited attribute. c. The difference between assembly code generation ... used by both of them to hold the intermediate results. d. The output of intermediate code generation is machine dependent.
Which of the following is correct?a. One of the purposes of using intermediate code in compilers is to improve the register allocation. b. Leaf node of the tree always ha...
cse23
1.6k
views
cse23
asked
Jan 28, 2017
Compiler Design
compiler-design
intermediate-code
register-allocation
descriptive
made-easy-booklet
+
–
0
votes
1
answer
1276
MadeEasy Subject Test: Compiler Design - Parsing
First(P) = {+, *, t, epsilon, id} AND Follow(P) = {dollar,id} according to me. In that case M[P, DOLLAR] should have P -> QR
First(P) = {+, *, t, epsilon, id} AND Follow(P) = {dollar,id} according to me. In that case M[P, DOLLAR] should have P - QR
sidsunny
372
views
sidsunny
asked
Jan 26, 2017
Compiler Design
made-easy-test-series
compiler-design
parsing
ll-parser
+
–
0
votes
1
answer
1277
testbook compiler
focus _GATE
503
views
focus _GATE
asked
Jan 25, 2017
Compiler Design
compiler-design
parsing
first-and-follow
testbook-test-series
+
–
0
votes
3
answers
1278
Compiler
Compiler
Compiler
Deepak Yadav
532
views
Deepak Yadav
asked
Jan 25, 2017
Compiler Design
compiler-design
parsing
first-and-follow
+
–
1
votes
5
answers
1279
Test by Bikram | Mock GATE | Test 2 | Question: 38
$S\rightarrow A0 B$ $A\rightarrow BB \mid 0$ $B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is _______.
$S\rightarrow A0 B$$A\rightarrow BB \mid 0$$B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is ____...
Bikram
714
views
Bikram
asked
Jan 24, 2017
Compiler Design
tbb-mockgate-2
numerical-answers
compiler-design
theory-of-computation
context-free-grammar
+
–
5
votes
1
answer
1280
Test by Bikram | Mock GATE | Test 2 | Question: 14
Consider the following code snippet. void first(int p, int t) { p += t; t += p; } main() { int p = 4; first(p , p); } What is the final value of $p$ in both call by value and call by reference respectively ? $4$ and $12$ $5$ and $12$ $12$ and $16$ $4$ and $16$
Consider the following code snippet.void first(int p, int t) { p += t; t += p; } main() { int p = 4; first(p , p); }What is the final value of $p$ in both call by value a...
Bikram
481
views
Bikram
asked
Jan 24, 2017
Compiler Design
tbb-mockgate-2
compiler-design
parameter-passing
runtime-environment
+
–
2
votes
3
answers
1281
Compiler Design(gATE 2010)
GATE 2010 Question The grammar S→aSa∣bS∣c is LL(1) but not LR(1) LR(1) but not LL(1) Both LL(1) and LR(1) Neither LL(1) nor LR(1) I have 2 small doubt First Doubt:-If a grammer is LL(1) then it is always LR(0) ? Is there any grammer which is LL( ... ,LL(1) LR(0) SLR(1) LALR(1) CLR(1).So what is the difference between LR(0) AND LR(1) and which one is more powerfull ?
GATE 2010 QuestionThe grammar S→aSa∣bS∣c is LL(1) but not LR(1)LR(1) but not LL(1)Both LL(1) and LR(1)Neither LL(1) nor LR(1)I have 2 small doubtFirst Doubt:-If a g...
Himanshu Goyal
2.3k
views
Himanshu Goyal
asked
Jan 23, 2017
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
1282
What to study in code optimization?..Please list the topics
Please can anyone list the topics to study in this part. The syllabus only states basics of code generation and optimization. Anyone who had prepared gate earlier. What did you study?
Please can anyone list the topics to study in this part. The syllabus only states basics of code generation and optimization. Anyone who had prepared gate earlier. What d...
Tridhara Chakrabarti
1.3k
views
Tridhara Chakrabarti
asked
Jan 23, 2017
Compiler Design
compiler-design
code-optimization
target-code-generation
intermediate-code
+
–
0
votes
2
answers
1283
Doubts
An umambiguous grammar has same right most and left most derivation>?? True or false.?
An umambiguous grammar has same right most and left most derivation>??True or false.?
Ravi_1511
653
views
Ravi_1511
asked
Jan 23, 2017
Compiler Design
parsing
compiler-design
+
–
0
votes
1
answer
1284
doubt CD
Prateek kumar
250
views
Prateek kumar
asked
Jan 22, 2017
Compiler Design
compiler-design
grammar
numerical-answers
test-series
+
–
0
votes
1
answer
1285
DAG ace test question
How does answer change when it is in SSA form? does answer remains 4 or 5
How does answer change when it is in SSA form? does answer remains 4 or 5
thor
638
views
thor
asked
Jan 22, 2017
Compiler Design
compiler-design
code-optimization
directed-acyclic-graph
numerical-answers
ace-test-series
+
–
2
votes
2
answers
1286
Testbook Test Series: Compiler Design - Syntax Directed Translation
Let Grammar be with these transitions: S -> a{print "0"}A A -> b{print "1"}B A -> c{print "2"} A -> ε{print "-"} B -> d{print "1"}A B ... produced for input string abdbdc using Bottom-Up Parsing with above translations: A) 0211-10 B) 0211110 C) 0111-20 D) 0111012
Let Grammar be with these transitions:S - a{print "0"}AA - b{print "1"}BA - c{print "2"}A - ε{print "-"}B - d{print "1"}AB - ε{print "0"}What is the output produced for...
the.brahmin.guy
1.0k
views
the.brahmin.guy
asked
Jan 22, 2017
Compiler Design
syntax-directed-translation
testbook-test-series
compiler-design
+
–
3
votes
2
answers
1287
MadeEasy Subject Test: Compiler Design - Parsing
Consider the following grammar G: The number of states in SLR parser for G is _______. My question is since this grammar can't generate any string the number of states should be zero right as we will remove useless symbols before constructing canonical collection of LR(0) items
Consider the following grammar G: The number of states in SLR parser for G is _______.My question is since this gram...
Pankaj Joshi
949
views
Pankaj Joshi
asked
Jan 20, 2017
Compiler Design
made-easy-test-series
compiler-design
parsing
+
–
10
votes
2
answers
1288
Few doubts in compiler design
1. If a grammar is LL(1), then it has to be LALR(1).Is it correct?? 2. Is there anything called as LL(0)?? 3. Do every DCFL has LL(1) grammar?? 4. Do every DCFL has LR(1) grammar?? 5. Can someone please specify, As we can say ... is LL(1), what can we say for CFL,CSL,Recursive and RE?? 6. What is the difference between parse tree, syntax tree and abstract syntax tree?
1. If a grammar is LL(1), then it has to be LALR(1).Is it correct??2. Is there anything called as LL(0)??3. Do every DCFL has LL(1) grammar??4. Do every DCFL has LR(1) gr...
Lucky sunda
2.7k
views
Lucky sunda
asked
Jan 20, 2017
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
1289
compiler
ukn
387
views
ukn
asked
Jan 19, 2017
Compiler Design
compiler-design
grammar
operator-grammar
operator-precedence
ace-test-series
+
–
4
votes
0
answers
1290
compiler doubt
The number of tokens in the following expression is what? + * * * < = & > { - + + + } ( >> ) + & &
The number of tokens in the following expression is what?+ * * * < = & { - + + + } ( > ) + & &
Arnabi
546
views
Arnabi
asked
Jan 19, 2017
Compiler Design
compiler-design
+
–
Page:
« prev
1
...
38
39
40
41
42
43
44
45
46
47
48
...
68
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register