In every cycle $C$ of $G$, the edge with the largest weight in $C$ is not in any MST

In every cycle $C$ of $G$, the edge with the smallest weight in $C$ is in every MST

For every vertex $v \in V$, the edge with the largest weight incident on $v$ is not in any MST

For every vertex $v \in V$, the edge with the smallest weight incident on $v$ is in every MST

S 1 and S 2 have syntactic errors

S 2 has a lexical error and S 3 has a syntactic error

S 1 has a lexical error and S 3 has a semantic error

S1 has a syntactic error and S3 has a semantic error

$\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

$$ \begin{aligned} & \text { B4: }\{b+i\} \\ & \text { B5: }\{c+m\} \end{aligned} $$

$$ \begin{aligned} & \text { B4: }\{g * k\} \\ & \text { B4: }\{c+m\} \end{aligned} $$

$$ \begin{aligned} & \text { B4: }\{g * k, b+i\} \\ & \text { B5: }\} \end{aligned} $$

$$ \begin{aligned} & \text { B4: }\{g * k\} \\ & \text { B5: }\} \end{aligned} $$