Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I see there is some confusion about portability here, so I feel obliged to clarify matters some. These are my humble opinions so you are, of course, free to object against them. </p> <p>I assume you came accross <a href="http://www.complang.tuwien.ac.at/forth/threading/" rel="nofollow noreferrer">http://www.complang.tuwien.ac.at/forth/threading/</a> if you consider writing a VM seriously, so I won't dwell upon the described techniques.</p> <p>Already mentioned, targeting a VM has some advantages such as reduced code size, reduced compiler complexity (often translates to faster compilation), portability (note that the point of a VM is portability of the <em>language</em>, so it doesn't matter if the VM itself is not portable).</p> <p>Considering dynamic nature of your example, your VM will resemble a <em>JIT compiler</em> more than other more popular ones. So, altough S.Lott missed the point in this case, his mentioning of Forth is very on the spot. If I were to design a VM for a very dynamic language, I would separate interpretation into two stages;</p> <ol> <li><p>A producer stage which consults an AST stream on demand and transforms it to a more meaningful form (for example, taking a block, deciding whether it should be executed right away or stored in somewhere for later execution) possibly introducing new kinds of tokens. Essentially you recover context sensitive information that may be lost in parsing here.</p></li> <li><p>A consumer stage fetching the generated stream from 1 and executes it blindly like any other machine. If you make it Forth like, you can just push a stored stream and be done with it instead of jumping instruction pointer around.</p></li> </ol> <p>As you say, just mimicking how the damn processor work in another way doesn't accomplish any dynamism (or any other feature worth a damn, like security) that you require. Otherwise, you would be writing a compiler.</p> <p>Of course, you can add arbitrarily comlex optimizations in stage 1.</p>
    singulars
    1. This table or related slice is empty.
    1. POWhat is the fastest virtual machine design for x86?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USartificialidiot
    1. USartificialidiot
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POWhat is the fastest virtual machine design for x86?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload