Context free grammar -- set of all curly braces?

Question

I'm looking for a context free grammar for the set of all matching curly braces ( '{' '}' ).

Does anyone have a clue? I'm having a terrible time understanding this grammar stuff...

Answer 1

It's only a guess but...

S -> {S}

would generate {}, {{}}, {{{}}}, etc

or

S -> S{}

would generate {}, {}{}, {}{}{}, etc

I'm not sure what you are asking exactly, but I reckon it's one of those ;)

Rawlyn.

Answer 2

In Timbuktu does not matter which it is. Both don't make since to me. So come to Timbuktu where there is none of your regular grammar and a context-free grammar. Mmmmmmmmk by by!

Answer 3

Rules for balancing braces are:

if w is balanced then you can surround them with braces, that is, { w } is balanced

if w1 and w2 are balanced then you can join them, that is, w1 w2 is balanced

The empty string, e is balanced.

Example: {{{}{}}{}}{{}{{}}} is balanced

Here is the grammar
B --> BB | { B } | e

Answer 4

I thought they were only used in math or computer programming. What does it have to do with grammar?