A graph of programming languages connected through compilers

Post by kodablah » Fri, Jul 06, 2018, 2:34 PM UTC

andyonthewings wrote: post #15

Looks like everyone want to add some missing info. The github source code link can be found at the top right corner. For easy reference, here it is https://github.com/mohd-akram/languages

Post by sorokod » Fri, Jul 06, 2018, 2:57 PM UTC

taejo wrote: post #78

sorokod wrote: post #46

Earlier quoted context omitted.

Like when you auto-translate English -> Japanese -> English. Very unlikely you will recover the original Good fun though.

By the pigeonhole principle, any such iteration must either enter a cycle, or the translations must be unbounded in length. If you experiment, you will find that Google Translate usually lands in the first category; transpilers usually land in the second.

Post by pohl » Fri, Jul 06, 2018, 3:33 PM UTC

hiimnate wrote: post #65

ThJ wrote: post #63

I tried in vain to find WebAssembly. Why would you include JavaScript but not WebAssembly in a graph that has LLVM in it?

It does have WebAssembly, but its incorrectly labeled as targeting Java Bytecode.

Post by amelius » Fri, Jul 06, 2018, 3:43 PM UTC

chrisseaton wrote: post #80

amelius wrote: post #70

Earlier quoted context omitted.

But let's say, they added "decompilers" to the graph, and there is (say) a decompiler from machine code to C. Then I'd assume, because there is a path in the graph from JavaScript to C (going through machine code), that I can translate from JavaScript to C. Except this isn't true because V8 is a JIT, and doesn't output its internal representation.

It's not a graph of compilers to a file on disk . It's a graph of compilers. Just because it exists only in memory doesn't mean it doesn't exist. Has the JavaScript been compiled to machine code. Yes, it has. You mean that the JavaScript compilation is only valid for a given application at a given point in time? Yes that's true.

Post by technologia » Fri, Jul 06, 2018, 4:04 PM UTC