tree from string

Question

A string like this one:

"a, 4.25, ((true, 5), 3, (false, false, false)), abc"

Describes a tree with 13 nodes, 9 of which are leaf nodes. In C# the leaf nodes in this example would be of types string, float and bool, this differs between languages and depending on your implementation. The important structure forming symbols here are , ( and ) with spaces being ignored.

See the diagram in David Carrahers answer for a tree of the desired shape.

var a = new cake(4, "abc")

The above contains 8 symbols, I'm counting bracket and " pairs as a half and things like . as 1.

The goal is to write code with the fewest symbols which given a string like the one shown above, creates the tree it represents.

For example in the form of arrays inside each other, or interconnecting node objects.

60 extra points if you don't sort of cheat by adjusting the input string slightly then executing it.

I won't count the symbols that define the input string.

daniero
100 - (10 symbols)
+40 points for understanding numbers, strings, bools
    and any other basic types the language understands.
+20 points for using a reasonably general language.
150 total points

fejesjoco
100 - (est 37 symbols)
+20 points for it understanding numbers as well as strings.
+40 points for using a reasonably general language.
97 total points

tomas
100 - (10 symbols)
90 total points

David Carraher
100 - (est 19 symbols)
81 total points

Answer 1

JavaScript

s="a, 4.25, ((true, 5), 3, (false, false, false)), abc"
eval(("["+s+"]").replace(/\(/g,"[").replace(/\)/g,"]").replace(/([a-z]+)/g,"'$1'"))

The exact syntax, input and output format weren't exactly defined... I replace every a-z character to become a string, even true/false, which could be booleans, but there's no indication if there should be a distinction. I don't know if other characters are allowed or not (ő, $, \uFA20, ...), so my code doesn't care about that either.

Answer 2

Mathematica

StringReplace replaces all instances of ( with List[; instances of ) with ].

The FullForm of List must be used (instead of {…}); otherwise ToExpression will not parse the string correctly.

f@t_:=ToExpression["List["<>StringReplace[t,{"("->"List[",")"->"]"}]<>"]"]

---

Example

f["a, 4.25, ((true, 5), 3, (false, false, false)), abc"]

{a, 4.25, {{true, 5}, 3, {false, false, false}}, abc}

---

Verification

TreeForm[<expression>] displays the Mathematica expression as a tree.

TreeForm[f["a, 4.25, ((true, 5), 3, (false, false, false)), abc"]]

Answer 3

R, 36 chars

plot(read.tree(,paste0("(",a,");")))

package ape must be loaded.

Output:

Answer 4

Common Lisp

I think it would count as something around 11 symbols?

Wrap parentheses around the string, remove the commas and evaluate it, and you have a LISP list.

(read-from-string (remove #\, (concatenate 'string "(" s ")" )))

s is the string.

For the given example it returns a list (A 4.25 ((TRUE 5) 3 (FALSE FALSE FALSE)) ABC)