I gotta make a CFG and PDA for the grammar that has perfectly nested parentheses and brackets.$\qquad\begin{align} S &\to [S] \\ S &\to (S) \\ S &\to SS \\ S &\to \varepsilon\end{align}$Not sure if this is correct, or how to make the PDA from it?
CFG and PDA for the grammar that has perfectly nested parentheses and brackets
formal languages;automata;formal grammars;context free;pushdown automata