Register

Is below grammar clr and lalr?

1,267 views
1 votes
1 votes
A -> AA+

A -> a

I think it's both clr and lalr . Can someone draw the diagram and answer it please because I want to verify the lookaheads of some states.
User Avatar

1 Answer

0 votes
0 votes

it is neither CLR(1) nor LALR(1) ,

because the given G is not LL(1)

if a G is not LL(1), then it is not CLR(1), if  G  is not CLR(1) then it is not LALR(1)

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

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,247 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
2
Parshu gate asked Nov 13, 2017
15,460 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
1 votes
1 votes
2 answers
4
Shubhanshu asked Aug 30, 2017
4,642 views
LookAhead Symbol in LALR and CLR Parsers.
I am confused in following kinds of Grammar they are;- 1) S - > AB A -> Ba B -> Bb B - > c 2) S - > AB A -> Ba B -> Bb B - > Epsilon 3) S - > AB A -> Ba B -> Bb B - > dollar what ... as look ahead symbol.
I am confused in following kinds of Grammar they are;-1) S - AB A - Ba B - Bb B - c2) S - AB A - Ba B - Bb B - Epsilon3) S - AB A - Ba B - Bb...
User Avatar
Link Copied!