Recent questions and answers in Compiler Design - GATE CSE Doubts

0 votes

0 answers

Consider the following grammar G.
Q.27 Consider the following grammar G. S→AB/d A→aA/b B→bB/c The grammar G is (a) LL (1) grammar and not LR (0) (b) LL (1) and LR (0) (c) Not LL (1) but LR (0) (d) Neither LL (1) nor LR (0)

asked 2 days ago in Compiler Design by Debanil (6 points) | 8 views

0 votes

0 answers

self doubt on syllabus
Is abstract syntax tree and control flow graph there in gate syllabus of 2021?

asked Mar 18 in Compiler Design by munna109510 (6 points) | 12 views

0 votes

1 answer

First and Follow sets for a given grammar.
I watched through Compiler Design Lec 23. There Prof. has shared a question on drawing a predictive parsing table for the evaluating/checking a boolean expression. Grammar for the same is: B → TB' B' → orTB' | Ɛ T → FT' T' → andFT' | Ɛ ... ) Can anybody please confirm if my interpretation is wrong? If wrong, why will not and' appear in follow of B and B'.

answered Mar 17 in Compiler Design by !KARAN (351 points) | 6 views

0 votes

0 answers

#Q.37 CIL MT EXAM 2020 Systems
The following grammar is: S → Aa | bAc | dc | bda A→ a A. LALR(1) but not SLR(1) B. Not LALR(1) but SLR(1) C. Neither LALR(1) nor SLR(1) D. LALR(1) and SLR(1)

asked Mar 9 in Compiler Design by hello_manish (6 points) | 13 views

0 votes

1 answer

Compiler-design (Parser)
If a grammar is LALR( 1 ), it is not necessarily SLR( 1). Is it True or false??

answered Mar 7 in Compiler Design by Ram Swaroop (270 points) | 22 views

0 votes

0 answers

CIL EXAM 2020 CD
Generation of intermediate code based on an abstract machine model is useful in compilers because: Ans A. It enhances the portability of the compiler system program B. It is difficult to generate executable code from high level language program. C. ... are easier for intermediate code generation D. It makes implementation of lexical and syntax analysis easier option A is correct ?

asked Mar 6 in Compiler Design by VIDYADHAR SHELKE 1 (7 points) | 20 views

0 votes

1 answer

Compiler Design Questions
Which of the following code replacements is an example of operator strength reduction? 1.Replace pow(P,3) by P*P*P 2.Replace P*16 by P<< 4 3.Replace P^2 by P*P 4.Replace (P <<5) -P by P*3 Anyone please clarify.

answered Mar 2 in Compiler Design by Kushagra गुप्ता (261 points) | 14 views

0 votes

0 answers

Previous year compiler design question
Compiler design's subjectwise previous year question paper link isn't working.Kindly fix the link..

asked Feb 19 in Compiler Design by souren (28 points) | 8 views

0 votes

0 answers

Gate i dont the year
Check amiguity S->S(S)/E

asked Feb 14 in Compiler Design by Swarnimkuk10 (6 points) | 11 views

0 votes

1 answer

Self doubt Compiler Design
Does there exist any example of Grammer which is LL1 but not LALR1? Or should I conclude that Every LL1 is LALR1

answered Feb 4 in Compiler Design by shashin (1.9k points) | 22 views

0 votes

1 answer

Virtual GATE-FLT2
Is it not LL(1)??How will it be LR(0)? It has a reduce conflict, isnot it?

answered Feb 4 in Compiler Design by SuvasishDutta (209 points) | 70 views

+1 vote

0 answers

compiler#viableprefix
Consider the following grammar productions: S → BB B → aB | b LR(1) item [B→ a.B, a] is valid for which of the following prefix: a) a b) aa c) aaa d) Baa

asked Feb 3 in Compiler Design by kalra05 (73 points) | 60 views

0 votes

0 answers

three address code doubt
which of the following is the form of three address code ? a)x=f(a) b)x=f(a,b)

asked Feb 2 in Compiler Design by eyeamgj (40 points) | 19 views

0 votes

0 answers

Made Easy Test Series 2020_Compiler_Design
Assume +, –, *, / are usual arithmetic operators , + has highest precedence and right associative and – , *, / have equal precedence and left associative . The output of following expression is _____. 18 * 2 – 8 + 9 – 3 * 10 / 5.

asked Jan 30 in Compiler Design by rohit090893 (10 points) | 26 views

0 votes

1 answer

Lexical Analysis No of Token
Can anyone please tell me number of token for the following c statement: ++2;

answered Jan 30 in Compiler Design by shashin (1.9k points) | 29 views

0 votes

0 answers

Self Doubt: LL(1) parsers
If in the LL(1) parsing table, in the follow of a symbol we have 2 same terminals then is it LL(1)? According to me it should not be, as there is ambiguity whenever there are 2 productions possible for a symbol.

asked Jan 29 in Compiler Design by Debapaul (699 points) | 29 views

0 votes

0 answers

Self Doubt: Three address code
What will be the ans $4$ or $2?$ Should we assign new variable each and every time in the $LHS$ in $3-address$ $code$ or is it only the case of $SSA?$

asked Jan 28 in Compiler Design by Debapaul (699 points) | 30 views

0 votes

0 answers

GATE FORUM: COMPILERS
Consider the following translation rules $S→ A \{A.val=0\}$ $A→ A_1 1\{A.val=A_1.val+1\}$ $A→ A_1 0\{A.val=A_1.val\}$ $A→ B\{print(A.val)\}$ The number of $inherited$ $attributes$ are ______

asked Jan 28 in Compiler Design by Debapaul (699 points) | 17 views

0 votes

0 answers

Made Easy Testseries CD

asked Jan 28 in Compiler Design by Dheeraj Varma (22 points) | 22 views

0 votes

0 answers

Find Number of Tokens
Anyone please clarify.

asked Jan 27 in Compiler Design by Shivateja MST (113 points) | 37 views

0 votes

0 answers

Self doubt: ACE Test
$S->aSa|\epsilon$ Is it SLR(1) or not??

asked Jan 27 in Compiler Design by srestha (683 points) | 25 views

0 votes

0 answers

Ace test series : Compiler design

asked Jan 26 in Compiler Design by Chirag Shilwant (180 points) | 16 views

0 votes

0 answers

#COMPILER DESIGN #slr-clr
Does SLR(1) and CLR(1) have same shift entries?

asked Jan 26 in Compiler Design by kalra05 (73 points) | 11 views

0 votes

0 answers

Self Doubt: Previous GO: DM
Let the set of all natural numbers be N. Which of the following are countable sets? The set of all functions from N to {0,1} The set of all functions from {0,1} to N The largest subset of N I, II, and III I and II only ... previous year, but I am facing difficulty in understanding them and thereby answering such questions. Any suggestions will be of much help. Thank u..

asked Jan 25 in Compiler Design by Debapaul (699 points) | 34 views

0 votes

1 answer

Made Easy Mock:2
Consider the following grammar: $S\rightarrow (L) /a$ $L\rightarrow L, S / S$ The maximum size of stack during LL(1) parsing of the input string $w = (a,a)$ is?

answered Jan 23 in Compiler Design by shashin (1.9k points) | 68 views

0 votes

0 answers

GATE GURU: PARSER

asked Jan 22 in Compiler Design by Debapaul (699 points) | 37 views

0 votes

1 answer

answered Jan 22 in Compiler Design by shashin (1.9k points) | 34 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 Jan 21 in Compiler Design by Priyansh Singh (257 points) | 23 views

0 votes

0 answers

made easy test series compiler design SLR1

asked Jan 21 in Compiler Design by Dheeraj Varma (22 points) | 27 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 Jan 19 in Compiler Design by neeraj_bhatt (275 points) | 7 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 Jan 19 in Compiler Design by neeraj_bhatt (275 points) | 19 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 Jan 19 in Compiler Design by neeraj_bhatt (275 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 Jan 19 in Compiler Design by neeraj_bhatt (275 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 Jan 19 in Compiler Design by neeraj_bhatt (275 points) | 5 views

0 votes

0 answers

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

asked Jan 19 in Compiler Design by srestha (683 points) | 18 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 Jan 18 in Compiler Design by DukeThunders (415 points) | 7 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 Jan 18 in Compiler Design by DukeThunders (415 points) | 7 views

0 votes

1 answer

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

answered Jan 17 in Compiler Design by Rudr Pawan (734 points) | 37 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 Jan 17 in Compiler Design by Debapaul (699 points) | 18 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 Jan 16 in Compiler Design by shashin (1.9k points) | 31 views

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

Recent questions and answers in Compiler Design

3,511 questions

1,656 answers

10,449 comments

90,037 users