Search results for compiler

183
views
1 answers
0 votes
Find the minimum number of total variables in SSA form:a = b + mm = a + ed = b + mb = a + e
601
views
3 answers
1 votes
$\text{ Find $\textbf{First(A)}$ and $\textbf{Follow(B)}$ }?$
142
views
0 answers
0 votes
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
201
views
0 answers
0 votes
Please provide in detail solution step by step 5. 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 | bPlease provid in detail solution step by step
9.4k
views
4 answers
29 votes
Which one of the following is NOT performed during compilation?Dynamic memory allocationType checkingSymbol table managementInline expansion
262
views
1 answers
0 votes
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 assignment form is?Ans given is 7 but how
459
views
2 answers
0 votes
Please Answer this question in detail step by step: 3. Translate the arithmetic expression (a + b * c) + d + (a + b * c) − d + e ... ). DAG (Directed Acyclic Graph) representation, (please Draw) c). Three-Address Code representation.
182
views
0 answers
0 votes
8.7k
views
3 answers
24 votes
Which languages necessarily need heap allocation in the runtime environment?Those that support recursion.Those that use dynamic scoping.Those that allow dynamic data structure.Those that use global variables.
356
views
1 answers
0 votes
Like Example Above please answer this questionQ5. Implement a+b*(c+d)-e/finto: a). Quadruples.b). Triples.c). Indirect triples.
384
views
1 answers
0 votes
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
280
views
2 answers
0 votes
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
237
views
1 answers
0 votes
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.
20.7k
views
3 answers
40 votes
Consider the grammar shown below. $S \rightarrow C \ C$C \rightarrow c \ C \mid d$This grammar isLL(1)SLR(1) but not LL(1)LALR(1) but not SLR(1)LR(I) but not LALR(1)
442
views
0 answers
0 votes
4. Consider the following grammar and their syntax directed translation (SDT) rules.S → S * A {S.val = S.val x A. val}S → A {S.val ... .val} Calculate the evaluation value of the expression 4 * 6 + 3 * 7. Is it 45 or 84?
22.5k
views
7 answers
64 votes
The program below uses six temporary variables $a, b, c, d, e, f$.a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c ... $3$4$6$
264
views
0 answers
0 votes
148
views
1 answers
0 votes
Currently I am preparing for compiler design!What should be the approach on the topics from where should I start because sometimes the flow and order of the topic confuses ... not valid so can you tell me the order of study of the topics?
8.7k
views
4 answers
10 votes
Which of the following class of statement usually produces no executable code when compiled?declarationassignment statementsinput and output statementsstructural statements
301
views
1 answers
1 votes
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; $