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
1
answer
1141
Ace Test Series: Compiler Design - Parsing
S -> Aa A -> Ab A -> c Which of the following item is present in LR(1) item with S' -> .S, $\$ ? A) A -> .Ab, $\$ B) A -> .c, $\$ C) A -> .Ab, a/b D) None
S - AaA - AbA - cWhich of the following item is present in LR(1) item with S' - .S, $\$$ ?A) A - .Ab, $\$$B) A - .c, $\$$C) A - .Ab, a/bD) None
Aibi
712
views
Aibi
asked
Sep 22, 2017
Compiler Design
compiler-design
ace-test-series
parsing
lr-parser
+
–
0
votes
1
answer
1142
Syllabus
in syntax directed translation top down translation is in syllabus?
in syntax directed translation top down translation is in syllabus?
sachin!
211
views
sachin!
asked
Sep 20, 2017
Compiler Design
compiler-design
syntax-directed-translation
descriptive
+
–
0
votes
0
answers
1143
TRUE/FALSE
1) For Bottom-up implementation of L-attributed definition all the semantic actions must be at the end of productions(Postfix SDT). I think it is true because for BU implementation of L-attributed definition it must be based on LL(1) grammar.and we can convert ... then we will get different outputs during BU and TD parsing and this case is not desired in SDT. please share your views.
1) For Bottom-up implementation of L-attributed definition all the semantic actions must be at the end of productions(Postfix SDT).I think it is true because for BU imple...
reena_kandari
540
views
reena_kandari
asked
Sep 19, 2017
Compiler Design
compiler-design
syntax-directed-translation
+
–
0
votes
5
answers
1144
Operator Precedence
In Operator precedence parsing, precedence relations are defined, i. for all pair of non-terminals. ii. for all pair of terminals. iii. to delimit the handle. iv. only for certain pair of terminals.
In Operator precedence parsing, precedence relations are defined,i. for all pair of non-terminals.ii. for all pair of terminals.iii. to delimit the handle.iv. only for ce...
AnilGoudar
2.1k
views
AnilGoudar
asked
Sep 18, 2017
Compiler Design
compiler-design
operator-grammar
+
–
1
votes
2
answers
1145
parsing
S---->AaAb /BbBa A---->epsilon B------->epsilon check whether grammar is LL(1),LR(0) OR SLR(1)
S >AaAb /BbBaA >epsilonB ->epsiloncheck whether grammar is LL(1),LR(0) OR SLR(1)
set2018
2.9k
views
set2018
asked
Sep 17, 2017
Compiler Design
parsing
compiler-design
+
–
1
votes
2
answers
1146
left recursion
Parshu gate
1.2k
views
Parshu gate
asked
Sep 17, 2017
Theory of Computation
compiler-design
left-recursion
grammar
parsing
+
–
0
votes
1
answer
1147
UGC NET CSE | December 2009 | Part 2 | Question: 35
Synthesized attribute can be easily simulated by a (A) LL grammar (B) Ambiguous grammar (C) LR grammar (D) None of the above
Synthesized attribute can be easily simulated by a(A) LL grammar(B) Ambiguous grammar(C) LR grammar(D) None of the above
rishu_darkshadow
1.3k
views
rishu_darkshadow
asked
Sep 17, 2017
Compiler Design
ugcnetcse-dec2009-paper2
compiler-design
grammar
+
–
1
votes
0
answers
1148
UGC NET CSE | December 2009 | Part 2 | Question: 33
A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar. S --> x x W [ print “1”] S --> y [print “2”] W --> S2 [print “3”], what is the translation of “x x x x y z z” ? (A) 1 1 2 3 1 (B) 1 1 2 3 3 (C) 2 3 1 3 1 (D) 2 3 3 2 1
A shift-reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of the grammar.S x x W [ print “1”]S ...
rishu_darkshadow
2.0k
views
rishu_darkshadow
asked
Sep 17, 2017
Compiler Design
ugcnetcse-dec2009-paper2
compiler-design
parsing
+
–
1
votes
0
answers
1149
UGC NET CSE | December 2009 | Part 2 | Question: 32
Which of the following grammar is LR (1) ? (A) A --> a A b, A --> b A b, A --> a , A --> b (B) A --> a A a, A --> a A b, A --> c (C) A --> A + A, A --> a (D) Both (A) and (B)
Which of the following grammar is LR (1) ?(A) A a A b, A b A b, A a , A b(B) A a A a, A a A b, A c(C) A A + A, A a(D) Both (A) and (B)
rishu_darkshadow
1.7k
views
rishu_darkshadow
asked
Sep 17, 2017
Compiler Design
ugcnetcse-dec2009-paper2
compiler-design
grammar
+
–
0
votes
0
answers
1150
Bootstrapping in Compilers
Pls. Explain Bootstrapping in Compilers (in detail) & what are the advantages of it ?
Pls. Explain Bootstrapping in Compilers (in detail) & what are the advantages of it ?
yogi_p
434
views
yogi_p
asked
Sep 17, 2017
Compiler Design
compiler-design
+
–
0
votes
0
answers
1151
Syntax directed translation
Parshu gate
405
views
Parshu gate
asked
Sep 16, 2017
Compiler Design
compiler-design
syntax-directed-translation
+
–
0
votes
2
answers
1152
Operator Grammar
Given an Operator Grammar as, E -> E*F / F+E / F F -> F-F / id How to determine associativity in this case? Since Operator grammar can be ambiguous also. Is the above question solved using associativity and precedence of operators we consider in C programming? or it is Different.
Given an Operator Grammar as,E - E*F / F+E / FF - F-F / idHow to determine associativity in this case? Since Operator grammar can be ambiguous also.Is the above question ...
AnilGoudar
2.9k
views
AnilGoudar
asked
Sep 15, 2017
Compiler Design
grammar
compiler-design
operator-grammar
+
–
1
votes
1
answer
1153
Tokens and lexems
What is difference between lexems and tokens please explain with example
What is difference between lexems and tokens please explain with example
Swami patil
1.4k
views
Swami patil
asked
Sep 13, 2017
Compiler Design
compiler-design
compiler-tokenization
descriptive
+
–
1
votes
2
answers
1154
static single assignment form
Consider the following code segment a= b - c d = a + d a = d + e d = c * f d = a * d the min number of total variables required to convert the above code segment to static single assignment form is _____________
Consider the following code segmenta= b - cd = a + da = d + ed = c * fd = a * dthe min number of total variables required to convert the above code segment to static sing...
A_i_$_h
575
views
A_i_$_h
asked
Sep 7, 2017
Compiler Design
compiler-design
code-optimization
static-single-assignment
numerical-answers
+
–
0
votes
1
answer
1155
LEft recurssion
E -> E+T / T T -> id grammar after left recursion is a) E->T +E / T T ->id b)E ->T / E + T T ->id c) E->E' T T->+TE' / epsilon d)E ->TX X- > +TX / epsilon Actually it should be option c... ... T E'..the position of E and T is interchanged.in the option..........is that a pproblem??? the answer is given as option D can someone please help
E - E+T / TT - idgrammar after left recursion isa) E->T +E / T T ->idb)E ->T / E + TT ->idc) E->E' TT->+TE' / epsilond)E ->TXX- +TX / epsilonActually i...
A_i_$_h
331
views
A_i_$_h
asked
Sep 7, 2017
Compiler Design
compiler-design
parsing
left-recursion
descriptive
+
–
0
votes
1
answer
1156
please solve my doubt
Q. Consider the following CFG. E → E ∗ T | T+E | T T → (T ∗ F) | F F → id Can we generate following string (id∗id∗id)
Q. Consider the following CFG.E → E ∗ T | T+E | TT → (T ∗ F) | FF → idCan we generate following string(id∗id∗id)
kallu singh
201
views
kallu singh
asked
Sep 6, 2017
Compiler Design
compiler-design
context-free-grammar
parsing
descriptive
+
–
0
votes
1
answer
1157
Geeksforgeeks quiz
Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations and P be the number of parse trees. Assume l , r and P are computed for a particular string. For a given CFG ‘G’ and given string ‘w’, what is the relation between l , P , r ? A l ≤ P ≥ r B l = P = r C l ≥ P ≤ r D none of these
Let G be the CFG, l be the number of left most derivations, r be the number of right most derivations and P be the number of parse trees. Assume l , r and P are computed ...
ARUN KUMAR 3
1.4k
views
ARUN KUMAR 3
asked
Sep 6, 2017
Compiler Design
compiler-design
context-free-grammar
parsing
geeksforgeeks-test-series
+
–
8
votes
2
answers
1158
Ace Test Series 2018: Compiler Design - Parsing
Consider the following context-free grammar S → SS + | SS*| a It is a)LL(1) b)LR(0) c)Both d)none
Consider the following context-free grammarS → SS + | SS*| aIt isa)LL(1)b)LR(0)c)Bothd)none
smelly indian
1.8k
views
smelly indian
asked
Sep 6, 2017
Compiler Design
theory-of-computation
ace-test-series
compiler-design
parsing
lr-parser
ll-parser
+
–
1
votes
1
answer
1159
Compiler
Out of LL(2) and LR(1) which is more powerful?
Out of LL(2) and LR(1) which is more powerful?
VS
376
views
VS
asked
Sep 6, 2017
Compiler Design
compiler-design
parsing
+
–
2
votes
2
answers
1160
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
kallu singh
637
views
kallu singh
asked
Sep 5, 2017
Compiler Design
compiler-design
parsing
ll-parser
lr-parser
true-false
+
–
2
votes
1
answer
1161
please solve this Q
Q. Which of the following parameter is not included in the activation record of recursive function call? 1.Local variables of function 2.Return value of function 3. Global variables of program 4.Access link
Q. Which of the following parameter is not included in the activation record of recursive function call?1.Local variables of function2.Return value of function3. Global v...
kallu singh
4.6k
views
kallu singh
asked
Sep 5, 2017
Compiler Design
compiler-design
runtime-environment
+
–
1
votes
1
answer
1162
please solve This Q
Q. Consider the following grammar : 1. S → XYX 2. X → Yc 3. X → sX 4. X → ε 5. Y → eX Find the first and follow
Q. Consider the following grammar :1. S → XYX 2. X → Yc3. X → sX 4. X → ε5. Y → eXFind the first an...
kallu singh
380
views
kallu singh
asked
Sep 5, 2017
Compiler Design
compiler-design
parsing
first-and-follow
descriptive
+
–
1
votes
2
answers
1163
Evaluating SDT
Here a as well as c can be the answer based on the construction of the parse tree. So how to decide which one to choose?
Here a as well as c can be the answer based on the construction of the parse tree. So how to decide which one to choose?
Xylene
676
views
Xylene
asked
Sep 4, 2017
Compiler Design
compiler-design
syntax-directed-translation
made-easy-booklet
+
–
1
votes
0
answers
1164
Language generated by this grammar
S -> AS / b A -> SA / a
S - AS / bA - SA / a
Xylene
254
views
Xylene
asked
Sep 2, 2017
Compiler Design
theory-of-computation
compiler-design
+
–
3
votes
1
answer
1165
Compiler Design
The action of parsing the source program into the proper syntactic classes is known as 1. Lexical Analysis 2. Syntax Analysis 3. Interpretation Analysis 4. Parsing
The action of parsing the source program into the proper syntactic classes is known as1. Lexical Analysis2. Syntax Analysis3. Interpretation Analysis4. Parsing
nishant279
2.6k
views
nishant279
asked
Aug 31, 2017
Compiler Design
compiler-design
lexical-analysis
+
–
1
votes
2
answers
1166
LookAhead Symbol in LALR and CLR Parsers.
I am confused in following kinds of Grammar they are;- 1) S - > AB A -> Ba B -> Bb B - > c 2) S - > AB A -> Ba B -> Bb B - > Epsilon 3) S - > AB A -> Ba B -> Bb B - > dollar what ... as look ahead symbol.
I am confused in following kinds of Grammar they are;-1) S - AB A - Ba B - Bb B - c2) S - AB A - Ba B - Bb B - Epsilon3) S - AB A - Ba B - Bb...
Shubhanshu
4.6k
views
Shubhanshu
asked
Aug 30, 2017
Compiler Design
compiler-design
parsing
+
–
0
votes
1
answer
1167
Parsing
Which of the following is not LR(1)? a. S->Uab|Vac U->d V->d b. S->Uab|Vab|Vac U->d V->d c.S->AB A->a B->b d. A->Ab A->a|c Please Explain.
Which of the following is not LR(1)?a. S->Uab|VacU->dV->db. S->Uab|Vab|VacU->dV->dc.S->ABA->aB->bd. A->AbA->a|cPlease Explain.
nishant279
487
views
nishant279
asked
Aug 30, 2017
Compiler Design
compiler-design
parsing
lr-parser
+
–
1
votes
1
answer
1168
3 address representation
In 3 address code format can LHS be repeated ? For eg if we have expression a + b*c then t1 = a t2 = b*c t1 = t1 + t2 or t3 = t1 + t2 which one is correct?
In 3 address code format can LHS be repeated ?For eg if we have expression a + b*c then t1 = a t2 = b*c t1 = t1 + t2 or t3 = t1 + t2 which one is correct?
Xylene
368
views
Xylene
asked
Aug 29, 2017
Compiler Design
compiler-design
intermediate-code
three-address-code
descriptive
+
–
3
votes
1
answer
1169
Identify Tokens
Calculate total no of Tokens and also determine there types:- a) a9997.7b884.cddf2.77 b) 74>><<2gfh0012 c) a>=ab.785!lklk d) a9997.b884.100intcddfloat2.77 Q2) Differentiate between Tokens, Lexeme and Pattern with the help of example Eg. int a;
Calculate total no of Tokens and also determine there types:-a) a9997.7b884.cddf2.77b) 74>><<2gfh0012c) a>=ab.785!lklkd) a9997.b884.100intcddfloat2.77Q2) Differentia...
Shubhanshu
574
views
Shubhanshu
asked
Aug 29, 2017
Compiler Design
compiler-design
compiler-tokenization
+
–
0
votes
0
answers
1170
general doubt
If a non deterministic CFL is not inherently ambiguous can it be parsed by some LR(1) parser??
If a non deterministic CFL is not inherently ambiguous can it be parsed by some LR(1) parser??
sushmita
252
views
sushmita
asked
Aug 27, 2017
Compiler Design
compiler-design
parsing
+
–
Page:
« prev
1
...
34
35
36
37
38
39
40
41
42
43
44
...
68
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register