Best language for implementing compilers?

One of the things that makes ML good is that it is pretty hard to make
an error that get past the type checker.


It is not only the matching, which allows easy testing and unpacking
of compound data types, but its insistance that every case is checked
that is useful.


Also functional purity has many advantages.


To answer your question though, Haskell is a language you should be looking at.

Return to the comp.compilers page.
Search the comp.compilers archives again.