\begin{frame}{Exercises}
  \begin{exampleblock}{}
    Can ambiguous grammars be LL$(k)$ for some $k\geq 1$?
  \end{exampleblock}
  \bigskip
  
  \begin{exampleblock}{}
    Is the following grammar LL$(k)$ for some $k\geq 1$?
    \begin{talign}
      S\to aSa\mid \lambda
    \end{talign}
  \end{exampleblock}
\end{frame}