CFG and PDA for the grammar that has perfectly nested parentheses and brackets [closed]

Question

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.

Closed 8 years ago.

I gotta make a CFG and PDA for the grammar that has perfectly nested parentheses and brackets.

S -> [S]
S -> (S)
S -> SS
S -> Epsilon

Not sure if this is correct, or how to make the PDA from it?

Answer 1

take a look at Spirit. It's really worth a deep visit.

Otherwise, your grammar it's so simple that a recursive LL(1) parser should be easy to write.