Thanks foryour quick answer!
Reason for asking is, I'm currently hacking a bit on a Neko compiler for
Parrot :-). As both VMs have a common (sub)goal, I thought it might be
nice to do so (and I just like writing parsers :-)
As the grammar is LL(1) (after removing left recursion, hope that went
alright), it was pretty easy to implement it. So, a few hours of hacking
gave me an almost complete parser; everything should be working except
for the binary operator precedences. I'll think about implementing those
a bit later.
However, as I said, it *should* be working, but I should have quite a
large test suite, in order to check all cases.
So, if there are people who want to share their Neko source, they're
more than welcome. (if not, I can understand w.r.t. copyrights, licenses
and what-ever)
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"?
klaas-jan
Nicolas Cannasse wrote:
yes it's there. Anyway, I just downloaded a binary version, a bit easier :-)
Another question: Is there some test suite (for instance "make test") in
order to test the neko compiler?
you should be able to run "neko test.n" that will do some quick test.
There is no complete test suite.
Or is there any distribution of example files, which can be used to
learn Neko?
No, but there is a complete language specification which contain some
samples and should be enough to learn Neko :
http://nekovm.org/specs
and the builtins & libraries documentation :
http://nekovm.org/doc/libs
Nicolas
--
Neko : One VM to run them all
(http://nekovm.org)
