Recent questions and answers in Compiler Design - GATE CSE Doubts

0 votes

0 answers

Directed Acyclic Graph in CD
Can anyone provide me good reference for solving Directed Acyclic Graphs(DAG) problems?

asked 1 day ago in Compiler Design by nikhil856 (13 points) | 6 views

0 votes

0 answers

Made Easy Test series
Answer will 8 or 9? i got 9 (according to me no optimization should be done in Intermediate representation form) [closed]

asked 3 days ago in Compiler Design by Nitinkumar.097 (13 points) | 10 views

0 votes

0 answers

Ace Test Series
I know A,B,C are valid answer But can anyone confirm if D is also valid..We have epsilon in RHS it should not be Operator Grammer so D should be also valid???...can i get help

asked Jan 9 in Compiler Design by vipin.gautam1906 (5 points) | 16 views

0 votes

0 answers

Intermediate 3 address code generation doubt related to unary operators in an arithmetic expression

asked Dec 30, 2020 in Compiler Design by rish-18 (9 points) | 35 views

0 votes

1 answer

self doubt ambiguous to unambiguous
https://gateoverflow.in/141809/ambiguous-to-unambiguous what will be the unambiguous grammar …...

answered Dec 29, 2020 in Compiler Design by zxy123 (2.9k points) | 13 views

0 votes

1 answer

Number system,Gate-2021, previous year Gate questions

answered Dec 29, 2020 in Compiler Design by zxy123 (2.9k points) | 26 views

0 votes

0 answers

madeeasy notes
S->AB A->a B->b is ambiguous or not ? i think not ambiguous becz not having two same left most derivation tree or not hab=ving two same RMD tree…...is it correct

asked Dec 28, 2020 in Compiler Design by eyeamgj (25 points) | 13 views

0 votes

0 answers

madeeasy test series
https://gateoverflow.in/284952/madeeasy-series-compiler-design-static-single-assignment what is the correct answer i am getting 6 after doing simplification 7 without minimization ….

asked Dec 27, 2020 in Compiler Design by eyeamgj (25 points) | 20 views

0 votes

0 answers

ACE Academy Test series problem. Need explanation. According to them Option C is correct.

asked Dec 24, 2020 in Compiler Design by taurus05 (7 points) | 12 views

0 votes

1 answer

Made Easy SubjectWise
can someone tell why is First(B)={b,a,ε} here?? why ‘c’ is not included

answered Dec 24, 2020 in Compiler Design by saurabh111 (11 points) | 28 views

+1 vote

1 answer

self doubt(first and follow/left recursion)
(1)S->AA/ab A->Bd/null B->SB/d (2) S->AB/a A->SA/null B->AB/d doubt 1--->i can’t able to remove indirect left recursion from both the questions,what is grammar after removing left recursion?? doubt 2--->what is the FIRST and FOLLOW ?

answered Dec 16, 2020 in Compiler Design by zxy123 (2.9k points) | 24 views

0 votes

0 answers

GATE OVERFLOW QUERIES
came across this question on gate overflow. please help with solution

asked Dec 16, 2020 in Compiler Design by Bgupta (5 points) | 18 views

+1 vote

1 answer

#madeeasytestseries
x=x*x y=y*y x=x*y y=y*x Minimum number of total variables in single static assignment for above code?

answered Dec 15, 2020 in Compiler Design by Sahil91 (645 points) | 18 views

0 votes

0 answers

Madeeasy Test series Compiler Q4
Anyone please clarify.

asked Dec 14, 2020 in Compiler Design by Shivateja MST (45 points) | 35 views

0 votes

1 answer

MadeEasy test series question 2020
Consider the following statements : S1) Three Address Code is a linearized representation of syntax tree S2) With triples representation optimization can change execution order. Which of the above is correct ? only S1 only S2 both S1 and S2 None of the above Anyone please clarify.

answered Dec 13, 2020 in Compiler Design by udbhav94 (5 points) | 54 views

0 votes

1 answer

Made easy Compiler design Q3
Anyone please clarify why lexical error is generated.

answered Dec 13, 2020 in Compiler Design by Deepakk Poonia (Dee) (1.5k points) | 45 views

0 votes

0 answers

Made easy compiler question 2
Which of the following is/are not the functions of Syntax analyzer ? Recognize the language and to call the appropriate action routines that will generate the intermediate form or matrix for these constructs. Build a literal table and an ... Build a uniform symbol table Parse the source program into basic elements or tokens of the language. Anyone please clarify.

asked Dec 13, 2020 in Compiler Design by Shivateja MST (45 points) | 12 views

0 votes

0 answers

Made-Easy test Series - Compiler Design, Parsing, 2021

asked Dec 12, 2020 in Compiler Design by sankalpmittal (41 points) | 26 views

0 votes

1 answer

Madeeasy Testseries 2020 Q1
Here answer seems to be option A but given as D. Anyone please clarify

answered Dec 12, 2020 in Compiler Design by Sahil91 (645 points) | 42 views

0 votes

0 answers

Made Easy Compiler Test: Syntax Phase
I don’t understand it at all, if someone can elaborate these options then it would be a great help.

asked Dec 8, 2020 in Compiler Design by luc_Bloodstone (19 points) | 20 views

0 votes

1 answer

ACE Test Series : Subject Wise Test Compiler Design

answered Dec 7, 2020 in Compiler Design by Sahil91 (645 points) | 60 views

0 votes

0 answers

COMPILER DESIGN
Prove that 1. “There are DCFLs which doesnot have an LL(k) grammar” “For any DCFL, we can always have an LR(1) grammar”

asked Dec 5, 2020 in Compiler Design by SHIV_KANNAUJ (9 points) | 18 views

0 votes

0 answers

Made Easy Test Series

asked Dec 3, 2020 in Compiler Design by Vishal_kumar98 (37 points) | 37 views

0 votes

0 answers

#made-easy #compiler-design
S→ ABA A→ Bc|dA|epsilon B→ eA How many entries have multiple productions in LL(1) table? ans given is 1. but i am getting 2 In answer Follow(A)={c,e,$} but according to me it should be {c,d,e,$}

asked Dec 3, 2020 in Compiler Design by 404 found (31 points) | 23 views

0 votes

1 answer

Self Study Doubt
Lex File %{ #include "y.tab.h" %} %% [a-zA-Z_][a-zA-Z_0-9]* return letter; [0-9] return digit; . return yytext[0]; \n return 0; %% int yywrap() { return 1; } YACC PART: %{ #include<stdio.h> int v=1; %} %token ... the YACC C. Lex return two tokens to the YACC D. RECOGNIZE A VALID VARIABLE WHICH STARTS WITH A LETTER FOLLOWED BY ANY NUMBER OF LETTERS OR DIGITS Fe

answered Nov 29, 2020 in Compiler Design by zxy123 (2.9k points) | 20 views

0 votes

0 answers

ME subjectwise
No grammar with empty production can be LR(0)?? Is the statement true

asked Nov 26, 2020 in Compiler Design by Ashutosh777 (-219 points) | 18 views

0 votes

1 answer

Nielit 2020 paper
Type of Conflicts that arises in LR(0). A Shift Re conflict B Shift shift conflict C Shift reduce and shift shift conflict. D none of the above

answered Nov 23, 2020 in Compiler Design by zxy123 (2.9k points) | 27 views

0 votes

1 answer

Just thinking about it
Since Reduce entries in both LR(0) and SLR(1) are different. so does that mean error entries will also be different in these two.

answered Nov 23, 2020 in Compiler Design by zxy123 (2.9k points) | 20 views

0 votes

0 answers

Syntaxx Directed Translations
I have a small doubt, is SDT part of semantic analysis phase ?? if so then when we enter type info of variable in symbol table which happens in syntaxx analysis phase. wouldn't it require an SDT ?? then how does SDT become a part of ... type of variable is not entered in syntaxx analysis phase, then what is the use of symbol table in syntaxx analysis phase ??/

asked Nov 23, 2020 in Compiler Design by sandeepc (5 points) | 10 views

0 votes

0 answers

#self-doubt #compiler-design
can someone explain difference betweeen left recursive grammer and cyclic grammer and relationship among them with the help of proper example?

asked Nov 22, 2020 in Compiler Design by 404 found (31 points) | 22 views

+1 vote

1 answer

ACE ACADEMY Booklet

answered Nov 20, 2020 in Compiler Design by zxy123 (2.9k points) | 22 views

0 votes

1 answer

#made-easy-test-series #compiler-design
Which of the following functions is/ are performed by the loader? A. Allocate space in memory for the programs and resolve symbolic references between object decks B. Physically place the machine instructions and data into memory C. Adjust all address ... . linking the program ans is a,b,c can someone explain point A bcz i think it is performed by linker

answered Nov 20, 2020 in Compiler Design by 14ash (65 points) | 32 views

0 votes

0 answers

#made-easy-test-series #compiler-design
The number of correct statements are: Lexical analyzer gives error message by giving row number and column number semantic analyzer gives error message by giving row number and column number ans is 1 and first statement is correct and second is incorrect .can someone explains why?

asked Nov 20, 2020 in Compiler Design by 404 found (31 points) | 18 views

0 votes

0 answers

#self-doubt #compiler-design
can someone suggest some good sources from where we can study newly added topics in compiler design like: local optimization data flow analysis constant propagation live ness analysis common sub expression elimination

asked Nov 19, 2020 in Compiler Design by 404 found (31 points) | 12 views

+1 vote

1 answer

Kenneth Louden Compiler construction, 1997 chapter 4 exercise 4.7

answered Nov 16, 2020 in Compiler Design by zxy123 (2.9k points) | 20 views

0 votes

0 answers

Kenneth Louden Compiler construction, 1997 chapter 5 exercise 5.3

asked Nov 16, 2020 in Compiler Design by Nivesh (9 points) | 12 views

0 votes

1 answer

New Topics added in Gate 2021
Can someone please suggest good video lectures or some text material of topics added in compiler design in gate 2021 they are Data flow analyses: constant propagation, liveness analysis, common subexpression elimination

answered Nov 2, 2020 in Compiler Design by StoneHeart (735 points) | 49 views

0 votes

1 answer

Self Doubt in regards to power of parsers
Why Bottom Up Parsers are more powerful than Top Down parsers ?

answered Oct 30, 2020 in Compiler Design by SarathBaswa (633 points) | 18 views

0 votes

0 answers

self doubt on DAG
When we talk of Minimum nodes in a DAG, can we use code optimisation suppose TAC looks like a=a+b b=a-b c=b+c d=c-b What will be minimum number of nodes in the DAG? Should we optimize it like a=a+b b=a c=b+c d=c and then proceed?

asked Oct 28, 2020 in Compiler Design by StoneHeart (735 points) | 13 views

0 votes

1 answer

compiler design , syntax analysis.
IS IT THE FUNCTION OF SYNTAX ANALYSIS TO BUILD A UNIFORM SYMBOL TABLE ?AND IN WHICH PHASE WE BUILD A SYMBOL TABLE??

answered Oct 27, 2020 in Compiler Design by vizzard110 (85 points) | 19 views

To see more, click for all the questions in this category.

Recent questions and answers in Compiler Design

8,957 questions

3,118 answers

14,337 comments

95,787 users