Abstract: A modular input device that may be supportably engaged by the hands of the user such that independent hand-specific modules are provided. The modules may include a touchscreen input device that may be utilized to provide inputs to a computing device. The configuration of the modules may include a palm engagement portion and the control surface extending therefrom. The palm engagement surface may coordinate with the fastener to conformingly engage the palm of the user at a proximal portion thereof such that the metacarpophalangeal joints of the user's fingers may retain a full range of motion, thus facilitating improved typing using the touchscreen input device. The hand-specific modules may be configurable and/or adjustable in a number of ways to facilitate different users with varying hand sizes while engaged in varying computing activities.

Abstract: A compiler converts a high level language program into a corresponding machine level language program. The compiler forms an initial control flow graph of the high level language program with nodes and edge, the nodes including a starting node, initializing a collapse count to zero, and sets the initial control flow graph as a current control flow graph. The compiler performs iterative collapsing operations on the current control flow graph until only a single node remains. After performing the iterative collapsing operations, data flow analysis is performed on the initial control flow graph for a number of iterations equal to one greater than the collapse count. Then, the machine level language program corresponding to the high level language program is generated based upon the data flow analysis.

Abstract: A compiler converts a human readable high level program into a corresponding machine language program. This invention improves data-flow analysis. A compiler implementing data-flow analysis typically relies on an iterative algorithm for data-flow analysis. According to the prior art determination of the exact number of loop iterations required for convergence was believed impractical. The prior art selected a maximum number of data-flow analysis iterations relatively arbitrarily. This invention calculates the number of iterations for convergence using backedges in a control flow graph of the source program. This permits the data-flow analysis to be run for exactly the number of iterations needed for convergence. In the event of convergence, an extra, useless iteration is avoided. In the event of non-convergence, valid data can be separated from invalid data, whereas all data was previously discarded.