# What is the time complexity of LR parsers?

Bottom up parsers in worst case take O($$n^3$$) time, and i believe that LR parser being a bottom up parser should also take O($$n^3$$) time, but i read on wiki that they are able to solve problems in linear time. How can this be possible?

• Which "wiki" did you read that? Could you provide a reference or quoted text? – dkaeae Jul 15 at 7:06
• @dkaeae en.m.wikipedia.org/wiki/LR_parser , Moreover see the ans below provided by rici, so he is also suggesting O(n)! – HIRAK MONDAL Jul 15 at 9:07
• @downvoter please explain the proper reason of downvote rather than downvoting without any justification..PEACE – HIRAK MONDAL Jul 15 at 17:19