> Furthermore, one more note/question. I noticed the grammar is rather > "simple", or "free"; that is, many many combinations of (apparently) > random tokens is accepted, for instance, just the token "1", is a > program (it doesn't do anything, but the compiler accepts it). What was > the reason for making the grammar this "free"?
I would say it's great to implement functional languages. Every expression returns a value, there is no "statements" like in C. BTW, I would be interested that you benchmark NekoVM VS Parrot ;) Last time I did, I got pretty good results. Nicolas -- Neko : One VM to run them all (http://nekovm.org)
