title: Creating and Implementing Abstract Syntax Tree in Assembly 86x
body: <p>so i recently started learning Assembly language and im having trouble creating Abstract Syntax Trees (AST) and then implementing them in Assembly. So lets say i have this equation: <code>z = (3 - 2*x)*x - 2*y + 1</code>. So would the following AST be correct, as i know that there are multiple answers, each one differing in implementation?</p>
  
  <pre><code>                             =
                              / \
                             -   *
                            / \   \
                           *   3   *
                          / \     / \
                         2   x   -   +
                                / \  / \
                               x   2 y  1
  </code></pre>
  
  <p>From there, how would i implement this into my code(if the tree is correct)? I dont know where to start unfortunately. Thanks in advance.</p>