Effective translation of directed acyclic graphs to intermediate representation
How to make translation to intermediate representation more effective? I suggest a tiny improvement to typical DFS-based algorithm that improves performance.
How to make translation to intermediate representation more effective? I suggest a tiny improvement to typical DFS-based algorithm that improves performance.