Register

Slr(1)

• retagged by
649 views
2 votes
2 votes
S->aAb/aBc/bAd/bBe

A->g

B->g

How many states in slr(1)
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
abc1 asked Jan 26, 2019
4,082 views
how to check grammar is lr(1)?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals. Does LR(1) can parse all strings that are generated by grammar G.? Please any one help me to how to check it?
consider the grammar G: S->A|B A->a|c B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals.Does LR(1) can parse all strings that are generated by gr...
User Avatar
2 votes
2 votes
1 answer
2
sripo asked Nov 10, 2018
3,291 views
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)
Can you give an example which is not LL(1) but is CLR(1)
User Avatar
8 votes
8 votes
3 answers
3
Parshu gate asked Nov 13, 2017
15,607 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...
User Avatar
0 votes
0 votes
1 answer
4
Shyam Singh 1 asked Dec 10, 2016
1,532 views
SLR(1) Parser
Every SLR grammar is unambiguous. True or False? Why?
Every SLR grammar is unambiguous. True or False? Why?
User Avatar
Link Copied!