Consider the following CFG:
$S\rightarrow Aa\mid ca$
$A\rightarrow c\mid d$
How many conflict occur in $CLR\left ( 1 \right )$ Parsing construction ?
I think $LR\left ( 0 \right )$ there is $1$ conflict, but in $SLR\left ( 1 \right )orCLR\left ( 1 \right )$ there won’t be any conflict. Someone verify it.
yes, I got it now.
Actually lookaheads are not different.
It is same for the above two cases.
by the way can u chk it too https://gateoverflow.in/310828/made-easy-test-series-self-doubt
@balchandar reddy san
If different lookahead, then there won't be any SR conflict in CLR(1). Because, GOTO works only those rows, which have lookaheads
Grammer is not CLR(1) because it have Shift-Reduce conflict.
S->c.a $ (Shift production)
A->c. a (Reduce production)
The shift reduce condition in CLR(1) is that Shifting symbol should not be appearing look ahead list of reducing production.
Here 'a' is shift in 1st production and it also appear look ahead list of 2nd production.
And another alternative grammer is ambiguous it have 2 parse tree for the string 'ca' if the grammer is ambigious it can not be CLR(1)