AST to Code Translation: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 16: | Line 16: | ||
Currently no algorithms in our database for the given problem. | Currently no algorithms in our database for the given problem. | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:AST to Code Translation - Time.png|1000px]] | [[File:AST to Code Translation - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:AST to Code Translation - Space.png|1000px]] | [[File:AST to Code Translation - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:AST to Code Translation - Pareto Frontier.png|1000px]] | [[File:AST to Code Translation - Pareto Frontier.png|1000px]] | ||
Revision as of 13:04, 15 February 2023
Description
Translate a given abstract syntax tree (AST) into machine-readable code that uses as few registers as possible.
Related Problems
Related: Arithmetic Expression Binary Tree
Parameters
$n$: number of nodes in the tree
Table of Algorithms
Currently no algorithms in our database for the given problem.
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
