Recent questions and answers in Compiler Design - GATE CSE Doubts

0 votes

1 answer

Made Easy : Compilers
Consider the following grammar, where set of non terminals are {S,A,B,C} and set of terminals are {e,f,g, t} S→ SeA | A A→AfB | B B→BgC | C C→t If CLR(1) parser is used to construct the DFA (sets of CLR(1) canonical items) for above grammar, then number of look-ahead for an item B→ •Bgc in initial state are _______

answered 13 hours ago in Compiler Design by Satbir (2.5k points) | 11 views

0 votes

0 answers

TextBook Test-series Compiler design Topic-test-3
Is it question correctly formed or not? If possible elaborate a little bit.

asked 3 days ago in Compiler Design by Nitesh Singh 2 (7 points) | 10 views

0 votes

0 answers

self doubt- why shift-reduce parser and bottom-up parser works differently on an SDT?

asked 3 days ago in Compiler Design by Nitesh Singh 2 (7 points) | 5 views

0 votes

0 answers

GATE 2018 interrupt self doubt
Why the answer is NOT B? In my opinion it is not always the case that the processor always completes the execution of current program and then service the interrupt. U can see the TRAP interrupt in INTEL 8085 processor, where the interrupt is services immediately ... u will surely die. But what it does is what is mentioned in option B. So how come option a is right?

asked 3 days ago in Compiler Design by Debapaul (117 points) | 19 views

0 votes

1 answer

MADE EASY 2020 COMPILERS
A grammar has no epsilon and unit productions. The maximum number of reduce moves that can be taken during bottom up evaluation of 10 token string by bottom up parsers is ________.

answered 4 days ago in Compiler Design by GAITONDE (1.2k points) | 17 views

0 votes

0 answers

MADE EASY MULTI SUBJECT COMPILERS

asked 4 days ago in Compiler Design by Debapaul (117 points) | 7 views

0 votes

0 answers

MADE EASY CD 2020-21
S’→ A. A→ .A * B B→ .id None

asked 4 days ago in Compiler Design by Debapaul (117 points) | 10 views

0 votes

0 answers

MADE EASY COMPILER DESIGN 2020

asked 4 days ago in Compiler Design by Debapaul (117 points) | 13 views

0 votes

0 answers

MADE EASY FULL LENGTH: COMPILERS
let x be the number of nodes and y be the number of edges in DAG, then x+y =__________ [closed]

asked Oct 14 in Compiler Design by Debapaul (117 points) | 13 views

0 votes

0 answers

Compiler design-self
Can anyone explain how Token,lexemes and pattern work? I am not getting the whole picture.Why we need lexemes and pattern?

asked Oct 13 in Compiler Design by kshitij (13 points) | 11 views

0 votes

1 answer

Self doubt: type of error
(1) char p="gate; (2) int /* n; (3) printf("%d, n); Which of them will results in lexical error?

answered Oct 4 in Compiler Design by Amal (23 points) | 26 views

0 votes

0 answers

Number of SR and RR conflicts
For given grammar : S→ SS/a/epsilon Find the number of SR and RR conflicts in dfa with LR(0) items.

asked Oct 2 in Compiler Design by Lasani Hussain (6 points) | 6 views

0 votes

0 answers

#Personal Doubt
True Or False No of Shift Entries will be same in LR(0),SLR(1),LALR(1) tables always No of Shift Entries will be same in LR(0), CLR(1) tables always No of Shift Entries will be same in SLR(1),CLR(1) tables always No of Shift Entries will be same in LALR(1),CLR(1) tables always No of Reduced Entries are different in LR(0),SLR(1),LALR(1),CLR(1) tables always

asked Oct 1 in Compiler Design by Dipanshu Rana (15 points) | 8 views

0 votes

0 answers

self doubts {what is first of B and follow of A}
$S\rightarrow AB|CD $ $A\rightarrow a|b$ $B\rightarrow dB|Se|\epsilon$ $C\rightarrow f$ $D\rightarrow g$

asked Sep 30 in Compiler Design by altamash (41 points) | 13 views

0 votes

0 answers

Made Easy test series 2020: CD test
Which of the following is correct? (A) One of the purpose of using intermediate code in compiler to improve the register allocation. (B) node of the tree is synthesized attribute. (C) The storage used for heap section can grow at run time but not stack section. (D) None of these.

asked Sep 30 in Compiler Design by Verma Ashish (262 points) | 15 views

0 votes

1 answer

Self Doubt :Compiler Design
Aren’t SLR(1) and LALR(1) parsers the same. For example consider this production, $E→ BB $ $B→ c B / d$ LALR(1) and SLR(1) have the same parsing table for them right? Even if we generalize, the logic of LALR(1) is just same as SLR(1) right? Both producing in the same way.

answered Sep 27 in Compiler Design by GAITONDE (1.2k points) | 9 views

0 votes

0 answers

Compiler Design -Topological Sorting
Choose the correct statements. Topological sort can be used to obtain an evaluation order of a dependency graph Evaluation order for a dependency graph dictates the order in which the semantic rules are done code generation depends on the order in which the semantic actions are performed only (a) and (c) are correct

asked Sep 25 in Compiler Design by pass_i0n (10 points) | 10 views

0 votes

0 answers

Compiler Design
Choose the correct statements: Sentence of a grammar is a sequential form without any terminals Sentence of a grammar should be derivable from the start state Sentence of a grammar should be frontier of a derivation tree, in which the root node has the start state as the label d. (a) above is incorrect

asked Sep 25 in Compiler Design by pass_i0n (10 points) | 21 views

0 votes

0 answers

Parsing and Syntax directed translation GATE CS 1997

asked Sep 24 in Compiler Design by pass_i0n (10 points) | 13 views

0 votes

1 answer

madeeasy sectional test 1 compiler design gate 2020

answered Sep 23 in Compiler Design by Satbir (2.5k points) | 17 views

0 votes

0 answers

Madeeasy sectional test -1 compiler design gate 2020

asked Sep 23 in Compiler Design by Pratyush Priyam Kuan (72 points) | 17 views

0 votes

2 answers

Compilers Principles and Techniques Chapter 4
Consider the family of grammars G, defined by: $S \to A{_i}b{_i}$ for 1 ≤ i ≤ n $A_i \to a_j A_i | a_j $ for 1 < i,j < n and i ≠ j Show that: a) G has $2n^{2} - n$ productions. b) G has $2^{n} + n^{2} + n$ sets of LR(0) items. c) G is SLR(1). What does this analysis say about how large LR parsers can get?

answered Sep 16 in Compiler Design by Bikram (1.2k points) | 11 views

0 votes

0 answers

Made easy test sereise
Is following grammar has language which is inherently ambiguous? $S \rightarrow aaAb | aab | A$ $A \rightarrow aaAb | aAb | \epsilon$ I think that this grammar has unambiguous grammar as follow. Let's first rewrite the grammar as below such that this ... to perform $S \rightarrow A$. Please help me with this. I want to know whether this language is inherenly ambigous or not?

asked Sep 13 in Compiler Design by Vimal Patel (217 points) | 14 views

0 votes

1 answer

MADE EASY: COMPILER DESIGN TOPIC WISE
A grammar that has not any 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 bottom up parsers is ________. My ans is 24, but they have given ans as 49..which is right?

answered Sep 12 in Compiler Design by Bikram (1.2k points) | 15 views

0 votes

1 answer

Compiler Design ACE Test Series 31 Doubt
Hello all, I have been trying to understand how to add look aheads in cannonical collection of LR(1) items: This is my approach: It asked for the items in closure of S'→.S, ... $ I am unable to figure out how to get a, b in lookaheads, I am only getting $. Any help is appreciated. Thank you

answered Sep 12 in Compiler Design by Vimal Patel (217 points) | 20 views

+1 vote

1 answer

Made easy Test: COMPILER
Which of the following will give syntax error? I and II II only. IV only. None of these. ANSWER GIVEN IS OPTION D BUT MY ANSWER IS OPTION A. PLEASE SOLVE AND WHAT WILL BE THE CORRECT ANSWER

answered Sep 12 in Compiler Design by Vimal Patel (217 points) | 18 views

0 votes

0 answers

ACE Test Series Compiler Design Test 31 Q13 SDT doubt

asked Sep 10 in Compiler Design by DukeThunders (197 points) | 15 views

0 votes

1 answer

Compiler Design ACE Test Series 31 Q22 First Follow doubt

answered Sep 10 in Compiler Design by GAITONDE (1.2k points) | 20 views

0 votes

1 answer

MADE EASY COMPILERS
Is this grammar LL(1)? Initially the grammar is NOT LL(1) but after removing left recursion it becomes LL(1) right?

answered Sep 7 in Compiler Design by Satbir (2.5k points) | 12 views

0 votes

1 answer

MADE EASY: TOCKEN COUNTING
My ans is 30, but they have given ans as 29...which is correct?

answered Sep 6 in Compiler Design by Satbir (2.5k points) | 23 views

0 votes

0 answers

Compiler design self doubt Made Easy
Is there any lexical error in this program? According to me there is NONE, but according to MADE EASY there is a lexical error and the reason they provided is→ Shouldn’t it should be a semantic error ?

asked Sep 6 in Compiler Design by GAITONDE (1.2k points) | 18 views

0 votes

0 answers

GATE GURU CD: SLR and LALR
[closed]

asked Sep 5 in Compiler Design by GAITONDE (1.2k points) | 13 views

0 votes

0 answers

GATE GURU TEST SERIES: COMPILER DESIGN CONTROL FLOW GRAPH

asked Sep 5 in Compiler Design by GAITONDE (1.2k points) | 7 views

0 votes

0 answers

GATE GURU TEST SERIES: COMPILER DESIGN 2020
Ans given is D, but according to me it should be A.. Which is correct?

asked Sep 5 in Compiler Design by GAITONDE (1.2k points) | 19 views

0 votes

1 answer

Ace Academy booklet question on DAG
Consider the following block of three address statements a = c + d e = a + d d = c + d Then the number o nodes in the DAG constructed for the above block of statement is ______________.

answered Sep 5 in Compiler Design by Satbir (2.5k points) | 13 views

0 votes

0 answers

SELF DOUBT: COMPILER DESIGN / AUTOMATA
S→ pSqS / qSpS / ε Is the given grammar ambiguous? If so draw the 2 distinct parse tree. [closed]

asked Sep 5 in Compiler Design by GAITONDE (1.2k points) | 7 views

0 votes

0 answers

Question writing tips
Sometimes I want to ask questions which have diagramatic representation. I don’t like psoting pics as I don’t receive answers on them. Do anyone know some online resources where I can do the tasks such as drawing DAGs, Syntax Tree, parse tree and state diagrams quickly without wasting much of time.

asked Sep 5 in Compiler Design by `JEET (155 points) | 12 views

0 votes

0 answers

Ace academy booklet questions on Triples
I know the option is (b). I wanted to see the full triple table. Can someone please help in drawing that.

asked Sep 4 in Compiler Design by `JEET (155 points) | 4 views

0 votes

0 answers

Ace academy booklet questions
I know the option is (b). I wanted to see the full triple table. Can someone please help in drawing that.

asked Sep 4 in Compiler Design by `JEET (155 points) | 6 views

0 votes

0 answers

Self Doubt: Compiler Design 2020
Can all unambiguous grammar be parsed by LL(1) parser?

asked Sep 4 in Compiler Design by GAITONDE (1.2k points) | 27 views

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

Recent questions and answers in Compiler Design

1,674 questions

1,085 answers

4,521 comments

89,591 users