Abstract: A method to process subroutine-structured graph-based intermediate representations during formal language processing implemented by a computing device. The method includes classifying a set of subroutines identified in an intermediate representation of code according to mutually recursive relationships between subroutines in the set of subroutines, recording the mutually recursive relationships, labeling to track the mutually recursive relationships, constructing a set of graph representations, collecting partial positions that distinguish points of action in generated code, labeling nodes of the graph of the intermediate representation, generating a subsequent intermediate representation by serialization of the graph of the intermediate representation through pre-order depth-first traversal, and creating the generated code from the intermediate representation.

Abstract: A method to process subroutine-structured graph-based intermediate representations during formal language processing implemented by a computing device. The method includes classifying a set of subroutines identified in an intermediate representation of code according to mutually recursive relationships between subroutines in the set of subroutines, recording the mutually recursive relationships, labeling to track the mutually recursive relationships, constructing a set of graph representations, collecting partial positions that distinguish points of action in generated code, labeling nodes of the graph of the intermediate representation, generating a subsequent intermediate representation by serialization of the graph of the intermediate representation through pre-order depth-first traversal, and creating the generated code from the intermediate representation.

Abstract: A method to process subroutine-structured graph-based intermediate representations during formal language processing implemented by a computing device. The method includes classifying a set of subroutines identified in an intermediate representation of code according to mutually recursive relationships between subroutines in the set of subroutines, recording the mutually recursive relationships, labeling to track the mutually recursive relationships, constructing a set of graph representations, collecting partial positions that distinguish points of action in generated code, labeling nodes of the graph of the intermediate representation, generating a subsequent intermediate representation by serialization of the graph of the intermediate representation through pre-order depth-first traversal, and creating the generated code from the intermediate representation.

Abstract: A method to process subroutine-structured graph-based intermediate representations during formal language processing implemented by a computing device. The method includes classifying a set of subroutines identified in an intermediate representation of code according to mutually recursive relationships between subroutines in the set of subroutines, recording the mutually recursive relationships, labeling to track the mutually recursive relationships, constructing a set of graph representations, collecting partial positions that distinguish points of action in generated code, labeling nodes of the graph of the intermediate representation, generating a subsequent intermediate representation by serialization of the graph of the intermediate representation through pre-order depth-first traversal, and creating the generated code from the intermediate representation.

Abstract: A computer system and method of grammar analysis to generate code for runtime recognition to produce a list or graph representation of multiple lists of directions to be followed for a given sentence during a subsequent parse. The computer system implementing the method to parse grammar to create an intermediate representation, construct a graph for analysis that represents all features of a grammar, including recursion, alternation, grouping of alternatives, and looping, process each decision point in the graph to generate the intermediate representation, generate code for recognition functions that return lists of directions for use in runtime parse decisions, and patch each decision point token to reference or inline a top level recognition code for each decision point.

Abstract: A computer system and method of grammar analysis to generate code for runtime recognition to produce a list or graph representation of multiple lists of directions to be followed for a given sentence during a subsequent parse. The computer system implementing the method to parse grammar to create an intermediate representation, construct a graph for analysis that represents all features of a grammar, including recursion, alternation, grouping of alternatives, and looping, process each decision point in the graph to generate the intermediate representation, generate code for recognition functions that return lists of directions for use in runtime parse decisions, and patch each decision point token to reference or inline a top level recognition code for each decision point.

Abstract: A computer system and method of grammar analysis to generate code for runtime recognition to produce a list or graph representation of multiple lists of directions to be followed for a given sentence during a subsequent parse. The computer system implementing the method to parse grammar to create an intermediate representation, construct a graph for analysis that represents all features of a grammar, including recursion, alternation, grouping of alternatives, and looping, process each decision point in the graph to generate the intermediate representation, generate code for recognition functions that return lists of directions for use in runtime parse decisions, and patch each decision point token to reference or inline a top level recognition code for each decision point.

Abstract: A method of program compilation to improve parallelism during the linking of the program by a compiler. The method includes converting statements of the program to canonical form, constructing a traversable representation, such as an abstract syntax tree (AST), for each procedure in the program, and traversing the program to construct a graph by making each non-control flow statement and each control structure into at least one node of the graph.

Abstract: A method of program compilation to improve parallelism during the linking of the program by a compiler. The method includes converting statements of the program to canonical form, constructing a traversable representation, such as an abstract syntax tree (AST), for each procedure in the program, and traversing the program to construct a graph by making each non-control flow statement and each control structure into at least one node of the graph.

Abstract: A computer system and method of grammar analysis to generate code for runtime recognition to produce a list or graph representation of multiple lists of directions to be followed for a given sentence during a subsequent parse. The computer system implementing the method to parse grammar to create an intermediate representation, construct a graph for analysis that represents all features of a grammar, including recursion, alternation, grouping of alternatives, and looping, process each decision point in the graph to generate the intermediate representation, generate code for recognition functions that return lists of directions for use in runtime parse decisions, and patch each decision point token to reference or inline a top level recognition code for each decision point.