LR(0) OR NOT???

learner_geek asked Aug 5, 2017

510 views

1 votes

If i am wrong let me correct.

Compiler Design
compiler-design
lr-parser
grammar
theory-of-computation
context-free-language

+ –

learner_geek asked Aug 5, 2017

learner_geek

510 views

See all

2 2 Comments

Shivam Bhardwaj

commented Aug 10, 2017

Your solution is incorrect. You thought L-> L,S is L-> L/S.

At the second step : L-> .L,S (Not L->.L , .S)

1 votes

learner_geek

commented Aug 10, 2017

Yes! Thanks for point it out I got it@

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

–1 votes

Not LR(0) as you are getting SR conflict.

Mohitkumaraiactr answered Aug 5, 2017

Mohitkumaraiactr

See all

1 1 comment

learner_geek

commented Aug 5, 2017

But given solution is ???

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

8 votes

3 answers

Parshu gate asked Nov 13, 2017

15,461 views

Finding type of Grammar LL(1), OR LR(0) , OR CLR(1) OR LALR(1)
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1) OR LALR(1)

Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...

Parshu gate

15.5k views

Parshu gate asked Nov 13, 2017

Compiler Design
parsing
compiler-design
lr-parser
ll-parser
grammar

+ –

0 votes

3 answers

rahuldb asked Mar 17, 2018

3,370 views

LR(0) Parsing Table
Please anyone create a $LR(0)$ Parsing table on this grammar and show the working of each step: $S' \rightarrow S$ $S \rightarrow S$;$A \mid A$ $A \rightarrow E \mid id := E$ $E \rightarrow E+id \mid id$ Non-Terminals: $S'$ $S$ $A$ $E$ Terminals$: ; := + id$ Please take a screenshot of copy and show in the answer the whole working.

Please anyone create a $LR(0)$ Parsing table on this grammar and show the working of each step:$S' \rightarrow S$$S \rightarrow S$;$A \mid A$$A \rightarrow E \mid id := ...

rahuldb

3.4k views

rahuldb asked Mar 17, 2018

Compiler Design
compiler-design
lr-parser
parsing
grammar

+ –

2 votes

1 answer

Rajesh R asked Oct 23, 2017

1,804 views

Number of states in LR(0)
How many states are there in the following augmented grammar using lr(0) parser ? S -> .Sdollar (Dollar is actually symbol dollar but it's causing formatting issue so I wrote it in words) S -> x / (A) A -> A,S / S In first production do ... times or one time ? S -> S.dollar and S->Sdollar. or only S->S.dollar . Because last symbol is implicit right ?

How many states are there in the following augmented grammar using lr(0) parser ?S - .Sdollar (Dollar is actually symbol dollar but it's causing formatting issue so I w...

Rajesh R

1.8k views

Rajesh R asked Oct 23, 2017

Compiler Design
compiler-design
grammar
lr-parser
numerical-answers

+ –

2 votes

0 answers

rahul sharma 5 asked Oct 14, 2017

1,534 views

Compiler Design:- Number of conflicts in LR(0)
Consider the following grammer:- Stmts -> Stmt | Stmts;Stmt Stmt -> Var =E Var ->id[E] | id E-> id | (E) Find the number of conflicts in LR(0)?

Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?

rahul sharma 5

1.5k views

rahul sharma 5 asked Oct 14, 2017

Compiler Design
compiler-design
lr-parser
grammar
parsing

+ –

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

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 1 comment reply

Please log in or register to add a comment.

Related questions

2 2 Comments

1 1 comment