15. An editor in a computer system for generating an intentional program tree representing a computer program, the intentional program tree having nodes representing high-level computational constructs of the computer program, the editor comprising: a tokenizer for receiving a plurality of tokens and identifying a high-level computational construct represented by each token; and a component for adding nodes to the intentional program tree, the nodes representing the high-level computational constructs wherein when a high-level computational construct represents a binary operator selecting a left operand from the plurality of tokens in accordance with predefined rules of operator precedence so long as no portion of the intentional program tree is currently selected.
15. An editor in a computer system for generating an intentional program tree representing a computer program, the intentional program tree having nodes representing high-level computational constructs of the computer program, the editor comprising: a tokenizer for receiving a plurality of tokens and identifying a high-level computational construct represented by each token; and a component for adding nodes to the intentional program tree, the nodes representing the high-level computational constructs wherein when a high-level computational construct represents a binary operator selecting a left operand from the plurality of tokens in accordance with predefined rules of operator precedence so long as no portion of the intentional program tree is currently selected. 16. The editor of claim 15 including a display enzyme for each high-level computational construct and wherein after a token is received, using the display enzyme for the high-level computational construct that the token represents to display a representation of the token.