Recent questions and answers in Compiler Design - GATE CSE Doubts

0 votes

0 answers

GATE GURU: PARSER

asked 15 hours ago in Compiler Design by Debapaul (642 points) | 15 views

0 votes

1 answer

answered 1 day ago in Compiler Design by shashin (1.3k points) | 19 views

0 votes

1 answer

69. Ace academy booklet
Let there are '10's states for a grammar which is SLR(1), then the number of states in LALR(1) parser is________.

answered 1 day ago in Compiler Design by Priyansh Singh (223 points) | 11 views

0 votes

0 answers

made easy test series compiler design SLR1

asked 2 days ago in Compiler Design by Dheeraj Varma (13 points) | 20 views

0 votes

0 answers

gatebook compiler design lexical analysis
Which of the following is a disadvantage of lexical analysis ? A. You need to spend significant time reading the source program and partitioning it in the form of tokens B. More effort is needed to develop and debug the lexer and its token ... is D, but how C is correct, compiler works at compile time and how there can be an overhead at runtime?

asked 3 days ago in Compiler Design by neeraj_bhatt (237 points) | 4 views

0 votes

0 answers

Gatebook lexical analysis
If the lexical analyzer finds a lexeme that matches with any existing reserved word, it generates an error. Because lexical analyzer follows _____ A. Longest Match Rule B. Rule priority C. Keyword - Out Rule D. None of this Answer given is B, Can someone please explain how it is B?

asked 3 days ago in Compiler Design by neeraj_bhatt (237 points) | 18 views

0 votes

0 answers

Gatebook Compiler Design
Which of the following would be least likely to be stored in the symbol table of a compiler? A. the type of an identifier B. the location where an identifier will be stored C. the number of bytes required for a particular named type D. the type of a complex expression Answer is Option D, but how?

asked 3 days ago in Compiler Design by neeraj_bhatt (237 points) | 3 views

0 votes

0 answers

Gatebook Compiler Design test series
Consider the following statements related to lexical errors S1 : A character sequence that cannot be scanned into any valid token is a lexical error. S2 : Misspelling of identifiers, keyword, or operators are considered as lexical errors. Which of the above statement ... S1 and S2 D. Neither S1 or S2 I'm getting answer as B, but they have given solution as D.

asked 3 days ago in Compiler Design by neeraj_bhatt (237 points) | 8 views

0 votes

0 answers

Self Doubt regarding lexical analysis
How lexical errors can be resolved? Can someone please provide a link.

asked 3 days ago in Compiler Design by neeraj_bhatt (237 points) | 4 views

0 votes

0 answers

Techtud-Compiler
Recursive descent parsing can use left recursive grammars. Is this statement True or False?

asked 4 days ago in Compiler Design by srestha (636 points) | 17 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 Q42 Networks
I got 320 bits using the formula efficiency = N / (1+2a) . I took N=63 because in GBN N is the sender window size which is used to calculate efficiency. Still there’s such a huge difference between 320 bits and 81301 bytes. where did I do wrong. pls help. thanks

asked 4 days ago in Compiler Design by DukeThunders (409 points) | 5 views

0 votes

0 answers

GATE MOCK TEST 3 GATE 2019 Q48 Compiler
From the placement of the semantic actions it can be said that it is L attributed grammar and not S attributed. If it was S attributed the actions would be placed strictly at the end. So here why are they saying bottom up parsing? ... the actions on first encounter (instead of waiting till the reduction is performed). The answer matched too. I am confused.

asked 4 days ago in Compiler Design by DukeThunders (409 points) | 5 views

0 votes

1 answer

Count the tokens
Tell me the answer and number of tokens in the following statement is:- b -= a;

answered 5 days ago in Compiler Design by Rudr Pawan (731 points) | 27 views

0 votes

0 answers

Three address code: GATE FORUM
Do we need to declare $b-c$ the second time? It can be used from $t_1$ right?

asked 5 days ago in Compiler Design by Debapaul (642 points) | 17 views

+1 vote

1 answer

ACE Test -Compiler Doubt
Which is not a token in C code? $A)\rightarrow$ $B)\uparrow$ where we use ‘$\rightarrow$’ in C code?

answered 6 days ago in Compiler Design by shashin (1.3k points) | 14 views

+1 vote

1 answer

GATE GURU: FLT 5
Is $>>=$ a single tocken or 2 tockens?

answered Jan 16 in Compiler Design by shashin (1.3k points) | 32 views

0 votes

1 answer

Self doubt:Compiler
Someone plz solve the doubt for this question https://gateoverflow.in/302805/gate2019-43 Why ans is not 2?

answered Jan 16 in Compiler Design by abhinav649 (65 points) | 21 views

0 votes

0 answers

madeeasy compier design
Consider the following grammar which is not LL(1) because LL(1) table contain multiple entry for same production. S-->aAbB/ bAaB/epsilon A-->S B-->S The number of entries have multiple productions in LL(1) table are ________.

asked Jan 15 in Compiler Design by suchithreddy (7 points) | 3 views

0 votes

1 answer

Ace Academy test series : Compiler Design

answered Jan 15 in Compiler Design by vikas999 (55 points) | 25 views

0 votes

1 answer

applied gate:compiler design
A) B) C) D)

answered Jan 15 in Compiler Design by shashin (1.3k points) | 24 views

0 votes

0 answers

MADE EASY FULL LENGTH TEST 3
ANSWER GIVEN AS 42. BUT I AM GETTING ANSWER 41. IN THE SOLUTION THEY COUNTED -= SEPARATELY INSTEAD OF COUNTING ONCE. PLEASE CLARIFY.

asked Jan 14 in Compiler Design by SuvasishDutta (166 points) | 19 views

0 votes

1 answer

MADE EASY ADVANCE COMPILERS
Consider the grammar which is $not$ $LL(1)$ as the $LL(1)$ table contain multiple error entries for the same The number of entries have multiple production in LL1 are?

answered Jan 14 in Compiler Design by shashin (1.3k points) | 23 views

0 votes

0 answers

GATE GURU: DAG
What does the intermediate $+$ signify?

asked Jan 12 in Compiler Design by Debapaul (642 points) | 11 views

+4 votes

0 answers

MADE EASY: AUTOMATA GATE 2020
The number of languages that are $Regular?$ is ________ $xyzyx $ $| x,y,z=\sum ^*$ $xyzyx$ $|x,z=\sum^* ; y=\sum^+$ $xyzyx^r$ $|x,z=\sum^* ; y=\sum^+$

asked Jan 11 in Compiler Design by Debapaul (642 points) | 22 views

0 votes

1 answer

Self doubt : Compiler Design
No of tokens in Question 1. b - = a ; Question 2. c>>=d ;

answered Jan 10 in Compiler Design by shashin (1.3k points) | 26 views

0 votes

1 answer

GATEBOOK compiler grand test Q5
Consider the following grammar The Grammar is _____ A. Both LL(1) and LR(0) B. Only LL(1) C. Only LR(0) D. Neither LL(1) or LR(0)

answered Jan 9 in Compiler Design by priyesh9875 (59 points) | 24 views

0 votes

0 answers

ACE Test-Compiler
Which one following is true about LALR(1) parser? (A) It can resolve SR conflict in favour of reduced. (B) It can resolve SR conflict in favour of shift. (C) It can resolve RR conflict in favour of shift. (D) None of these. Which of them is true? What is difference between A) and B)??I know LALR can have SR conflict, if CLR has SR conflict. Then how B) could be correct??

asked Jan 9 in Compiler Design by srestha (636 points) | 29 views

0 votes

1 answer

SELF DOUBT: COMPILER DESIGN 1234
$S→ S+S$ What is the associaitivity of $+$ here? is it defined?

answered Jan 8 in Compiler Design by shashin (1.3k points) | 33 views

0 votes

0 answers

Made easy test series: Bottom up parsing
Consider the following SDT: If the bottom up parsing is used to parse the input string “1234” then the output number produced (without any spaces) is ________. what will be the answer for above question, whether it is 214 or 412. If 412 ,then how?

asked Jan 8 in Compiler Design by vishal burnwal (123 points) | 19 views

0 votes

0 answers

GATE FORUM COMPILER DESIGN
Ans given is $D$ but in Dragon Book creation of DAG, Three address code is mentioned under $intermediate-code$ $generation$ so only 2 and 4 should be the ans right?

asked Jan 7 in Compiler Design by Debapaul (642 points) | 6 views

0 votes

0 answers

SINGLE SUBJECT : COMPILER DESIGN (GATE - 2020) Question 7 (Made Easy)

asked Jan 6 in Compiler Design by Mk Utkarsh (472 points) | 31 views

0 votes

0 answers

FULL SYLLABUS TEST-7 (ADVANCE LEVEL) GATE 2019 Q27 tokens

asked Jan 6 in Compiler Design by DukeThunders (409 points) | 6 views

0 votes

0 answers

Self doubt-Compiler
Is linker error not a compiler error?

asked Jan 4 in Compiler Design by srestha (636 points) | 16 views

0 votes

0 answers

Self Doubt CD
Doubt is regarding questions like: Minimum registers required to evaluate given three address code segment. Or Finding minimum temporary variable using SSA. Here, Do we ignore dead code or not as code optimization is not in syllabus?

asked Jan 3 in Compiler Design by tp21 (267 points) | 3 views

0 votes

0 answers

Made easy test series : Static single assignment
Consider the following code segment: The minimum number of total variables required to convert the above code segment to static single assignment form is ________. What will be the correct answer for above question. My doubt is that for the ... as second assignment without any modifications of value a' and x' in between which is assigned to c'.

asked Jan 2 in Compiler Design by vishal burnwal (123 points) | 15 views

0 votes

1 answer

Made easy single test series 2020

answered Jan 2 in Compiler Design by eyeamgj (27 points) | 31 views

0 votes

0 answers

Made easy test series : Synthesized attributes
Leaf node of the tree is synthesized attribute. Whether the above statement is true or false?

asked Jan 2 in Compiler Design by vishal burnwal (123 points) | 33 views

0 votes

0 answers

Made easy test series : Parsers and grammars
Consider the following statements: I. Every regular set has a LR(1) grammar. II. Recursive descent parser can not use left recursive grammar. III. Symbol table is used as data structure in compiler. Which of the above statement is correct? Can someone explain statement II.

asked Jan 2 in Compiler Design by vishal burnwal (123 points) | 9 views

0 votes

0 answers

Self Doubt (MADE EASY) : Number of Tockens
How many tokens are there in the below expression $b+=c$ It should be $3$ right as $+=$ is considered as a single token right? or are they different tokens?

asked Dec 31, 2019 in Compiler Design by Debapaul (642 points) | 23 views

0 votes

0 answers

Madeeasy test series - How many lookaheads are present?

asked Dec 31, 2019 in Compiler Design by luc_Bloodstone (35 points) | 12 views

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

Recent questions and answers in Compiler Design

3,089 questions

1,539 answers

9,246 comments

89,827 users