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

blank before each item.

Features of the way parsers handle semantic routines

include:

Top$-$down parsers forbid semantic

routines when there is a reduce$-$reduce conflict but not when

there is a shift$-$reduce conflict.

Top$-$down parsers allow semantic

routines anywhere in the RHS of productions.

Both top$-$down and bottom$-$up parsers

only allow semantic routines to be called after the whole

parsing process is complete.

In top$-$down and bottom$-$up parsers, the

semantic stack extends the parallel parser stack by holding

attribute information at compilation time.

When the AST is incomplete, a semantic

routine is always unable to perform any type check

whatsoever.

When insufficient context is available for

a type check, a semantic routine can keep building the AST to

be traversed later and solve such pending actions.