Methods and interface for building command expressions in a computer system

Claim 2

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained; and (e) if modifying said expression in step (d) results in at least one addition or deletion of tokens from said expression being created, repeating steps (c) and (d) for all said at least one addition or deletion of tokens.

Claim 3

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said rules are adjustable to a desired target language syntax; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 4

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said rules are adjustable to a desired target language syntax; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 5

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens comprise nonreducible textual elements in said expression being created and wherein said nonreducible textual elements include selected ones of operators, function calls, arguments, and reserved words; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 6

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens comprise nonreducible textual elements in said expression being created and wherein said nonreducible textual elements include selected ones of operators, function calls, arguments, and reserved words; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 7

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said rules comprise a plurality of records, each storing information specifying a type of token which can be placed between an existing pair of tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 8

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said rules comprise a plurality of records, each storing information specifying a type of token which can be placed between an existing pair of tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 9

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained; wherein step (d) includes the step of: placing at least one placeholder token for a token whose absence from the expression would render the expression invalid.

Claim 10

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained; wherein step (d) includes the step of: placing at least one placeholder token for a token whose absence from the expression would render the expression invalid.

Claim 11

The method of claim 5, wherein said at least one placeholder token includes a descriptive message indicating a literal token intended to replace said at least one placeholder token.

Claim 12

The method of claim 5, wherein said tokens comprise at least one operator for specifying an operation to be performed by said computer system on at least one operand.

Claim 13

The method of claim 7, wherein operator tokens are displayed with a first screen highlight and operand token are displayed with a second screen highlight.

Claim 14

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if two operand tokens are adjacent, automatically placing an operator placeholder token between said adjacent operand tokens.

Claim 15

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if two operand tokens are adjacent, automatically placing an operator placeholder token between said adjacent operand tokens.

Claim 16

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if two operator tokens are adjacent, automatically placing an operand placeholder token between said adjacent operator tokens.

Claim 17

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if two operator tokens are adjacent, automatically placing an operand placeholder token between said adjacent operator tokens.

Claim 18

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if an operator placeholder token is adjacent an operand placeholder token, automatically removing said operator placeholder token and said operand placeholder token.

Claim 19

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if an operator placeholder token is adjacent an operand placeholder token, automatically removing said operator placeholder token and said operand placeholder token.

Claim 20

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if an operator token is positioned at an end of said expression being created, automatically placing an operand placeholder token after said operator token.

Claim 21

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if an operator token is positioned at an end of said expression being created, automatically placing an operand placeholder token after said operator token.

Claim 22

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if an operator token is positioned at a beginning of said expression being created and said operator token represents a binary operator, automatically placing an operand placeholder token before said operator token.

Claim 23

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if an operator token is positioned at a beginning of said expression being created and said operator token represents a binary operator, automatically placing an operand placeholder token before said operator token.

Claim 24

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by the steps of: (i) receiving user input for placing an operator token in said expression being created at a position occupied by an operator placeholder token; and (ii) automatically replacing said operator placeholder token with said operator token.

Claim 25

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by the steps of: (i) receiving user input for placing an operator token in said expression being created at a position occupied by an operator placeholder token; and (ii) automatically replacing said operator placeholder token with said operator token.

Claim 26

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by the steps of: (i) receiving user input for placing an operand token in said expression being created at a position occupied by an operand placeholder token; and (ii) automatically replacing said operand placeholder token with said operand token.

Claim 27

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by the steps of: (i) receiving user input for placing an operand token in said expression being created at a position occupied by an operand placeholder token; and (ii) automatically replacing said operand placeholder token with said operand token.

Claim 28

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include a pair of grouping tokens for grouping related ones of said tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained; and (e) if one of a pair of grouping tokens is deleted, automatically deleting the other of the pair.

Claim 29

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include a pair of grouping tokens for grouping related ones of said tokens; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained; and (e) if one of a pair of grouping tokens is deleted, automatically deleting the other of the pair.

Claim 30

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include a function token comprising a function name followed by a left paren, said function token corresponding with it matching right paren token; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if either one of a function token or its corresponding right paren token is deleted, automatically deleting the other.

Claim 31

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include a function token comprising a function name followed by a left paren, said function token corresponding with it matching right paren token; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if either one of a function token or its corresponding right paren token is deleted, automatically deleting the other.

Claim 32

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include a function token comprising a function name followed by a left paren, said function token corresponding with a matching right paren token, and wherein said tokens include comma-delimited function parameter tokens corresponding with a function token, each function parameter token including a descriptive message indicating usage and type for the parameter; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 33

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include a function token comprising a function name followed by a left paren, said function token corresponding with a matching right paren token, and wherein said tokens include comma-delimited function parameter tokens corresponding with a function token, each function parameter token including a descriptive message indicating usage and type for the parameter; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained.

Claim 34

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include comma-delimited function parameter tokens corresponding with a function token; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if a function token is deleted, said function token having corresponding comma-delimited function parameter tokens, automatically replacing each comma delimiter of the parameter tokens with a placeholder operator token.

Claim 35

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising: (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include comma-delimited function parameter tokens corresponding with a function token; (b) receiving user input for placing at least one token in said expression being created; (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if a function token is deleted, said function token having corresponding comma-delimited function parameter tokens, automatically replacing each comma delimiter of the parameter tokens with a placeholder operator token.

Claim 36

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising; (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include comma-delimited function parameter tokens corresponding with a function token; (b) receiving user input for placing at least one token in said expression being created: (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if a function token is placed at a position in the expression before an operand token, said function token having corresponding comma-delimited function parameter tokens, automatically placing the operand token as a first parameter token for the function.

Claim 37

In a computer system for processing expressions entered by a user, the expressions comprising a plurality of tokens which evaluate to a result, a method for assisting the user with correctly creating an expression, the method comprising; (a) storing a set of rules specifying valid relationships between adjacent tokens, wherein said tokens include comma-delimited function parameter tokens corresponding with a function token; (b) receiving user input for placing at least one token in said expression being created: (c) determining validity of said expression being created by applying at least one of said set of rules to adjacent ones of said at least one token; and (d) if said expression being created is determined not to be valid in step (c), automatically modifying said expression so that validity of said expression being created is maintained by, if a function token is placed at a position in the expression before an operand token, said function token having corresponding comma-delimited function parameter tokens, automatically placing the operand token as a first parameter token for the function.

Claim 38

In a system for processing commands entered by a user, the commands including expressions which resolve to a result, a method comprising: (a) receiving input from the user specifying a desired expression; (b) dividing said input into a plurality of tokens, said plurality of tokens including at least one operator token and at least one operand token; (c) determining validity of said desired expression by comparing said tokens against a set of rules specifying valid relationships between tokens; (d) if said desired expression being created is determined not to be valid in step (c), automatically modifying said desired expression so that validity of said desired expression is maintained; (e) placing at least one proxy token for a token whose absence from said desired expression would render said desired expression invalid or incomplete; and (f) using said desired expression in resolving said result.

Claim 39

In a system for processing commands entered by a user, the commands including expressions which resolve to a result, a method comprising: (a) receiving input from the user specifying a desired expression; (b) dividing said input into a plurality of tokens, said plurality of tokens including at least one operator token and at least one operand token; (c) determining validity of said desired expression by comparing said tokens against a set of rules specifying valid relationships between tokens; (d) if said desired expression being created is determined not to be valid in step (c), automatically modifying said desired expression so that validity of said desired expression is maintained; (e) placing at least one proxy token for a token whose absence from said desired expression would render said desired expression invalid or incomplete; and (f) using said desired expression in resolving said result.

Claim 40

The method of claim 21, further comprising: indicating to the user what is needed to render said desired expression valid and complete.

Claim 41

The method of claim 21, wherein each said at least one proxy token is color-coded for representing a required data type.

Claim 42

In a system for processing commands entered by a user, the commands including expressions which resolve to a result, a method comprising: (a) receiving input from the user specifying a desired expression; (b) dividing said input into a plurality of tokens, said plurality of tokens including at least one operator token and at least one operand token; (c) displaying a list of token elements which may be pasted to said desired expression, said list being adjusted according to a user-selected element type; (d) determining validity of said desired expression by comparing said tokens against a set of rules specifying valid relationships between tokens; (e) if said desired expression being created is determined not to be valid in step (d), automatically modifying said desired expression so that validity of said desired expression is maintained; and (f) using said desired expression in resolving said result.

Claim 43

In a system for processing commands entered by a user, the commands including expressions which resolve to a result, a method comprising: (a) receiving input from the user specifying a desired expression; (b) dividing said input into a plurality of tokens, said plurality of tokens including at least one operator token and at least one operand token; (c) displaying a list of token elements which may be pasted to said desired expression, said list being adjusted according to a user-selected element type; (d) determining validity of said desired expression by comparing said tokens against a set of rules specifying valid relationships between tokens; (e) if said desired expression being created is determined not to be valid in step (d), automatically modifying said desired expression so that validity of said desired expression is maintained; and (f) using said desired expression in resolving said result.

Claim 44

A development system for creating an expression from data entered by a user, said expression comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, said system comprising: a computer having a processor and a memory; means for storing in said memory information specifying valid relationships between tokens; input means for receiving user input for placing at least one token in said expression being created; means for determining validity of said expression being created by applying said rules to adjacent ones of said at least one token; means for automatically modifying said expression so that validity of said expression being created is maintained; and means for placing at least one proxy token for a token whose absence from the expression would render the expression invalid or incomplete.

Claim 45

A development system for creating an expression from data entered by a user, said expression comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, said system comprising: a computer having a processor and a memory; means for storing in said memory information specifying valid relationships between tokens; input means for receiving user input for placing at least one token in said expression being created; means for determining validity of said expression being created by applying said rules to adjacent ones of said at least one token; means for automatically modifying said expression so that validity of said expression being created is maintained; and means for placing at least one proxy token for a token whose absence from the expression would render the expression invalid or incomplete.

Claim 46

The system of claim 25, further comprising: means for indicating to the user on a display screen what input is needed to render the expression valid and complete.

Claim 47

The system of claim 25, wherein each said at least one proxy token is color-coded for representing a particular data type.

Claim 48

A development system for creating an expression from data entered by a user, said expression comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, said system comprising: a computer having a processor and a memory; means for storing in said memory information specifying valid relationships between tokens; input means for receiving user input for placing at least one token in said expression being created; means for displaying a list of token elements which may be pasted to the expression with said input means, said list being adjusted according to a user-selected element type; means for determining validity of said expression being created by applying said rules to adjacent ones of said at least one token; and means for automatically modifying said expression so that validity of said expression being created is maintained.

Claim 49

A development system for creating an expression from data entered by a user, said expression comprising a plurality of tokens which evaluate to a result, said plurality of tokens including at least one operator token and at least one operand token, said system comprising: a computer having a processor and a memory; means for storing in said memory information specifying valid relationships between tokens; input means for receiving user input for placing at least one token in said expression being created; means for displaying a list of token elements which may be pasted to the expression with said input means, said list being adjusted according to a user-selected element type; means for determining validity of said expression being created by applying said rules to adjacent ones of said at least one token; and means for automatically modifying said expression so that validity of said expression being created is maintained.

Claim 50

A computer system for creating an expression comprising: a processor and a memory; means for storing information for a desired target language in said memory, said information specifying valid combinations of elements for said expression, said valid combinations of elements comprising at least one element which operates on at least one other element; an interface means for specifying an edit operation at a desired location in said expression, said edit operation for adding or deleting an element, and wherein said interface means includes a display means for listing elements available for placement in the expression; comparison means for comparing said edit operation with said information; and means for automatically modifying said edit operation so that said expression maintains said valid combinations of elements.

Claim 51

A computer system for creating an expression comprising: a processor and a memory; means for storing information for a desired target language in said memory, said information specifying valid combinations of elements for said expression, said valid combinations of elements comprising at least one element which operates on at least one other element; an interface means for specifying an edit operation at a desired location in said expression, said edit operation for adding or deleting an element, and wherein said interface means includes a display means for listing elements available for placement in the expression; comparison means for comparing said edit operation with said information; and means for automatically modifying said edit operation so that said expression maintains said valid combinations of elements.

Claim 52

A computer system for creating an expression comprising: a processor and a memory; means for storing information for a desired target language in said memory, said information specifying valid combinations of elements for said expression, said valid combinations of elements comprising at least one element which operates on at least one other element; an interface means for specifying an edit operation at a desired location in said expression, said edit operation for adding or deleting an element; comparison means for comparing said edit operation with said information, wherein said information includes rules specifying an element which can be legally placed at a given location, said given location being defined by elements neighboring the location; and means for automatically modifying said edit operation so that said expression maintains said valid combinations of elements.

Claim 53

A computer system for creating an expression comprising: a processor and a memory; means for storing information for a desired target language in said memory, said information specifying valid combinations of elements for said expression, said valid combinations of elements comprising at least one element which operates on at least one other element; an interface means for specifying an edit operation at a desired location in said expression, said edit operation for adding or deleting an element; comparison means for comparing said edit operation with said information, wherein said information includes rules specifying an element which can be legally placed at a given location, said given location being defined by elements neighboring the location; and means for automatically modifying said edit operation so that said expression maintains said valid combinations of elements.