Mark all that apply by writing either T $($for true$)$ or F $($for false$)$ in the blank box before each statement. Techniques typically used to implement LL$($k$)$ parsing include:

Parsing tables and a stack$-$based interpreter.

Scanning tables and a runtime queue.

Syntax graphs and a stack$-$based interpreter.

Syntax error handling with a queue$-$based interpreter.

Recursive descent parsers.

Non$-$recursive ascent parsers.