Redirected
retagged by
7,284 views
6 votes
6 votes
Consider the grammar given below

S⟶ SS | a | ∈

The number of inadequate states in the DFA of LR(1) items is

(a) 1       (b) 2     (c) 3     (d) 4
retagged by

7 Answers

Best answer
7 votes
7 votes

Ans 3

selected by
3 votes
3 votes

Number of inadequate states is nothing but states which has S/R or R/R conflicts

Ref:http://www.cs.nuim.ie/~jpower/Courses/Previous/parsing/node64.html

1 votes
1 votes

finding no of conflict

edited by

Related questions

2 votes
2 votes
0 answers
1
rahul sharma 5 asked Oct 14, 2017
1,534 views
Consider the following grammer:-Stmts - Stmt | Stmts;StmtStmt - Var =EVar ->id[E] | idE- id | (E)Find the number of conflicts in LR(0)?
0 votes
0 votes
3 answers
2
8 votes
8 votes
3 answers
3
Parshu gate asked Nov 13, 2017
15,443 views
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...