Abstract: A system for modifying a rule base for use in processing data, wherein an instance of an entity comprises associated data, for use with a parser for identifying a first instance of an entity in data associated with a document set in accordance with a first rule and for using the first instance of the entity to identify a second instance of the entity in the data associated with the document set. The system comprises an accessor for accessing data associated with the second instance of the entity; and a generator for using the data associated with the second instance of the entity to generate a second rule.

Abstract: A system for self-assembling software components is described herein. In one embodiment, a system includes a first and second set of language components, where each language component defines at least one part of language runnable on a computer by associating a piece of grammar of the language with at least one software component that implements the piece of grammar. The system further includes a request broker that upon being provided with a section of code written in the language matches syntactic appearances of the first set of language components in the section of code and granting logic to grant access to the language components of the first set whose syntactic appearances the request broker matched, in order to enable self-assemblage of the language components of the first set with language components of the second set.

Abstract: Methods and apparatus are provided for supporting text-based context links for application programs. An embodiment includes a first computer to maintain a database of data objects and a second computer to execute an application program that operates on a file having text elements. In an embodiment, the second computer is to execute a link program to access a data object on the first computer based on a user of the application program having used the application program to select a text element that is related to that data object.

Abstract: A system and method provide the ability to construct lexical analyzers on the fly in an efficient and pervasive manner. The system and method split the table describing the automata into two distinct tables and splits the lexical analyzer into two phases, one for each table. The two phases consist of a single transition algorithm and a range transition algorithm, both of which are table driven and permit the dynamic modification of those tables during operation. A third ‘entry point’ table may also be used to speed up the process of finding the first table element from state 0 for any given input character.

Abstract: Declarations from an input source code or tokenized source code are serialized into a stream of tokens produced by following each branch of a preprocessor conditional directive statement that interrupts a declaration. Tokens are labeled with a parsing path indicator corresponding to a parsing path induced by branches of a preprocessor conditional directive. The declarations that are formed along the different parsing paths are serialized by fetching the tokens that belong to the first parsing path in a first pass, and passing the tokens on to a next phase of a compiler. The pointer that marks the next token is repositioned to return to the start of the declaration. The declaration may be serialized again through the second parsing path in a second pass. The operation may be repeated until each of the parsing paths induced by the presence of branches of the preprocessor conditional directives in the source code is exhausted.

Abstract: A method and a system for template-based code generation. The method easily renders executable code using reusable customizable templates. The method further checks the templates for syntax errors prior to use. The system provides a memory and a processor for implementing template-based code generation.

Abstract: A program is into at least two object files: one object file for each of the supported processor environments. During compilation, code characteristics, such as data locality, computational intensity, and data parallelism, are analyzed and recorded in the object file. During run time, the code characteristics are combined with runtime considerations, such as the current load on the processors and the size of the data being processed, to arrive at an overall value. The overall value is then used to determine which of the processors will be assigned the task. The values are assigned based on the characteristics of the various processors. For example, if one processor is better at handling intensive computations against large streams of data, programs that are highly computationally intensive and process large quantities of data are weighted in favor of that processor. The corresponding object is then loaded and executed on the assigned processor.

Abstract: An Extensible Markup Language (XML) Application Server for storing, processing, communicating, and displaying dynamic semi-structured information. It comprises a declarative specification language, a transactional indexed XML data store, and an XML application server engine. An integrated architecture (a) provides for optimization, indexing, and backtracking search in a business logic layer, (b) provides for general-purpose programming idioms including recursive function definitions, iteration, and dynamic dispatch in data layer queries and updates, and (c) eliminates processing overhead and maintenance issues caused by transforming between relational, object-oriented, and semi-structured data paradigms.

Abstract: Source code for a transactions on Unix® extended for distributed operation (Tuxedo®) application, is parsed by an application migration module. At least one application service routine that each specifies a Tuxedo® service within the parsed source code is identified. At least one identified application service routine includes at least one associated application-to-transaction manager (ATMI) application programming interface (API) routine. Stub code that includes an invocation call for an associated customer information control system service for each application service routine identified within the source code is generated. A customer information control system environment executable is created based upon the source code, the stub code, glue code, and a migration library. The migration library includes, for each associated ATMI API routine, a mapping routine that processes data format differences between each ATMI API routine and at least one associated customer information control system API routine.

Abstract: A method for explaining a form that includes receiving input code, wherein the input code is associated with the form, processing the input code to create an explanation dynamically associated with the form, and outputting the explanation into a natural language.

Abstract: Methods and computer program products relating to properties of data elements. A computer-implemented method for identifying a property of a data element includes receiving a request for at least one sought property of a data element. The data element is configured for use in semantically identifying information portions in electronic communications. The sought property is to be valid in a context defined by at least one context value indicated by the request. The method includes identifying the at least one sought property by evaluating at least one logical rule that defines at least one property of the data element as being valid for a specified context. The method includes generating an output in response to the request that indicates the at least one sought property.

Abstract: A parser parses an application that comprises two or more different modules; the modules are bytecodes, object codes, and/or modules compiled using different programming languages. The parser identifies code statements in the modules or source code for the modules that correspond to common AST node types. A common AST node type is an abstraction of common elements in programming languages/bytecodes/object codes. Examples of code statements that are common in programming languages/bytecodes/object codes are branching, returns from functions, assignments, and the like. The use of common AST node types allows a user to generate different diagrams of the structure of the application. For example, a code flow diagram can be generated that allows a user to view the flow of code between the different modules implemented in different languages.

Abstract: A compiler (or interpreter) detects source language instructions performing arithmetic operations using a fixed point format (preferably packed decimal). Where the operation can be performed without loss of precision or violation of other constraints of the source language, the compiler automatically converts the operands to a floating point format (preferably Decimal Floating Point (DFP)) having hardware support, and re-converts results to the original fixed point format. Preferably, the compiler may combine multiple operations and instructions in an expression tree, analyze the tree, and selectively convert where possible. The compiler preferably performs a heuristic cost judgment in determining whether to use a particular conversion.

Abstract: A digital footprint driven multi-channel integrated support system assists a user in managing electronic components based on his or her digital footprint. The digital footprint driven multi-channel integrated support system delivers a dramatically improved ‘digital home support’ experience across multiple support channels (e.g., ‘on-the-box’, web, IVR, agent voice, agent chat, agent email, and more). The digital footprint driven multi-channel integrated support system generates, displays, and uses a ‘digital footprint’ of the components within the home, such as computer hardware/software, computer peripherals, audio/visual equipment, gaming hardware/software, home security hardware/software, or other electronic components.

Abstract: A method includes, during compilation of a portion of source code at a compiler, initiating token resolution with respect to a token included in the portion of source code. A static context and a dynamic context of the compiler are queried to identify one or more lookup results of the token. A particular lookup result is selected to resolve the token based on one or more semantic rules of the compiler. The particular lookup result is selected independently of whether the particular lookup result is sourced from the static context or from the dynamic context. The method includes resolving the token based on the selected particular lookup result.

Abstract: A method for reviewing data dependencies in a document that includes requesting an explanation of a dependent data container in a plurality of data containers, in which the dependent data container resides within a document, and receiving the explanation of the dependent data container, in which the explanation that includes information about the dependent data container and information about a precedent data container of the plurality of data containers, and in which the information describes the dependency between the precedent data container and the dependent data container.

Abstract: A method for generating a test file, that includes parsing annotated test code written in a source language to create a data structure representation of the annotated test code, generating test code in a markup language according to a plurality of testing definitions using the data structure representation, and storing the test code in the markup language in the test file.

Abstract: Precise exception handling relies on a precise subject state including an accurate program counter and register values of a subject processor. Subject code (17) is translated into target code (21) executable by a target processor (13). The generated target code (17) includes counterpart target instructions (214) associated with fault-vulnerable subject code instructions (174). Further, each of the counterpart target code instruction (214) is associated with recovery information (195). When an exception (e.g. a fault) occurs, the recovery information (195) is retrieved and used to recover a precise subject state, in particular by taking account of optimizations to generate the common-case target code (21). The precise subject state is then used to precisely handle the exception.

Abstract: A method of data reshaping for multidimensional dynamic array objects in the presence of multiple object instantiations. The method includes collecting all alias information using interprocedural point escape analysis, and collecting all shape information using interprocedural shape analysis. The method progresses with selecting the candidate dynamic objects based on alias and shape analysis, and determining the types of data reshaping for the candidate dynamic objects. The method further includes creating objects for selected dynamic objects with multiple object instantiations. The method proceeds by updating the memory allocation operations for the selected dynamic objects and inserting statements to initialize object descriptors. The method further includes creating the copy of the object descriptors for selected dynamic object assignments. The method concludes by replacing the object references by array-indexed references for selected dynamic objects using object descriptors.

Abstract: Syntax and semantic validation of network commands use a command database that has been learned automatically for validation of the syntax and the semantics of command line interface commands by interpreting the network commands as the network commands are entered to identify syntax errors or semantic errors before applying the same commands on a device of interest.

Abstract: Programming mechanisms for data parsing facilitate both clear code specification and efficient execution. Declarative style code can be employed to enable clear and concise specification of data parsing. Further, an efficient parsing approach can be utilized that enables processing of a data structure without first materializing the entire structure to memory. More specifically, streaming and/or selective materialization of portions of data to memory can be employed.

Abstract: A system including a memory for storing a set of instructions executable by a processor. The instructions being operable to receive a definition of code information, parse the code information and generate a byte code expression for the code information, the generating including resolving the symbols of the code information, wherein the byte code expression relates to only memory access, register access and numerical operations of the code information.

Abstract: A system and method for defining code by its functionality is disclosed. The technology initially accesses a portion of code. Once the portion of code is accessed at least one functional operation embedded in the code is determined. When the functional operation in the code is determined, the portion of code is then defined by the functional operation. In so doing, the portion of code can be defined by functional operation without requiring the consideration of any semantics related to the portion of code.

Abstract: Data associated with at least one module of code may be annotated in such a manner as to provide guidance regarding usage of the module.

Abstract: A system is provided for computer application code automation comprising a code automation computer server configured for presenting an electronic user interface for receiving user input for generating a Structured Query Language (SQL) query, the user input comprising a plurality of SQL tokens, a processor, associated with the code automation computer server, for receiving the plurality of SQL tokens, the processor retrieving from memory and executing computer executable instructions for at least one of: (a) optimizing performance of the SQL query while receiving the user input, and (b) error checking the SQL query while receiving the user input, wherein the processor is adapted for automatically incorporating the generated SQL query into the computer application code and storing the computer application code in a non-transitory computer readable medium.

Abstract: Provided is an apparatus for a parser framework having the characteristics of the application program, using the markup language.

Abstract: A method of instrumenting one or more units of an application program is disclosed. Each unit can have one or more interfaces through which communications pass through the unit. Client units can request creation of a server unit. When they do so, the call is intercepted and sent to a unit creation function, which creates the server unit and returns a reference to an interface of the server unit. When a reference to an interface of the server unit is detected, an interface wrapper is created for the interface, the interface wrapper comprising a reference to instrumentation, the reference to the interface, and a reference to a type description of the interface. The client receives a reference to the interface wrapper in place of a reference to the interface, and thereafter is able to treat the reference to the interface wrapper as if it were a reference to the interface.

Abstract: A language processing apparatus comprises a first assembler file generating unit that allocates a variable included in a source program written in a single module to a register, generates an assembler code for each function, inserts a save-restore code for the register into an entry-exit point of a function that uses the register, and generates a first assembler program; and a second assembler file generating unit that, when the register used in the function is not used in a caller, migrates the save-restore code for the register written in the first assembler file to an entry-exit point of the caller, and generates a second assembler program.

Abstract: When writing code, data structures that include inferred symbols are created based on usage of undefined symbols. As the user continues writing code, code model can be updated to represent updated information based on a learning model. Data structures including inferred symbols can be used by software development tools to provide developer help for symbols that are not yet created or are not yet bound. Inferred symbols can be visually distinguishable making the appearance of the inferred symbol information differ from actual symbol information. The appearance of information based on inferred symbols can be included within tools by activating a particular mode in a programming environment. Conversion of the inferred symbol to a real symbol may trigger the automatic compiler-generation of additional source code by a background compiler. Inferred symbols may be converted to actual symbols by activation of an option to make an inferred symbol a real symbol.

Abstract: A generic application-level protocol analyzer (GAPA) is adaptable to model an application and its response to messages in different protocols, including multiple, layered protocols in a network context. One mode of a GAPA includes an analysis engine having a plurality of objects adaptable to model an application and its response to messages. The objects may include a session dispatching object, a state machine object, a message parsing object, a protocol layering object, and a handler object. The analysis engine may be used to evaluate real-time network streams or to evaluate recorded network traces. The GAPA is adapted to specific applications using a generic application-level protocol analyzer engine language (GAPAL). The GAPAL uses a high-level syntax similar to those in existing protocol specification descriptions. The GAPAL supports binary and text-based protocols. Using the GAPAL, objects are described without writing low-level code to model specific objects or specify message formats.

Abstract: The present invention provides a mobile application ecosystem comprising a mobile application development kit and store, both of which are implemented as web-based services such that creation, testing, and distribution of mobile applications, as well as discovery, investigation, and delivery of same, can all be performed using a standard web browser. The mobile application development kit offers common capabilities across all target mobile device brand and brand groups, allowing the same application construct to work unmodified on all, while building the application in a manner that is native to each, thereby avoiding any requirement to embed a separate common runtime or virtual machine on every mobile device.

Abstract: A back-end service adaptation system provides access to normalized data in a data repository for a consumer runtime environment sending a query request for denormalized data. The back-end service adaptation system can include a data access service layer, a parser layer, and a back-end service adaptation runtime layer. The consumer runtime can use a service adaptation definition language (SADL), and the parser and data access service can be configured to convert and translate the SADL request for the back-end service adaptation runtime layer.

Abstract: A method and implementing computer system are provided in which selected information is embedded within computer program structures without requiring separate bit strings. In an exemplary embodiment, the embedded selected information includes an identification of a licensed user together with a serial number of the associated licensed program. That information is converted into a binary representation, and a transfer function is used to embed the binary representation into the structure of the licensed program. In the example, when a licensed program is compiled, linked and downloaded over an interconnection network, the order or sequence of the modules of the licensed program is arranged in a manner to correspond to the embedded selected information. The embedded information can then be extracted from the program by analysis of the organization of the modules comprising the program.

Abstract: Disclosed is method and system for debugging XML files or documents by inserting breakpoint into an XML file and converting the XML file into a byte code format, where the breakpoints are propagated into the byte code format and stored in runtime libraries. During runtime, on encountering the breakpoint, the location of the breakpoint is internally determined in the byte code and point to the location of the breakpoint in the XML file.

Abstract: A method and apparatus for modifying an events queue for extending an extended mark-up language (XML) processor's feature set are described. In one embodiment, the method includes the parsing of an XML document to generate an initial event queue. During parsing of the XML document, an event associated with a parser plug-in module may be detected. When an event associated with a parser plug-in module is detected, control is passed to the plug-in module to perform event-based functionality to modify the initial event queue to form a modified event queue. Subsequently, any additional event information contained within the modified event queue, as generated by the parser plug-in module, is reported to, for example, an end user application. Other embodiments are described and claimed.

Abstract: The subject disclosure pertains to systems and methods for dynamic parsing. A dynamic parser can perform syntactic analysis or parsing of input data consisting of a set of tokens based upon a provided grammar including conditional tokens. While the parser grammar can be fixed, the dynamic parser can utilize an independent transform function at parse time to translate or replace particular tokens, effectively performing dynamic parsing. The transform function can be utilized in conjunction with conditional tokens to selectively activate and deactivate particular grammar rules. Additionally, systems and methods for automatically generating a dynamic parser from a grammar description are described herein.

Abstract: A schema parser can be used in data binding to create a schema object model when given an XML schema. Java classes can be generated using the schema object model, which correspond to elements and types in the schema. Mapping can be done in each direction between the schema and Java classes, which can be written to a type mapping directory. The schema object model can also contain mappings between each Java class and an XSD type. The mappings in the type mapping directory can then be used to generate XML when given a Java object tree, and can be used to create and populate a Java class when given an XML instance matching the schema object model.

Abstract: In one embodiment the invention provides a method to provide command line utility output to an application without the need of temporary files. The method includes receiving an identifier, receiving output from a command line utility, and storing the command line utility output in a system storage at a location identified by the identifier. In one illustrative embodiment, command line utility output is stored in a system registry database. In another illustrative embodiment, command line utility output is stored in a shared system memory. The method may be stored in any media that is readable and executable by a computer system.

Abstract: The present invention extends utilizing abstract descriptions to generate, exchange, and configure service and client runtimes. A computer system parses compiled code and potentially optional configuration information for implementing a service and converts the compiled code and any configuration information into an abstract service description. The abstract service description can then be converted into code document object model and service configuration information or exported as metadata. A corresponding service runtime can be initiated by calling a service initializer included in the abstract service description. The code document object model and configuration information and/or metadata can be transferred to another computer system. The other computer system can utilize the code document object model and configuration information and/or import the metadata to facilitate initialization of a compatible channel for communicating with the service runtime.

Abstract: An architecture that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.

Abstract: A data processing system, method, and instructions executable on a computer inspect the quality of software code. A summary report is generated that summarizes aspects of the current status of a software project. The summary report may include which portions of code have been written, which have been edited to predetermined standards, and which remain to be written. Errors in the code may be identified. Warnings associated with portions of the code may be generated, as well as suggested changes to the code. For comparison, the suggested code changes may be displayed along side of the corresponding portions of the pre-existing code that the suggested code is intended to replace. Hard coded values may be automatically identified. Text elements corresponding to each hard coded value may be automatically created. Subsequently, each hard coded value may be automatically replaced by the corresponding text element. Revisions to pre-existing code may be inspected.

Abstract: A system is disclosed for compiling program code. The system provides a compiler that includes a static verifier and a runtime verifier. The static verifier performs static checks on the program code and produces object code corresponding to the program code. The runtime verifier receives the object code and performs dynamic checks on the object code in a platform dependent environment. The resulting object code can subsequently be executed.

Abstract: A message gateway apparatus is provided for use in a web service system to process a message containing a request for a destination web service application, in which the message includes a plurality of events within a structured document conforming to a web service protocol and each event of the plurality of events has a name and a content thereof.

Abstract: Systems and methods that integrate data type conversion(s) into a programming language, and describe external formats within a syntax thereof. A mapping component defines a declarative mapping from an external data format to one or more of its internal data types (e.g., expressing external data types in terms of source languages.) Moreover, a rule establishing component can define value-based rules, such as invariants to the external data format, wherein the schema declaration further defines data fields that make up the schema. Accordingly, by expressing rules in form of predicate logic (instead of imperative program logic) the subject innovation increase a likelihood that compilers can reason about the data.

Abstract: System and method for analyzing a graphical program. A graphical program is displayed on a display. A semantic edit operation is performed on the graphical program in response to user input. The semantic edit operation is performed by a first process. Semantic analysis of the graphical program is performed by a second process in response to performing the semantic edit operation, where the second process is asynchronous with respect to the first process. Results from the semantic analysis of the graphical program are displayed in response to completion of the semantic analysis. If during the semantic analysis, another semantic edit operation is performed on the graphical program, the semantic analysis may be preemptively terminated and re-initiated. Displaying results from the semantic analysis of the graphical program may then include displaying results from the re-initiated semantic analysis of the graphical program in response to completion of the re-initiated semantic analysis.

Abstract: A program verification process begins by converting a language of the program from a first language into an intermediate language representation. The loops of the program are eliminated. The program is converted from the intermediate language representation into a passive form. Dominators for the passive form of the program are determined. A verification condition is generated from the passive form of the program. The verification condition is structured according to the computed dominators such that when a theorem prover identifies a potential error, portions of the passive form of the program irrelevant to the potential error are ignored.

Abstract: An improved architecture for a program code conversion apparatus and method for generating intermediate representations for program code conversion. The program code conversion apparatus determines which types of IR nodes to generate in an intermediate representation (IR) of subject code (10) to be translated. Depending upon the particular subject and target computing environments involved in the conversion, the program code conversion apparatus utilizes either base nodes, complex nodes, polymorphic nodes, and architecture specific nodes, or some combination thereof, in generating the intermediate representation.

Abstract: The current invention describes a virtual machine designed to run on a variety of platforms of varied capabilities, and in particular describes support in the coding and development environment for assessing and managing the variation in capability and performance among the platforms.

Abstract: A method, apparatus, and computer instructions are provided by the present invention for a programming framework for easy pattern matching and transformation of intermediate language expression trees. With expression matching and transformation framework (EMTF) of the present invention, pattern matchers may be defined and embedded in a C++ program code in a manner that resembles their intermediate representation. EMTF also provides capabilities for unification, unbinding, transformation, intra-pattern referencing, common operators, creation of pattern objects in a storage pool. With EMTF, less common patterns may be applied against input expressions without repeatedly implementing an algorithm.

Abstract: A system and method for compiler error recovery, comprising analyzing the syntactic structure of a first program in a first programming language, wherein the first program can be represented by a first set of tokens, detecting a syntax error in the first program, remedying the syntax error by adding at least one token to the first set of tokens according to one of: 1) a prefix definition; and 2) an idiom definition, and wherein the detection of the syntax error occurs at the behest of an extensible compiler framework.