search
Log In
0 votes
286 views
Consider the below given grammar:
S→(A
S→B]
S→C)
A→B)
A→C]
B→D
C→D
D→ϵ
The number of states in LALR(1) canonical item set are _______ and number of inadequate states (if any) in LALR(1) canonical item set is/are ____________respectively.
in Compiler Design 286 views
2
13 states. and no conflicted states. 0 inadequate.
0
please provide your diagram bro
0

Ashwin plz verify if you still have it :p

0
i thinks their are 13 states and one state is inadequate. as lookahead of b->d. and c->d. is same for state 6. correct me if i am wrong

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
298 views
Consider the below given grammar: A→AA+ A→a The number of states in CLR(1) canonical item set are _______ and number of inadequate states in LALR(1) canonical item set is/are _______ respectively.
asked Nov 27, 2017 in Compiler Design Parshu gate 298 views
0 votes
1 answer
2
582 views
If LALR(1) parser have shift reduce conflict then CLR(1) parser must have shift reduce conflict, why?
asked Jan 20, 2019 in Compiler Design Badayayash 582 views
0 votes
0 answers
3
0 votes
2 answers
4
501 views
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 ),]
asked Nov 1, 2018 in Compiler Design sripo 501 views
...