Register

Test by Bikram | Compiler Design | Test 1 | Question: 20

• retagged by
1,789 views
3 3 votes
The least number of temporary variables required to create a $3$ address code sequence for the statement $L= P + R$ is ________.

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · Test by Bikram | Com...Next → · Test by Bikram | Com...
← Previous in category · Test by Bikram | Com...Next in category → · Test by Bikram | Com...
Position:
Show:

Related questions

2 2 votes
2 answers 2 answers
1.2k
1.2k views
Bikram asked Nov 25, 2016
1,160 views
Test by Bikram | Compiler Design | Test 1 | Question: 15
Which of these is NOT true about Abstract Syntax Tree (AST)?An AST is usually the result of the syntax analysis phase of a compiler.AST has no impact on the final output...
3 3 votes
2 answers 2 answers
1.9k
1.9k views
Bikram asked Nov 25, 2016
1,854 views
Test by Bikram | Compiler Design | Test 1 | Question: 30
Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above
3 3 votes
1 answers 1 answer
637
637 views
Bikram asked Nov 25, 2016
637 views
Test by Bikram | Compiler Design | Test 1 | Question: 29
Which grammar causes recursive-descent parser to go into infinite loop?LL(1)Left recursive grammarRight recursive grammarGrammar with left factors
3 3 votes
1 answers 1 answer
1.7k
1.7k views
Bikram asked Nov 25, 2016
1,712 views
Test by Bikram | Compiler Design | Test 1 | Question: 28
Consider the following syntax directed definition of any desk calculator:$L \rightarrow En \{ \text{print}(E.val) \}$$E \rightarrow E1 + 1 \{ E.val = E1.val + Z.val \}$$E...