I'm sure it must be there. Anyway you can refer here too
But Arjun sir there are various contradicting comments in these posts on GO for linear running time of LR parsers
Here Habibkhan sir has said that it takes O(n) time, but various comments are contradicting his statement..
And even in this also, https://gateoverflow.in/91761/parsers-complexity
Bottom up parsers exhibit O($n^3$) and LR parser being a bottom up parser should do the same i guess.
I am finding it difficult to grasp this concept.. :(
For LR parsers the ideal time complexity is linear time but some methods may take O(n^3) time in the worst case.
so,In more general way, good to take it as an ideal condition, the answer will be A.