Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

0 votes
0 answers
631
compiler
backtracking is required only for top down parser? true/false
backtracking is required only for top down parser? true/false
User Avatar
1 votes
0 answers
635
Triple Representation of x[i]=y
Given Answer is A
Given Answer is A
User Avatar
0 votes
0 answers
637
Gateforum Test Series
Consider the following Grammar G S-->SX|SSb|XS|a X-->a|Xb The number of productions in the grammar(including epsilon production) after removing left recursion is ?
Consider the following Grammar GS >SX|SSb|XS|aX >a|XbThe number of productions in the grammar(including epsilon production) after removing left recursion is ?
User Avatar
0 votes
1 answer
638
compiler1
User Avatar
0 votes
1 answer
640
Test Book- Complier Design
Consider the following issues Simplifies the phases. Compiler efficiency is improved. Compiler works faster. Does not require a stack. Which is/are true in context of lexical analysis? pls provide an explanation as well..
Consider the following issuesSimplifies the phases.Compiler efficiency is improved.Compiler works faster.Does not require a stack.Which is/are true in context of lexical ...
User Avatar
0 votes
1 answer
641
ME Compiler Design
Consider the following transition rules: A->BC C->+BC|A|$\epsilon$ B->DB{print '+'}|$\epsilon$ D->(A)|id{print num.value} On input '5+67' this translation scheme prints A 5+67+ B 5+6+7+ C 5+6+7 D 5+67++
Consider the following transition rules:A->BCC->+BC|A|$\epsilon$B->DB{print '+'}|$\epsilon$D->(A)|id{print num.value}On input '5+67' this translation scheme printsA 5+67+...
User Avatar
4 votes
2 answers
646
MadeEasy Test Series: Compiler Design - Lexical Analysis
int main() { int a,b; a=10; b=15; printf("a=%d,b=%d",a++,b--); } The number of tokens in the above C program is_________. I am getting 30 The answer given is 29
int main() { int a,b; a=10; b=15; printf("a=%d,b=%d",a++,b ); }The number of tokens in the above C program is_________.I am getting 30The answer given is 29
User Avatar
1 votes
0 answers
647
Self Doubt Token Count - Character Literal
How many tokens are there ? int main() { char name={'A','A','K','A','S','H'}; return 0; } Please give any reference if possible, my doubt is about the characters in the braces, do we count them individually or like a string.
How many tokens are there ? int main(){char name={'A','A','K','A','S','H'};return 0;}Please give any reference if possible, my doubt is about the characters in the braces...
User Avatar
0 votes
0 answers
650
Self Doubt
User Avatar
0 votes
1 answer
651
MadeEasy Workbook: Compiler Design - Parsing
WHICH OF THE FOLLOWING STATEMENTS ARE TRUE? a) S1 & S3 b) S2 & S4 c) S2 & S3 d) None of these Answer is option a. can anyone tell me how option a is correct?
WHICH OF THE FOLLOWING STATEMENTS ARE TRUE?a) S1 & S3b) S2 & S4c) S2 & S3d) None of theseAnswer is option a.can anyone tell me how option a is correct?
User Avatar
0 votes
0 answers
652
MadeEasy Workbook: Compiler Design - Parsing
answer is option d can anyone tell me how option d is the correct answer?
answer is option dcan anyone tell me how option d is the correct answer?
User Avatar
0 votes
1 answer
653
MadeEasy Workbook: Compiler Design - Parsing
COMMENT(how the below statement is true) LL(k) languages are proper subset of LL(k-1) languages.
COMMENT(how the below statement is true)LL(k) languages are proper subset of LL(k-1) languages.
User Avatar
0 votes
1 answer
655
Parsing techniques
Consider the grammar S->a/ab/abc A) it is LL(1) B) it is LL(2) C) it is LL(3)
Consider the grammarS->a/ab/abcA) it is LL(1)B) it is LL(2)C) it is LL(3)
User Avatar
0 votes
0 answers
658
Self doubt
Show that no grammar that has cycles can be LL(1). Is it true ?? It is saying if the grammar has cycle it can't be LL(1) But what if the cycle in grammar is due to RIGHT RECURSiON which is allowed in LL(1) ???
Show that no grammar that has cycles can be LL(1).Is it true ??It is saying if the grammar has cycle it can't be LL(1)But what if the cycle in grammar is due to RIGHT REC...
User Avatar
0 votes
1 answer
659
compiler design
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers. eleborate this ??
One of the purposes of using intermediate code in compilers is to increase the chances of reusing the machine-independent code optimizer in other compilers.eleborate this...
User Avatar
Page: