Register
Webpage for Compiler Design:

Recent questions tagged compiler-design

1 votes
0 answers
511
DAG doubt
How to represent array expressions using DAG? for example a=b[i]+c[j] how to represent this using DAG?
How to represent array expressions using DAG?for example a=b[i]+c[j]how to represent this using DAG?
User Avatar
0 votes
0 answers
512
Compiler Design SDT Doubt
What is the SDT to eliminate redundant parenthesis from infix expressions with * and +? what is the concept behind removal of redundant parenthesis and how to start?
What is the SDT to eliminate redundant parenthesis from infix expressions with * and +? what is the concept behind removal of redundant parenthesis and how to start?
User Avatar
0 votes
1 answer
514
Compiler Design LR(1) doubt
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A->AB | a B->*AC | Cb | ∈ C->+ABc | ∈
Can lookahead symbol be epsilon in LR(1) parsing?andpls give the LR(1) diagram for the following grammar?A->AB | aB->*AC | Cb | ∈C->+ABc | ∈
User Avatar
0 votes
0 answers
515
Ullman(Second Edition) Exercise 4.2.3. Question (a) (page no-207)
Design grammar for the language- set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1 is this correct? S->A | 01S A->1AS | ε
Design grammar for the language-set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1 is this correct?S->A | 01SA->1AS | ε
User Avatar
1 votes
1 answer
517
Ullman Exercise
What language is generated by the following grammer? S→ a | S+S | SS | S* | (S)
What language is generated by the following grammer?S→ a | S+S | SS | S* | (S)
User Avatar
1 votes
2 answers
518
ME TEST1
Match the following List 1 Link time load time compile time Run time List 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
Match the followingList 1Link timeload timecompile timeRun timeList 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
User Avatar
1 votes
1 answer
519
Self-Doubt-Compiler
$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$ This language does not have LL(k) parser while being deterministic context free.Why?
$L=\{x^n:n \in N\} \cup\{x^ny^n|n \in N\}$This language does not have LL(k) parser while being deterministic context free.Why?
User Avatar
0 votes
3 answers
520
Error during compilation
fro(int I=0; I <5;I++); what kind of compilation error is this ?
fro(int I=0; I <5;I++);what kind of compilation error is this ?
User Avatar
0 votes
1 answer
521
Predictive parsing
Get LL(1) parsing table for the following grammar A--> aCDq / aBg C --> p /Ct / BD / rAB D--> d B-->e
Get LL(1) parsing table for the following grammarA aCDq / aBgC p /Ct / BD / rABD dB >e
User Avatar
0 votes
1 answer
522
Predictive
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or not S --> (L) / a L --> L, S / S
Construct the predictive parsing table for the grammar and tell whether the grammar is LL(1) or notS (L) / aL L, S / S
User Avatar
0 votes
1 answer
523
#ComplierDesign #DragonsBook
For any context-free grammar there is a parser that takes at most O (n$^3$ ) time to parse a string of n terminals. True or False?
For any context-free grammar there is a parser that takes at most O (n$^3$ )time to parse a string of n terminals.True or False?
User Avatar
0 votes
1 answer
524
#self doubt
is it always true or not??? STATEMENT → in LR(0) Parsing i1 is a final state,there is a shift move. it always give S/R conflict. Explain with example.
is it always true or not???STATEMENT → in LR(0) Parsing i1 is a final state,there is a shift move. it always give S/R conflict.Explain with example.
User Avatar
13 votes
4 answers
525
GATE CSE 2019 | Question: 3
Which one of the following kinds of derivation is used by LR parsers? Leftmost Leftmost in reverse Rightmost Rightmost in reverse
Which one of the following kinds of derivation is used by LR parsers?LeftmostLeftmost in reverseRightmostRightmost in reverse
User Avatar
0 votes
0 answers
530
LR(1) doubt
In exam if they are mentioning LR(1) parser Then which parser to consider: SLR(1) / LALR(1) / CLR(1)
In exam if they are mentioning LR(1) parserThen which parser to consider:SLR(1) / LALR(1) / CLR(1)
User Avatar
0 votes
0 answers
531
Self dout
Which phase of the compiler detects the error? #include<stdio.h> int main() { printf(“%d”,2..3); return 0; } I think lexical analyzer am i correct?
Which phase of the compiler detects the error?#include<stdio.h>int main(){printf(“%d”,2..3);return 0;}I think lexical analyzer am i correct?
User Avatar
0 votes
0 answers
532
Made easy
I am having difficulty in finding the type of errors like if given a statement, if I have to tell which type of error it is ( syntax or semantic). Can anyone help me with it,explain it to me in a simple language by giving examples.
I am having difficulty in finding the type of errors like if given a statement, if I have to tell which type of error it is ( syntax or semantic). Can anyone help me with...
User Avatar
1 votes
0 answers
533
Self curiosity
Can a grammar be both right recursive and ambiguous ? How?
Can a grammar be both right recursive and ambiguous ? How?
User Avatar
0 votes
2 answers
534
Made Easy Test Series
b = b + c d = b + d b = b – d e = d + b The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ? 4 and 5 5 and 4 6 and 6 6 and 7
b = b + cd = b + db = b – de = d + bThe minimum number of nodes and edges present in the DAG representation of above basic block respectively are ?4 and 55 and 46 and 6...
User Avatar
0 votes
1 answer
537
how to check grammar is lr(1)?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals. Does LR(1) can parse all strings that are generated by grammar G.? Please any one help me to how to check it?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals.Does LR(1) can parse all strings that are generated by gr...
User Avatar
6 votes
2 answers
538
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 1
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduce shift-reduce conflict reduce-reduce conflict no extra conflict both shift-reduce as well as reduce-reduce
If we merge states in LR(1) parser to form a LALR(1) parser, we may introduceshift-reduce conflictreduce-reduce conflictno extra conflictboth shift-reduce as well as redu...
User Avatar
0 votes
1 answer
539
#ReferenceBook #FutureProspect
Which reference book you guys use for Compiler Design? What are the research prospect in this domain?
Which reference book you guys use for Compiler Design?What are the research prospect in this domain?
User Avatar
0 votes
1 answer
540
#General #Compilers
If we have more than 1 parse tree,but one is LMD and other is RMD , Is Grammar Ambiguous? There are no other parse tree other than these two.
If we have more than 1 parse tree,but one is LMD and other is RMD , Is Grammar Ambiguous?There are no other parse tree other than these two.
User Avatar
Page: