Abstract: A system and method for automatically generating sentences in a language is disclosed. The system comprising a grammar processor for converting an input grammar into a hierarchical representation, and a grammar explorer module for traversing the grammar hierarchy based on an explore specification, which defines what nodes of the hierarchy should be explored. The explorer module takes the exploration specification as input and traverses the hierarchy according to the exploration types specified in the exploration specification. The system and method can be used to automatically generate assembly instructions for a microprocessor given its assembly language grammar, to generate sentences of a natural language like English from its grammar and to generate programs in a high-level programming language like C.

Abstract: A computer program for optimizing an architectural model of a microprocessor by configuring elements of the instruction set as nodes of the graph. The architectural model of a microprocessor represents an instruction set of the microprocessor. Determination is made whether nodes with identical bit position and value encoding are in the graph. If nodes with the identical bit position and value encoding are present, a path from a source node to a target node is separated into a common node for each node in the graph. The common node is reused to optimize common paths from the graph and the source node is directly connected to the common node in the graph using a forward edge. A back-edge is added from the common node to the source node through the target node and the above steps are recursively repeated until all nodes of the graph are processed.

Abstract: A computer program for optimizing an architectural model of a microprocessor by configuring elements of the instruction set as nodes of the graph. The architectural model of a microprocessor represents an instruction set of the microprocessor. Determination is made whether nodes with identical bit position and value encoding are in the graph. If nodes with the identical bit position and value encoding are present, a path from a source node to a target node is separated into a common node for each node in the graph. The common node is reused to optimize common paths from the graph and the source node is directly connected to the common node in the graph using a forward edge. A back-edge is added from the common node to the source node through the target node and the above steps are recursively repeated until all nodes of the graph are processed.

Abstract: A method for transforming a heterogeneous compound document to a desired format based on a prescribed model is provided. The method comprises the steps of: (i) specifying the components of the heterogeneous compound document as a hierarchical tree structure in multiple formats and specifying the input sources of information for each of the components as part of the model; verifying and composing the heterogeneous compound document using a modeling language parser and a document composer by dynamically obtaining input information from the sources specified in the model and (iii) converting the input compound document to the desired format using the document composer. A system for performing the abovementioned method is also provided.

Abstract: A method for optimizing an architectural model of a microprocessor includes representing an instruction set of the microprocessor as a graph by configuring the elements of the instruction set as nodes of the graph. Determination is made whether the nodes with identical bit position and value encoding is present in the graph. If the nodes with the identical bit position and value encoding are present, a path from a source node to a target node is separated into a common node for each node in the graph. The common node is reused to optimize common paths out of the graph and the source node is directly connected to the common node in the graph using a forward edge. A back-edge is added from the common node to the source node through the target node and the above steps are recursively repeated until all the nodes of the graph are processed.

Abstract: A method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment. The method uses a unified grammar specification of grammars of different languages in a single unified representation of all the individual grammars where equivalent production rules of each of the grammars are merged into a single unified production rule. This method can be used to represent the equivalence of computer languages like high level language, assembly language and machine language and for translating sentences in any of these languages to another language.

Abstract: A method of implementing fixed-width data types which are not directly supported by a programming language, in a portable manner. A set U of required fixed-width data types, an ordered set B of basic data types and a set V with all possible data type widths are provided as inputs (201). A generic data type G having an integer parameter and a data type parameter is created (202). For every data type width WVj from set V and basic data type Bi from set B a specialized data type G is created (203). Then, each required data type Uk from set U of required data types is implemented by creating and mapping required data type Uk to the implementation of Uk provided by the generic data type G11 having the parameters data type width WB1 and basic data type B1 (204).