A Java class for parsing type descriptors and class names.

This class is the low-level assembler for Intel; it contains functionality for encoding specific instructions into an array of bytes.

• (1) When possible, it folds null checks into the first load/store that is being guarded by the null check
• (2) It removes all validation registers from the IR

Doing (1) more or less implies either (a) doing (2) or (b) making large changes to the MIR operator set such that all load/stores produce validation results.

A node in the LST (Loop Structure Tree) with added information on:

• Whether this is a countable, affine or non-regular loop
• The registers being used to hold the loop iterator
• The initial loop iterator value
• The terminal loop iterator value
• The instruction that modifies the iterator
• The phi instruction that merges the redefined iterator with its original value
• The condition used to test for loop termination
• The stride operand

• transforming while into until loops,
• elimination of critical edges,

Implementation Note: The set of equations is internally represented as a graph (actually a SpaceEffGraph).

The main driver of the Compiler.

TODO: This would be more effective if formulated as a data-flow problem, and solved with iteration