ex__natural_number_arithmetic_grammar__unambiguous.tex

\documentclass{classes/forest}

\begin{document}
  \begin{forest}
    [
      \( E \), for tree={l=0}
        [
          \( N \)
            [\( \syn0 \)]
        ]
    ]
  \end{forest}

  \begin{forest}
    [
      \( E \), for tree={l=0}
        [
          \( N \)
            [\( \syn1 \)]
        ]
    ]
  \end{forest}

  \begin{forest}
    [
      \( E \)
        [\( ( \)]
        [\( T_1 \), SmallSubTree]
        [
          \( O \)
            [\( a_k \)]
        ]
        [\( T_2 \), SmallSubTree]
        [\( ) \)]
    ]
  \end{forest}

  \begin{forest}
    [
      \( E \), for tree={l=0}
        [
          \( N \)
            [\( \syn1 \)]
            [
              \( B \)
                [\( a_2 \)]
                [
                  \( \vdots \)
                    [\( a_{n-2} \)]
                    [
                      \( B \)
                        [\( a_{n-1} \)]
                        [
                          \( B \), edge=dotted
                            [\( a_n \), edge=dotted]
                        ]
                    ]
                ]
            ]
        ]
    ]
  \end{forest}
\end{document}