Dark Mode

Recent questions tagged parsing

0 votes

0 answers

181

Testbook Test Series: Compiler Design - Parsing

Dheeraj Pant asked in Compiler Design Nov 16, 2018

by Dheeraj Pant

600 views

0 votes

1 answer

182

Ace Test Series: Compiler Design - Left Factoring

Dheeraj Pant asked in Compiler Design Nov 16, 2018

by Dheeraj Pant

2.7k views

1 vote

0 answers

183

MadeEasy Test Series: Compiler Design - Parsing
The answer is only S2. Why not both s2 and s3.. Someone explain this plz..

muthu kumar asked in Compiler Design Nov 15, 2018

541 views

0 votes

1 answer

184

Self Doubt
True or False ..detalied explanation will be helpful 1.Every DCFL has corresponding LR(k) Grammar 2.Every NCFL has corresponding LR(k) Grammar 3.Some NCFL which are not inherently ambigous have LR(k) grammar

jatin khachane 1 asked in Compiler Design Nov 14, 2018

by jatin khachane 1

235 views

0 votes

2 answers

185

Self Doubt
S -> AS | b A -> SA | a Find First and Follow set for folowing grammar

jatin khachane 1 asked in Compiler Design Nov 12, 2018

by jatin khachane 1

3.4k views

1 vote

1 answer

186

self doubt
S->AB A->a B->b this grammar is ambiguous or not. Q2; is it true that the number of left most derivation tree is always equal to number of right most derivation tree.?

eyeamgj asked in Compiler Design Nov 12, 2018

304 views

2 votes

1 answer

187

If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)

sripo asked in Compiler Design Nov 10, 2018

by sripo

3.2k views

0 votes

1 answer

188

test series
A grammar that has not any epsilon production 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 parser is____________.

talha hashim asked in Compiler Design Nov 9, 2018

by talha hashim

504 views

0 votes

0 answers

189

Compiler design
Q1: Consider G :- $X \rightarrow X + Y | Y$ $Y \rightarrow Y*Z|Z$ $Z \rightarrow (X)$ $Z \rightarrow id$ if LR(1) parser is used to parse the above grammar, then total how many lookahead will be present in the dfa state I0 for the items $X \rightarrow .Y \text{ and } Z \rightarrow .id$ ... ------------------------------------------------------------ Someone verify all these answers.

Shubhanshu asked in Compiler Design Nov 8, 2018

643 views

0 votes

3 answers

190

Compiler Design Doubt
S->Aa | Bc A->a B->a 1. Is the above grammer left factored ?? If not ,then do left factoring on it ?? 2. Is above grammer deterministic ?? 3. Is every left factored grammer deterministic ??

Dheeraj Pant asked in Compiler Design Nov 8, 2018

by Dheeraj Pant

887 views

1 vote

1 answer

191

Are right recursive grammars ambiguous?
Are right recursive grammars ambiguous?

sripo asked in Compiler Design Nov 2, 2018

by sripo

929 views

0 votes

2 answers

192

Is the given grammar CLR(1) or not please explain me if there is a shift reduce conflict
S→(X S→E] S→E) X→E) X→E] E→ϵ Is this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E-> epsilon with lookup symbols ),]

sripo asked in Compiler Design Nov 1, 2018

by sripo

2.3k views

0 votes

1 answer

193

Is there shift reduce conflict in this production?
For given production for a LR(1) grammar B->b.C ,$|c here C is non terminal C->c. ,$|c and here c is terminal. $|c are lookup symbols Will there be a shift reduce conflict if a non terminal is visited.Please explain how shift reduce conflict works

sripo asked in Compiler Design Nov 1, 2018

by sripo

537 views

0 votes

1 answer

194

#CD Doubt
#CD compute first and follow for S->SS+\SS*\a

Pavan Karthik asked in Compiler Design Oct 28, 2018

by Pavan Karthik

452 views

0 votes

1 answer

195

LL (1) Parser Compiler Design
If grammar is LL(1) then which of the following is always true? A. It is LALR B. It is LR (1) C. Both A and B Please give answer with necessary explanations as there are different answers in different sites.

Dharmesh Gusai 1 asked in Compiler Design Oct 26, 2018

by Dharmesh Gusai 1

1.3k views

0 votes

1 answer

196

TANCET 2017 EXPRESSION EVALUATION

Balaji Jegan asked in Compiler Design Oct 23, 2018

by Balaji Jegan

259 views

0 votes

1 answer

197

TANCET 2017 Parsing

Balaji Jegan asked in Compiler Design Oct 23, 2018

by Balaji Jegan

235 views

0 votes

1 answer

198

TANCET 2017 Compiler Design

Balaji Jegan asked in Compiler Design Oct 23, 2018

by Balaji Jegan

315 views

0 votes

1 answer

199

Balaji Jegan asked in Compiler Design Oct 23, 2018

by Balaji Jegan

312 views

0 votes

1 answer

200

TANCET 2016 PARSING

Balaji Jegan asked in Compiler Design Oct 23, 2018

by Balaji Jegan

286 views

0 votes

1 answer

201

Compiler self doubt
Can we comment/compare the number of GOTO moves in LALR and CLR CLR and SLR?

manisha11 asked in Compiler Design Oct 21, 2018

429 views

1 vote

1 answer

202

made easy test series
Answer given is 4.

amitqy asked in Compiler Design Oct 19, 2018

by amitqy

404 views

1 vote

1 answer

203

Test_CD1_Q51
Construct the LALR(1) sets of items for the grammar: S’ -> S S -> *SS | a Then, identify, in the list below, one of the LALR(1) sets of items for (A) [S -> a., $\$] (B) [S -> a., +a] (C) [S -> *SS., $\$ + a] (D) [S -> *SS., $\$]

BOB asked in Compiler Design Oct 13, 2018

by BOB

1.7k views

0 votes

1 answer

204

#madeeasy_workbook

Anil Ji asked in Compiler Design Oct 13, 2018

179 views

0 votes

1 answer

205

expression tree
What is the expression tree for a+b+c??

saumya mishra asked in Compiler Design Oct 11, 2018

by saumya mishra

276 views

0 votes

1 answer

206

Self Doubt
What is actual difference between in LALR(1) and CLR(1). please explain this by taking one example.

iamdeepakji asked in Compiler Design Oct 10, 2018

300 views

1 vote

1 answer

207

LL(1) Parsing
To compute FOLLOW(A) for any grammar symbol A a) We must compute FIRST of some grammar symbols. b) No need of computing FIRST of some symbols. c) Maybe compute FIRST of some symbols. d) None of the above. The answer is given as option (A) but if we take ... will definitely in FOLLOW(S) and we didn't computed FIRST of any symbol for it. So option (C) should be the answer.

garvit_vijai asked in Compiler Design Oct 10, 2018

by garvit_vijai

884 views

1 vote

5 answers

208

LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C

syncronizing asked in Compiler Design Sep 22, 2018

by syncronizing

1.7k views

0 votes

0 answers

209

self doubt
Every regular set has an LR(1) grammar. What does this line mean??

Vegeta asked in Compiler Design Sep 19, 2018

by Vegeta

232 views

0 votes

0 answers

210

#selfdoubt #SLR & LALR
Can LALR have more reduce entries than SLR ? As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less than or equal to those in SLR. Is it correct?, please verify.

meghna asked in Compiler Design Sep 19, 2018

by meghna

297 views

Page:

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

Recent questions tagged parsing