On Sun, Nov 4, 2018 at 10:14 PM roger peppe <rogpe...@gmail.com> wrote:
> Perhaps you might want to have a go at trying to translate a slightly more > substantial piece of generic code. For example, this generic implementation > of Dijkstra's algorithm: https://play.golang.org/p/BsktFSFVU0D. I'd be > interested to see what you end up with. > No. This is simply unreasonable busy work. If I'd write a Go-compiler, I wouldn't first manually translate this example to assembly to see what I'd end up with. I'd work bottom-up - look at small, isolated examples, translate *them* manually to get a feel for how the generated code looks. And then translate those small examples into individual translation units that I'd implement and compose. And *then* I would run it on a larger example to cross-check whether the generated code is sane. i.e. I don't feel it's reasonable to expect me to manually translate ever more elaborate examples for you. There's an asymmetry of effort here - it is far easier for you to say "fine, you can translate X, but what about Y" than it is for me to do that translation. What I've done so far should IMO be enough to illustrate the feasibility and generalizability. -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
