[antlr-interest] Grammar to parser a Tree syntax

[Gary Miller]

Hey All,

I'm looking for some feedback on a grammar that creates an AST for a
simple syntax representing a tree.

Tr.g & TrWalker.g
http://pastie.org/1631538

See some examples string and tree string representations below.

The question I have is
A{B}
  1. => (TREE A (NODE B))
better then
  2. => (TREE A (TREE (NODE B)))

If so any suggestions on to generate version 1.

Thanks
Gary

Some examples
A{B C D E} => (TREE A (TREE (NODE B) (NODE C) (NODE D) (NODE E)))
A{B { C } D E} => (TREE A (TREE (NODE B) (TREE (NODE C)) (NODE D) (NODE E)))
A{B { C D } E} => (TREE A (TREE (NODE B) (TREE (NODE C) (NODE D)) (NODE E)))
A{B { C { D } } E} => (TREE A (TREE (NODE B) (TREE (NODE C) (TREE
(NODE D))) (NODE E)))
A{B { C { D { E } } } } => (TREE A (TREE (NODE B) (TREE (NODE C) (TREE
(NODE D) (TREE (NODE E))))))