# US 2026/0087252 A1 · Semantic script language processing

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0087252 A1
- Document ID: US20260087252A1
- Status: Published application
- Kind: A1
- Application number: 19/406,704
- Filed: 2025-12-02
- Published: 2026-03-26
- Earliest claimed: 2022-03-31
- Assignees: Autodesk, Inc.
- Applicants: Autodesk, Inc.
- Inventors: Clayton P. Hotson
- Web page: https://patentgrep.com/patent/US20260087252A1

## CPC

- G06F 40/279: Recognition of textual entities
- G06F 40/30: Semantic analysis
- G06F 40/253: Grammatical analysis; Style critique
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and system provide the ability to process source computer instructions. The source computer instructions are obtained and include input statements that consist of two functions that consume one or more arguments. A legal configuration of the functions and arguments is determined. A first function can be evaluated to yield a non-variable value, and a second function cannot be evaluated to yield a non-variable value. The input statements are compiled into executable code using the determined legal configuration such that during compilation, the first function is executed, and instructions are emitted to execute the second function at an indeterminate time.

## Claims

### Claim 1

A computer-implemented method for processing source computer instructions, comprising:
(a) obtaining the source computer instructions comprising natural language words that represent one or more input statements, wherein:
(1) a first input statement of the one or more input statements comprises two functions; and
(2) the first input statement comprises one or more arguments that are consumed by the two functions;
(b) for the first input statement, determining a legal configuration of the two functions and the one or more arguments
(c) determining that a first function of the two functions can be evaluated to yield a non-variable value;
(d) determining that a second function of the two functions cannot be evaluated to yield a non-variable value;
(e) compiling the first input statement into executable code using the determined legal configuration, wherein during the compiling:
(1) the first function is executed; and
(2) instructions are emitted to execute the second function at an indeterminate time.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein:
parts of speech are defined as grammatical types and notional types; and
the grammatical types and the notional types are used to identify how the natural language words are legally joined in expressions.

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, further comprising:
selecting the first input statement;
selecting one of the two functions in the selected first input statement; and
tagging the selected function and the one or more parameters accepted by the selected function with the grammatical type or the notional type, wherein the determined legal configuration is selected based on the grammatical type and the notional type;
utilizing a stack based evaluation procedure to determine and select the legal configuration.

### Claim 4 (depends on 1)

The computer-implemented method of claim 1, further comprising:
determining for the first input statement:
an inherent numeric precedence weight for each of the two functions and each of the one or more arguments, wherein the inherent numeric precedence weights are based on mathematical order of operations;
all possible legal configurations of the two functions and the one or more arguments, wherein each possible legal configuration comprises a different grouping of the two functions with the one or more arguments consumed by each function;
assigning a score to each of the different groupings, wherein the score comprises a sum of inherent numeric precedence weights within each different grouping;
selecting the different grouping having the highest score; and
selecting the possible legal configuration containing the selected different grouping as the determined legal configuration.

### Claim 5 (depends on 4)

The computer-implemented method of claim 4, further comprising:
initially fixing the inherent numeric precedence weights;
recognizing a pattern based on a consistency of the possible legal configuration that is selected;
modifying the inherent numeric precedence weights based on the pattern; and
utilizing the modified inherent numeric precedence weights when compiling new input statements.

### Claim 6 (depends on 4)

The computer-implemented method of claim 4, wherein:
the score further comprises a sum of the inherent numeric precedence weights with an affinity weight;
the affinity weight is based on a proximity between two terms;
each of the two terms comprises one of the two functions or one of the one or more arguments;
the affinity weight is heavier the closer the two terms are to each other relative to more distal terms.

### Claim 7 (depends on 4)

The computer-implemented method of claim 4, wherein:
the score further comprises a sum of the inherent numeric precedence weights with a symmetry weight;
the symmetry weight comprises an additional weight added to a sub-expression that is repeated within a possible legal configuration; and
the sub-expression comprises a sequence of one or more of the functions and one or more of the arguments.

### Claim 8 (depends on 4)

The computer-implemented method of claim 4, wherein:
at least one of the different groupings comprises a new argument that is consumed by an adjacent unevaluated function; and
the new argument is used a basis for recursion and generational compilation.

### Claim 9 (depends on 4)

The computer-implemented method of claim 4, further comprising:
(i) maintaining a winner list;
(ii) placing the selected different grouping having the highest score into the winner list while maintaining a relative order;
(iii) finding remaining elements, wherein:
the remaining elements comprise:
remaining words in the selected possible legal configuration, if any;
remaining groupings in the selected possible legal configuration, if any;
remaining arguments of the one or more arguments in the selected possible legal configuration, if any; and
remaining functions of the two functions in the selected possible legal configuration, if any;
the remaining elements do not overlap with other elements or groupings already placed in the winner list;
(iv) selecting, from the remaining elements, the remaining element that is viable and has the highest score, wherein a viable remaining element comprises a remaining element that can stand alone;
(v) placing the selected remaining element in the winner list, while maintaining the relative order;
(vi) repeating steps (iii)-(vi) until all viable remaining elements are placed into the winner list; and
(vii) utilizing the winner list to determine the precedence during compiling.

### Claim 10 (depends on 1)

The computer-implemented method of claim 1, wherein:
the two functions and one or more arguments comprise words; and
the compiling further comprises executing, for the first input statement, the words during compile time in an iterative, recursive procedure such that a compiler acts as an iterative single pass compiler.

### Claim 11

A computer-implemented system for processing source computer instructions, comprising:
(a) a computer having a memory;
(b) a processor executing on the computer;
(c) the memory storing a set of instructions, wherein the set of instructions, when executed by the processor cause the processor to perform operations comprising:
(1) obtaining the source computer instructions comprising natural language words that represent one or more input statements, wherein:
(i) a first input statement of the one or more input statements comprises two functions; and
(ii) the first input statement comprises one or more arguments that are consumed by the two functions;
(2) for each of the one or more input statements, determining a legal configuration of the two functions and the one or more arguments,
(3) determining that a first function of the two functions can be evaluated to yield a non-variable value;
(4) determining that a second function of the two functions cannot be evaluated to yield a non-variable value;
(5) compiling the first input statement into executable code using the determined legal configuration, wherein during the compiling:
(i) the first function is executed; and
(ii) instructions are emitted to execute the second function at an indeterminate time.

### Claim 12 (depends on 11)

The computer-implemented system of claim 11, wherein:
parts of speech are defined as grammatical types and notional types;
the grammatical types and the notional types are used to identify how the natural language words are legally joined in expressions.

### Claim 13 (depends on 12)

The computer-implemented system of claim 12, wherein the operations further comprise:
selecting the first input statement;
selecting one of the two functions in the selected first input statement; and
tagging the selected function and the one or more parameters accepted by the selected function with the grammatical type or the notional type, wherein the determined legal configuration is selected based on the grammatical type and the notional type;
utilizing a stack based evaluation procedure to determine and select the legal configuration.

### Claim 14 (depends on 11)

The computer-implemented system of claim 11, wherein the operations further comprise:
determining for the first input statement:
an inherent numeric precedence weight for each of the two functions and each of the one or more arguments, wherein the inherent numeric precedence weights are based on mathematical order of operations;
all possible legal configurations of the two functions and the one or more arguments, wherein each possible legal configuration comprises a different grouping of the two functions with the one or more arguments consumed by each function;
assigning a score to each of the different groupings, wherein the score comprises a sum of inherent numeric precedence weights within each different grouping;
selecting the different grouping having the highest score; and
selecting the possible legal configuration containing the selected different grouping as the determined legal configuration.

### Claim 15 (depends on 14)

The computer-implemented system of claim 14, wherein the operations further comprise:
initially fixing the inherent numeric precedence weights;
recognizing a pattern based on a consistency of the possible legal configuration that is selected;
modifying the inherent numeric precedence weights based on the pattern; and
utilizing the modified inherent numeric precedence weights when compiling new input statements.

### Claim 16 (depends on 14)

The computer-implemented system of claim 14, wherein:
the score further comprises a sum of the inherent numeric precedence weights with an affinity weight;
the affinity weight is based on a proximity between two terms;
each of the two terms comprises one of the two functions or one of the one or more arguments;
the affinity weight is heavier the closer the two terms are to each other relative to more distal terms.

### Claim 17 (depends on 14)

The computer-implemented system of claim 14, wherein:
the score further comprises a sum of the inherent numeric precedence weights with a symmetry weight;
the symmetry weight comprises an additional weight added to a sub-expression that is repeated within a possible legal configuration; and
the sub-expression comprises a sequence of one or more of the functions and one or more of the arguments.

### Claim 18 (depends on 14)

The computer-implemented system of claim 14, wherein:
at least one of the different groupings comprises a new argument that is consumed by an adjacent unevaluated function; and
the new argument is used a basis for recursion and generational compilation.

### Claim 19 (depends on 14)

The computer-implemented system of claim 14, wherein the operations further comprise:
(i) maintaining a winner list;
(ii) placing the selected different grouping having the highest score into the winner list while maintaining a relative order;
(iii) finding remaining elements, wherein:
the remaining elements comprise:
remaining words in the selected possible legal configuration, if any;
remaining groupings in the selected possible legal configuration, if any;
remaining arguments of the one or more arguments in the selected possible legal configuration, if any; and
remaining functions of the two functions in the selected possible legal configuration, if any;
the remaining elements do not overlap with other elements or groupings already placed in the winner list;
(iv) selecting, from the remaining elements, the remaining element that is viable and has the highest score, wherein a viable remaining element comprises a remaining element that can stand alone;
(v) placing the selected remaining element in the winner list, while maintaining the relative order;
(vi) repeating steps (iii)-(vi) until all viable remaining elements are placed into the winner list; and
(vii) utilizing the winner list to determine the precedence during compiling.

### Claim 20 (depends on 11)

The computer-implemented system of claim 11, wherein:
the two functions and one or more arguments comprise words; and
the compiling further comprises executing, for the first input statement, the words during compile time in an iterative, recursive procedure such that a compiler acts as an iterative single pass compiler.
