A bit confused about whether this grammar is ambiguous or notC' -> CC -> d C u CC -> d CC -> I tried building the DFA for this but I get this in one of the states:C -> d C DOT u C, $    C -> d C DOT, $Isn't this a shift-reduce conflict, so surely it means the grammar is not LR(1)? Or does it reduce regardless since $ and u are both in the follow set of C? Is this not a reduce-reduce conflict since it goes to C regardless? 
Is this grammar LR(1)?
context free;formal grammars;lr k