Mark all that apply by writing $F($for false$)$ or $T($for true$)$ in the

blank before each item.

Regarding $LR(k)$ parsing:

Parsing table entries contain an action

$($shift$,$ reduce, accept, reject$),$ a next state, and possibly a

production to reduce.

All $LL(k)$ grammars and even some

$LL(k+1)$ grammars are also $LR(k).$

The error recovery techniques available

for recursive descent parsers $($insertion$,$ deletion,

replacement and panic mode$)$ can be adapted to $LR(k)$

parsers.

The class of $LR(k)$ is a subset of the

class of $LL(k)$ grammars.

The $LR(k)$ parser maintains an initially

empty stack of terminal and nonterminal symbols.

Some deterministic context$-$free

languages cannot be described by any $LR(1)$ grammar.