compiler design

Prince Sindhiya asked May 31, 2018 • retagged Jul 18, 2022 by makhdoom ghaya

283 views

0 votes

Compiler Design
compiler-design
grammar
parsing
lr-parser
test-series

+ –

Prince Sindhiya asked May 31, 2018 • retagged Jul 18, 2022 by makhdoom ghaya

Prince Sindhiya

283 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

It is ambiguous grammar becz we can derive two parse tree from string babab.
If a grammar is ambiguous then it never be SLR,LALA,LR(1)

abhishekmehta4u answered May 31, 2018

abhishekmehta4u

See all

1 1 comment

Prince Sindhiya

commented May 31, 2018

Ok ,it is correct

0 votes

Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

Shivani gaikawad asked May 31, 2018

182 views

compiler design

Shivani gaikawad

182 views

Shivani gaikawad asked May 31, 2018

Compiler Design
compiler-design
grammar
parsing
lr-parser
test-series

+ –

2 votes

1 answer

Prince Sindhiya asked May 31, 2018

230 views

compiler

Prince Sindhiya

230 views

Prince Sindhiya asked May 31, 2018

Compiler Design
compiler-design
grammar
parsing
lr-parser
test-series

+ –

2 votes

0 answers

admin asked Aug 20, 2019

594 views

Ullman (Compiler Design) Edition 2 Exercise 4.8 Question 2 (Page No. 286 - 287)
In Fig. $4.56$ is a grammar for certain statements, similar to that discussed in Question $4.4.12$. Again, $e$ and $s$ are terminals standing for conditional expressions and "other statements," respectively. Build an LR parsing ... inputs: if e then s ; if e then s end while e do begin s ; if e then s ; end

In Fig. $4.56$ is a grammar for certain statements, similar to that discussed in Question $4.4.12$. Again, $e$ and $s$ are terminals standing for conditional expressions ...

admin

594 views

admin asked Aug 20, 2019

Compiler Design
ullman
compiler-design
grammar
parsing
lr-parser
descriptive

+ –

0 votes

0 answers

admin asked Aug 20, 2019

1,060 views

Ullman (Compiler Design) Edition 2 Exercise 4.6 Question 7 (Page No. 258)
Consider the family of grammars $G_{n}$, defined by: $S\rightarrow A_{i}b_{i}$ for $1\leq i\leq n$ $A_{i} \rightarrow a_{j} A_{i}\mid a_{j}$ for $1\leq i,j\leq n$ and $i\neq j$ Show that: $G_{n}$ ... $LR(0)$ items. $G_{n}$ is $SLR(1)$. What does this analysis say about how large $LR$ parsers can get?

Consider the family of grammars $G_{n}$, defined by:$S\rightarrow A_{i}b_{i}$ for $1\leq i\leq n$$A_{i} \rightarrow a_{j} A_{i}\mid a_{j}$ for $1\leq i,j\leq n$ and $i\ne...

admin

1.1k views

admin asked Aug 20, 2019

Compiler Design
ullman
compiler-design
grammar
parsing
lr-parser
descriptive

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

It is ambiguous grammar becz we can derive two parse tree from string babab.

If a grammar is ambiguous then it never be SLR,LALA,LR(1)

1 1 comment reply

Please log in or register to add a comment.

Related questions

0

1 1 comment