title: Assembly Theory
body: <p>We're working with assembly. I'm kind of lost. This is a practice question on a study guide:</p>
  
  <hr>
  
  <p>Using hypothetical machines (3-address, 2-address, 1-address and 0-address) and the
  following commands:</p>
  
  <pre><code>load= puts value in address
  add = +
  mult = *
  sub = -
  lda=load in accumulator
  sta = loads from accumulator to memory
  push=copies to the stack
  pop=copies from the stack
  </code></pre>
  
  <p>Show for each machine the instructions to perform the following task:</p>
  
  <pre><code>F=E+(A-C) – (B*E)
  </code></pre>
  
  <hr>
  
  <p>A. Can someone explain how those 4 different machine types differ in terms of the code?
  B. Can someone show me how to do one of the four as a place to start?</p>