Dark Mode

Recent questions tagged compiler-design

0 votes

1 answer

151

Min number of register needed for this program without spilling ?

Kabir5454 asked in Compiler Design Jan 3, 2023

700 views

0 votes

1 answer

152

Made Easy Textbook Problem | Compiler Design | CLR(1) | Look-a-heads
Let G be any grammar with the following productions: X → X+Y | Y Y→ Y*Z | Z Z → (X) Z → id If LR(1) parser is used to parse the above grammar, then total how many look-a-heads are present for the item “X→.Y” and “Z →.id” in the initial state?

Souvik33 asked in Compiler Design Jan 1, 2023

845 views

1 vote

0 answers

153

Unacademy AIMT 1
The correct answer given is 3.

TusharKumar asked in Compiler Design Dec 23, 2022

596 views

0 votes

1 answer

154

Parsing Table | Shift Reduce Parsers | Numerical Answer
Consider the following statements regarding the Parsing Table of a shift reduce parser, for any given grammar No. of states/ size of parse table is same for all Shift-Reduce Parsers. No. of states/ size of parse table in LR(0), SLR(1 ... CORRECT statement is _______ (For example, if statement 1 and 7 are correct, answer would be 1+7, i.e. 8)

Souvik33 asked in Compiler Design Dec 11, 2022

670 views

0 votes

2 answers

155

Attributes in syntax directed translation
Attributes are said to be of two type, synthesised and inherited. What actually is an attribute? Why an attribute exist, how to define it?

Subhadeeppathak asked in Compiler Design Nov 28, 2022

by Subhadeeppathak

433 views

0 votes

0 answers

156

#CompilerDesign #made-easy-test-series
what should be the ans?? according to me answer should be 7 nodes, 8 edges but 5 nodes, 6 edges is given in the answer key! please tell me what am i doing wrong.

jay03 asked in Compiler Design Nov 28, 2022

by jay03

514 views

0 votes

1 answer

157

Compiler Design self Doubt
"Every Regular Grammar has a Right linear grammar and this is LL(1)" What is meaning of this statement exactly and does it hold always? My Assumptions: If a grammar is right linear grammar then it can be parser by LL(1) ->I ... right linear grammar. But this is not suffice to make grammar LL(1). Correct if I assumed anything wrong with some intutive answer.

vishnu777 asked in Compiler Design Nov 25, 2022

356 views

2 votes

0 answers

158

h4kr asked in Compiler Design Nov 22, 2022

by h4kr

154 views

2 votes

0 answers

159

h4kr asked in Compiler Design Nov 19, 2022

by h4kr

335 views

0 votes

0 answers

160

Compiler principles Techniques and Tools
For sr 7,11- 1. i.Strings of 0's and 1's of the form aa', where a is binary string and a' is reverse of a. ii. Binary string of the form xy s.t. x!=y. Total length of xy is even, each of x and y be of odd length

_harshit__01 asked in Compiler Design Nov 14, 2022

by _harshit__01

243 views

Page:

« prev
1
2
3
4
5
6
7
8
9
10
11
...
67
next »

Recent questions tagged compiler-design