Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

1 votes
0 answers
931
Gateforum Tests
User Avatar
2 votes
0 answers
933
SDT Compiler
User Avatar
3 votes
1 answer
934
Dynamic Scoping
How to solve any dynamic scoping question . Plz describe in detail.
How to solve any dynamic scoping question . Plz describe in detail.
User Avatar
2 votes
0 answers
936
Rank of node: dependacy graph
please describe in detail I have no idea how to find rank of the node?
please describe in detail I have no idea how to find rank of the node?
User Avatar
2 votes
1 answer
938
Compiler
Code optimization is in syllabus or not . like dead code elimination ..... loop inveriant
Code optimization is in syllabus or not .like dead code elimination ..... loop inveriant
User Avatar
1 votes
6 answers
939
The grammar G is
Consider the following grammar G: $S\rightarrow AB\mid d$ $A\rightarrow aA\mid b$ $B\rightarrow bB\mid c$ The grammar G is: LL (1) grammar and not LR (0) LL (1) and LR (0) Not LL (1) but LR (0) Neither LL (1) nor LR (0)
Consider the following grammar G:$S\rightarrow AB\mid d$$A\rightarrow aA\mid b$$B\rightarrow bB\mid c$The grammar G is:LL (1) grammar and not LR (0)LL (1) and LR (0)Not L...
User Avatar
1 votes
0 answers
940
doubt
Total number of states in LALR(1) parser i am getting 11 somone verify
Total number of states in LALR(1) parser i am getting 11 somone verify
User Avatar
1 votes
0 answers
941
test series
Number of states in LALR​​​​​​​(1
Number of states in LALR​​​​​​​(1
User Avatar
4 votes
1 answer
942
MOCK TEST compiler design
Consider the given below grammar S→ cAd A→ bA | aA | b If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
User Avatar
2 votes
0 answers
944
Compiler Syllabus
did we have to study static single assignments for gate 2018? is it a part of code optimization or intermediate code generation?
did we have to study static single assignments for gate 2018? is it a part of code optimization or intermediate code generation?
User Avatar
1 votes
8 answers
945
#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
Consider the following code segment:c=b+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...
User Avatar
2 votes
0 answers
946
gate forum test series
User Avatar
1 votes
2 answers
950
number of tokens
1) 8 2) 9 3) 12 4) 10
1) 82) 93) 124) 10
User Avatar
2 votes
0 answers
951
compiler sdt
consider the following schema shown below: P-->QRS Q-->Q+R {print(′*′);}R | S R--> R * R {print(′+′); } ε | S S--> Num { print (num.value) ;} | ε { print( ... 5 $' this translation schema will print: a) 2 3 * * 7 5 + $ b) 2 3 + 7 + 5 * $ c) 2 3 * 7 5 + * $
consider the following schema shown below:P >QRSQ >Q+R {print(′*′);}R | SR R * R {print(′+′); } ε | SS Num { print (num.value) ;} | ε { print($)}Here ‘num�...
User Avatar
1 votes
0 answers
952
Leaf node of the tree always have only inherited atrribute.
Leaf node of the tree always have only inherited atrribute. State true or false.
Leaf node of the tree always have only inherited atrribute.State true or false.
User Avatar
2 votes
0 answers
953
Number of nodes in a parse tree
......
......
User Avatar
3 votes
0 answers
954
Compiler
User Avatar
2 votes
1 answer
956
Lexeme and Token
A lexeme is an identifier for a token? True or False
A lexeme is an identifier for a token?True or False
User Avatar
3 votes
1 answer
958
COMPILER DESIGN
If operator precedence parser can parse ambiguous grammar so why don't we use this parser all the time, Why should we care about all the parsers just use this.
If operator precedence parser can parse ambiguous grammar so why don't we use this parser all the time, Why should we care about all the parsers just use this.
User Avatar
2 votes
3 answers
959
COMPILER DESIGN
Check whether this grammar is LL(1) or not?
Check whether this grammar is LL(1) or not?
User Avatar
1 votes
0 answers
960
Code Generation
Difference between assembly code generation and intermediate code generation lies in number of registers both of them used for intermediate results Which is more register and in which phase?
Difference between assembly code generation and intermediate code generation lies in number of registers both of them used for intermediate resultsWhich is more register ...
User Avatar
Page: