List of top Compiler Design Questions on LR Parsing and Bottom-Up Parsing asked in GATE CS

Consider the canonical \(LR(0)\) parsing of the grammar below using terminals \(\{a,b,c\}\) and non-terminals \(\{A,B,C,S\}\) with \(S\) as the start symbol.
\[ S \to ACB \]
\[ A \to aA \mid \epsilon \]
\[ C \to cC \mid \epsilon \]
\[ B \to bB \mid b \]
Which one of the following options gives the number of shift-reduce conflicts that will occur in the \(LR(0)\) ACTION table?