Do interpreted languages such as Python have a better ability to perform decomposition? Since they execute code line by line, it should be possible for the interpreter to identify data-dependent dependencies.
lament
I'm pretty sure that identifying dependencies in code is at least NP-complete in general (probably undecidable). Reduction to finding an independent set on a graph?
Do interpreted languages such as Python have a better ability to perform decomposition? Since they execute code line by line, it should be possible for the interpreter to identify data-dependent dependencies.
I'm pretty sure that identifying dependencies in code is at least NP-complete in general (probably undecidable). Reduction to finding an independent set on a graph?