Recent questions tagged compiler-design - GATE CSE Doubts

0 votes

0 answers

ACE test :Compiler1
Please tell me, how C) should be correct ans in RMD?

asked Oct 18 in Compiler Design by srestha (1k points) | 15 views

0 votes

0 answers

#self doubt on the 3-address code
given the code program below sum=0 for(i=0;i<=10;i++) sum=sum+a[i] the number of temporary variables required to convert the above program into a 3-address code is ? i have done it in 2 ways which of those is the correct one? if ... share the correct answer. also in 3-address code can we reuse the temporary variables as i have done in answer2 ? if not why?

asked Oct 17 in Compiler Design by abhijeet at (7 points) | 8 views

0 votes

1 answer

doubt from compiler
in gate if asked float a=10; is a semantic error or not? we know implicit conversation is done by compiler automatically..i am doubtful if it's a semantic error or not

asked Oct 10 in Compiler Design by Sneha negi (5 points) | 26 views

0 votes

0 answers

I have a LL(1) problem
S -> Abc|aAcb A -> b|c|ε I think the first one is LL(1) S -> aAS|b A -> a|bSA But the problem is second one. There's no conflict problem, but I think it doesn't satisfy right-recursion. I'm not sure about those problems.

asked Oct 1 in Compiler Design by hjj0525 (5 points) | 8 views

0 votes

0 answers

Igate review test
Consider the following C program: main () { in /*this program has error */x; float /*no error */y; print f ("its very simple"); } Identify the error produced by the above code: (A) Lexical (B) Syntax (C) Both(A) & (B) (D ... in is not defined identifier. But, I am confused as no return type to main() can also generate a syntax error. Which should be considered first?

asked Sep 30 in Compiler Design by abhi97.dutta (5 points) | 15 views

0 votes

1 answer

Made Easy Practice Set
Match list-1 and List-2: List 1: compilation, interpretation, macro definition, loading List 2: runtime specification, exception, object specification, abbreviation Can any help me to get a correct match, I am unable to understand a single match ... specification? Please help clarifying the meaning of every single term used in list 1 and list 2 and correct answer also.

asked Sep 29 in Compiler Design by Mohitac (5 points) | 11 views

0 votes

1 answer

Made easy workbook
Consider the rule of C programming language, "every variable must be declared before its use". In which of the following phase of compiler will an error violating this rule be detected? Code Generation Lexical analysis Semantic analysis Syntax analysis

asked Sep 29 in Compiler Design by Mohitac (5 points) | 23 views

0 votes

0 answers

Compilers Ullman 2nd Edition, Page No. 542, Exercise 8.5.6

asked Sep 16 in Compiler Design by infodevesh (5 points) | 20 views

0 votes

0 answers

Self Doubt (PYQs)
https://gateoverflow.in/84033/gate1990-2-ix In this question the answer says that Abelian Groups are matched with Push Down Automata. Can someone explain why is it so?

asked Sep 9 in Compiler Design by Mellophi (333 points) | 9 views

0 votes

0 answers

Previous year question
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbol that occur in a two pass assembler respectively are

asked Sep 1 in Compiler Design by pal98 (5 points) | 12 views

0 votes

0 answers

LL(1) Parsing
Consider the following grammar: E → TE' E → '+E\ε T → FT' T' → T\ε F → PF' F’→ * F'\ε P → (E)\A\B\ε i. Compute First and Follow for each nonterminal of the above grammar ii. Show the grammar is LL(1) iii. Construct the predictive parsing table for the grammar

asked Aug 31 in Compiler Design by abhish1mishra (5 points) | 6 views

0 votes

0 answers

Gate previous year question
https://gateoverflow.in/1837/gate2006-59 in this ques why we used depth first left to right approach to parse the grammar since it is not mentioned in the ques which way we should parse it??we could have used reverse RMD also??

asked Aug 26 in Compiler Design by Ashutosh777 (67 points) | 45 views

0 votes

0 answers

ACE Test Series : Subject Wise Test Compiler Design

asked Aug 25 in Compiler Design by Raj Bopche (5 points) | 19 views

0 votes

1 answer

Compiler and its phases
What is the number of tokens in the following C statement: int array[7][8][9]; i >= j ? i : j ;

asked Aug 24 in Compiler Design by abhish1mishra (5 points) | 20 views

+1 vote

1 answer

Curated list of Questions on Dataflow Analysis and Liveliness Detection?

asked Aug 23 in Compiler Design by siddharths067 (11 points) | 43 views

0 votes

0 answers

Do I need to study Operational Semantics in Compiler Design for GATE?

asked Aug 17 in Compiler Design by siddharths067 (11 points) | 34 views

0 votes

0 answers

Self Doubt (Compilers)
What is the maximum and minimum number of reduce moves needed by a bottom up parser with epsilon and unit productions removed? Please answer with proper explanation and references.

asked Aug 11 in Compiler Design by Mellophi (333 points) | 15 views

0 votes

0 answers

Made Easy Test Series TopicWise

asked Aug 11 in Compiler Design by Mellophi (333 points) | 22 views

0 votes

1 answer

Made Easy Test Series TopicWise

asked Aug 11 in Compiler Design by Mellophi (333 points) | 79 views

0 votes

1 answer

compiler -design(LALR parser)
Of the foll. statements which of them is true? S1:Grammar which are parsed by LALR(1) parser cannot be parsed by LL(1) S2:Grammar which are parsed by LL(1) must be parsed by LR(1) S3:there is only one lookahead symbol in LALR. i know s1 is false and s2 is true but what about s3?

asked Aug 10 in Compiler Design by abcd9982 (87 points) | 52 views

0 votes

2 answers

Does anyone have videos of Compilers by Alex Aiken?

asked Aug 10 in Study Resources by siddharths067 (11 points) | 46 views

0 votes

1 answer

#compiler design

asked Aug 9 in Compiler Design by Suchismita1 (5 points) | 21 views

0 votes

1 answer

#Gate forum book #compiler design

asked Aug 9 in Compiler Design by Suchismita1 (5 points) | 15 views

0 votes

1 answer

#Gate forum book # Compiler design

asked Aug 9 in Compiler Design by Suchismita1 (5 points) | 13 views

0 votes

1 answer

#Gate Forum Preparation #Compiler design

asked Aug 9 in Compiler Design by Suchismita1 (5 points) | 17 views

0 votes

1 answer

#Gate Forum Book #Compiler design

asked Aug 9 in Compiler Design by Suchismita1 (5 points) | 16 views

0 votes

1 answer

#Gate Forum Book

asked Aug 9 in Compiler Design by Suchismita1 (5 points) | 14 views

0 votes

1 answer

GeeksforGeeks CD quiz

asked Aug 8 in Compiler Design by Kindaichi (15 points) | 16 views

0 votes

1 answer

GeeksforGeeks CD quiz
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar? A. Removing left recursion alone B. Factoring the grammar alone C. Removing left recursion and factoring the grammar D. None of these Option (d) is given as the answer. How? Option c should be correct, no?

asked Aug 8 in Compiler Design by Kindaichi (15 points) | 15 views

0 votes

0 answers

Which of the following is/are global variables used in flex:

asked Aug 6 in Compiler Design by toppoavinash (5 points) | 19 views

0 votes

0 answers

Syntax Directed translations
I know that for inherited attributes, the evaluation order is left to right depth first and for synthesized top down or post order. In case of L-attributed SDT, having both synthesized and inherited attributes, in what order translation ... parsers will differ in carrying out these translation when both type of attributes are present?Please explain with an example.

asked Jul 31 in Compiler Design by Lovejeet Singh (5 points) | 6 views

0 votes

0 answers

LL(K) parser
Does LL(K) allow indirect left recursion(“I know that direct recursion is not allowed”)?

asked Jul 26 in Compiler Design by Hitesh Chordiya (5 points) | 25 views

0 votes

1 answer

Self Doubt: compiler Design
Is there any parser that can parse left recursive grammar?

asked Jul 10 in Compiler Design by gaurav2697 (5 points) | 12 views

0 votes

0 answers

self doubt: compiler design
S → XY X → YS / a Y → YSYX / aYX / b eliminate left recursion (left recursion is present in last line of grammar, how can i remove it)

asked Jul 8 in Compiler Design by pppankajsaini (9 points) | 9 views

0 votes

0 answers

first and follow -self duobt
S → SA/A A → T/a T → TA/ϵ find first(S), first(A), first(T) find follow(S), follow(A), follow(T)

asked Jul 2 in Compiler Design by pppankajsaini (9 points) | 6 views

0 votes

0 answers

In Compiler Construction course While mapping the conditions for the Shift and Reduce actions in SLR table

asked Jun 25 in Theory of Computation by Arsalan Sheikh (5 points) | 12 views

0 votes

1 answer

A grammar with production rules { A ->Ba|Cb, B->CA, C->c|ε contains a) left factor b) left recursion c) both d) none

asked Jun 22 in Compiler Design by faizalkhan (5 points) | 96 views

0 votes

0 answers

Why we need the closure of LR(0) items?
In LR(0) parser we construct the dfa and in the dfa states we enter the closure of LR(0) items. ex - S` ->.S S-> .a Here we enter all the productions of grammar where there is . before non terminal. Why we need to do that?

asked Apr 21 in Compiler Design by darshansharma_ (5 points) | 37 views

0 votes

0 answers

#Syntax Directed Translation #self doubt
I have a L-attributed SDT, having both synthesised and inherited attributes.Why is it said that this SDT must be solved using depth first, left to right manner?Because its OK for inherited attributes, but synthesised attributes . ... is not satisfactory.https://cs.stackexchange.com/questions/86183/how-do-we-evaluate-semantic-actions-in-l-attributed-sdt

asked Apr 19 in Compiler Design by ayush3298 (5 points) | 10 views

0 votes

1 answer

Why we need to remove null production from grammar?

asked Apr 19 in Theory of Computation by darshansharma_ (5 points) | 25 views

Page:

1
2
3
4
...
9
next »

8,430 questions

2,707 answers

13,232 comments

95,452 users