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

Question

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?

So what is your question? ... and how does this relate to C++? — Dietmar Kühl, Nov 17 '12 at 19:06
@Dietmar Kühl: Two questions, the first on context-free-grammar, the second about C++ implementation. — CapelliC, Nov 17 '12 at 19:55

score 1 · Accepted Answer · answered Nov 17 '12 at 19:49

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.

answered Nov 17 '12 at 19:49

CapelliC

1 Answers1