LR Parser

In computer science, LR parsers are a type of bottom-up parser that analyze deterministic context-free languages in $O(n)$ time.

Can parse most practical unambiguous grammar, unlike CYK Parser and CYK Parser and Earley Parser which can parse all grammar.

Ondrej CS241E teacher says that LR Parser take around 3 weeks to understand when you take CS444.