Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

0 votes
1 answer
31
Compilers: Principles, Techniques, and Tools by ALFRED Aho
Find the minimum number of total variables in SSA form: a = b + m m = a + e d = b + m b = a + e
Find the minimum number of total variables in SSA form:a = b + mm = a + ed = b + mb = a + e
User Avatar
0 votes
1 answer
33
Made Easy Test Series Question
Consider the following C code: d=a+b e=a-b f=c+d g=c-e a=f+g b=f-g c=d+e The minimum number of total variables required to convert the above code segment to static single assignment form is? Ans given is 7 but how
Consider the following C code:d=a+be=a-bf=c+dg=c-ea=f+gb=f-gc=d+eThe minimum number of total variables required to convert the above code segment to static single assignm...
User Avatar
0 votes
1 answer
34
Compiler Design
Like Example Above please answer this question Q5. Implement a+b*(c+d)-e/f into: a). Quadruples. b). Triples. c). Indirect triples.
Like Example Above please answer this questionQ5. Implement a+b*(c+d)-e/finto: a). Quadruples.b). Triples.c). Indirect triples.
User Avatar
0 votes
1 answer
35
compiler Design
Please Answer this question 4. Discuss design issues in code generation. Generate target code for the following basic block. t1 : = a + b t2 : = c + d t3 : = e - t2 t4 : = t1 - t3
Please Answer this question 4. Discuss design issues in code generation. Generate target code for the following basic block. t1 : = a + b t2 : = c ...
User Avatar
0 votes
1 answer
37
Compiler Design: Timothy G. Griffin
3. Consider the grammar T → R | aTc R → € | RbR i). Give a leftmost and rightmost derivation of aabbbcc. ii). Is the grammar ambiguous? Justify your answer.
3. Consider the grammar T → R | aTc R → € | RbR i). Give a leftmost and rightmost derivation of aabbbcc. ii). Is the grammar ambiguous? Justify your answe...
User Avatar
0 votes
2 answers
39
Compiler Construction : Timothy G. Griffin
Q5. Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
Q5. Find the FIRST and FOLLOW of the grammar to check whether it is LL (1) parser or not. N → AB | BA A → a | CAC B → b | CBC C → a | b
User Avatar
0 votes
0 answers
42
Self Doubt Question
User Avatar
1 votes
1 answer
44
Errors
How to differentiate between Lexical, semantic and syntax error from a given code snippet. Why is this lexical error and not syntax error? $ y = 0x5i; $
How to differentiate between Lexical, semantic and syntax error from a given code snippet.Why is this lexical error and not syntax error? $ y = 0x5i; $
User Avatar
1 votes
3 answers
46
Made Easy Test Series - Compiler Design
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
User Avatar
0 votes
1 answer
50
Which of the following is LL(1) grammar?
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$ B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow \varepsilon $ C) $E\rightarrow E+E\mid (E) \mid id$
A) $S\rightarrow aA\mid bBa$ $A\rightarrow bA\mid a$ $ B\rightarrow aB\mid \varepsilon$B) $S\rightarrow Aa\mid Bb$ $ A\rightarrow \varepsilon $ $ B\rightarrow...
User Avatar
Page: