$\mathrm{LL}(1)$ parser uses backtracking

For a grammar to be $\mathrm{LL}(1)$, it must be left-recursive

For a grammar to be $\mathrm{LL}(1)$, it must be left-factored

The $\mathrm{LL}(1)$ parsers are more powerful than the SLR parsers

An attribute grammar is a syntax-directed definition (SDD) in which the functions in the semantic rules have no side effects

The attributes in a L-attributed definition cannot always be evaluated in a depth-first order

Synthesized attributes can be evaluated by a bottom-up parser as the input is parsed

All L-attributed definitions based on LR(1) grammar can be evaluated using a bottom-up parsing strategy

Shift-reduce Parser

Predictive Parser

LL(1) Parser

LR Parser