# PDA for parentheses language

Construct a PDA for the language described by the following CFG: $$S \to [S] \mid {S} \mid \Lambda$$

How can I develop a pushdown automaton for this language?