Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

0 votes
1 answer
545
static single assignment
# of temporary variable required to create 3 address code in static single assignment form for the expression P+Q*R-S/(Q*R).
# of temporary variable required to create 3 address code in static single assignment form for the expression P+Q*R-S/(Q*R).
User Avatar
1 votes
0 answers
546
Ace Test Series: Compiler - Parser Conflicts
Consider the following CFG. S → aSa|bSb|a|b Number of conflicts in LR(0) State Diagram? 2 8 10 4
Consider the following CFG.S → aSa|bSb|a|bNumber of conflicts in LR(0) State Diagram?28104
User Avatar
2 votes
3 answers
547
Self doubt
How many tokens in this a>>=1; and a! , Will >>= and a! be treated as a single token ?
How many tokens in thisa>>=1;and a! , Will >>= and a! be treated as a single token ?
User Avatar
1 votes
4 answers
548
clr(1) parser
grammar is CLR(1) or not? if yes then how?
grammar is CLR(1) or not?if yes then how?
User Avatar
0 votes
3 answers
549
compiler phase error
int main(){ int a = 10; fun(a); } void fun(int a){ printf(“%d”,a); } Which phase of the compiler will raise an error? Lexical syntax semantics none of the above
int main(){int a = 10;fun(a);}void fun(int a){printf(“%d”,a);}Which phase of the compiler will raise an error?Lexical syntaxsemanticsnone of the above
User Avatar
0 votes
1 answer
550
Parsing LALR
If LALR(1) parser have shift reduce conflict then CLR(1) parser must have shift reduce conflict, why?
If LALR(1) parser have shift reduce conflict then CLR(1) parser must have shift reduce conflict, why?
User Avatar
2 votes
0 answers
554
LALR(1) Parser
Which one of the following is true about LALR(1) Parser ? It can resolve SR Conflict in favor of reduced It can resolve SR Conflict in favor of Shift It can resolve RR Conflict in favor of reduced It can resolve RR Conflict in favor of shift
Which one of the following is true about LALR(1) Parser ?It can resolve SR Conflict in favor of reducedIt can resolve SR Conflict in favor of ShiftIt can resolve RR Confl...
User Avatar
0 votes
0 answers
555
Made Easy Single Subject Test
A grammar that has no epsilon productions and also free from unit productions. The maximum number of reduce moves that can be taken during bottom-up evaluation of 25 token string by performing bottom-up parsers is _______
A grammar that has no epsilon productions and also free from unit productions. The maximum number of reduce moves that can be taken during bottom-up evaluation of 25 toke...
User Avatar
1 votes
1 answer
556
conflicts in parser
does augmented production causes conflicts
does augmented production causes conflicts
User Avatar
1 votes
1 answer
558
Applied Course | Mock GATE | Test 1 | Question: 16
Which phase of the compiler generates parse tree? Lexical analyzer Semantic analyzer Syntax analyzer None of them.
Which phase of the compiler generates parse tree?Lexical analyzerSemantic analyzerSyntax analyzerNone of them.
User Avatar
0 votes
1 answer
561
MadeEasy Subject Test 2019: Compiler Design - Parsing
Which of the Statements are True : S1: LR(1) grammar can be LR(0) but not LL(1). S2 : Every regular language is LL(1) S3 : Three address code is linear representation of Syntax Tree.
Which of the Statements are True :S1: LR(1) grammar can be LR(0) but not LL(1).S2 : Every regular language is LL(1)S3 : Three address code is linear representation of Syn...
User Avatar
1 votes
1 answer
565
MadeEasy Subject Test 2019: Compiler Design - Syntax Directed Translation
Consider the following Translation rules for the Grammar G : What will be the output for input string abebebe for bottom up parser ? CBBPBPBP CBBBPPBB CBPBPBPB CBPBBPPB
Consider the following Translation rules for the Grammar G :What will be the output for input string abebebe for bottom up parser ?CBBPBPBPCBBBPPBBCBPBPBPBCBPBBPPB
User Avatar
0 votes
0 answers
566
Compilers Doubt
Suppose Grammars given:- S→ Bbb B→ epsilon If we do SLR(1) parsing on the above grammar. Then the first state would have shift-reduce conflict right?? Because B→ epsilon would be same as B→ . right? Please make this clear.
Suppose Grammars given:-S→ BbbB→ epsilonIf we do SLR(1) parsing on the above grammar. Then the first state would have shift-reduce conflict right??Because B→ epsilo...
User Avatar
0 votes
2 answers
567
Intermediate code representation
Answer is 6,6 Can anybody explain how?
Answer is 6,6Can anybody explain how?
User Avatar
0 votes
1 answer
568
me test
Consider the basic block given below: u=u+v v=v+w x=v-w y=v-x z=u+v The minimum number of nodes and edges present in the DAG representations of the above basic block respectively are:
Consider the basic block given below:u=u+vv=v+wx=v-wy=v-xz=u+vThe minimum number of nodes and edges present in the DAG representations of the above basic block respective...
User Avatar
Page: