Class / Patent application number | Description | Number of patent applications / Date published |
717142000 | Scanning and lexical analysis | 12 |
20080216061 | Inferring Function Calls In An Ambiguous Language Computer Program - An ambiguous usage of a name in a statement of a computer program is resolved at least partially by adding to an entry statement thereof a definition that includes the ambiguously used name followed by constructing a definition-use graph, followed by checking whether or not an edge from the added definition reaches the statement containing the ambiguously used name. If all edges into the ambiguous statement are from the added definition, then the name is deemed to be a function call. If all edges into the ambiguous statement are not from the added definition, then the name is deemed to be a memory access. If some edges into the ambiguous statement are from the added definition but other edges are not, then the statement is flagged as a dual usage. | 09-04-2008 |
20080276230 | PROCESSING BUNDLE FILE USING VIRTUAL XML DOCUMENT - A method, system and computer program product for processing a bundle file are disclosed. According to an embodiment, a method for processing a bundle file comprises: parsing the bundle file into bundle entries; creating a virtual XML file element to represent a bundle entry in a virtual XML document; and processing the bundle file using the virtual XML document. | 11-06-2008 |
20080307400 | Computer Program Product and Computer System for Language-Enhanced Programming Tools - Statements of a computer program expressed using a first source natural language are made meaningful to a programmer familiar with a second target natural language. The first source natural language of the computer program is determined from the programmer, or through analysis, and the second target natural language desired by the programmer is selected. Textual constructs may be parsed, with reference to stored coding conventions to determine meaningful lexical tokens. Such tokens are translated with a translation engine, and displayed to the programmer, desirably using a graphical user interface feature of an integrated development environment (IDE) for computer programming in a particular programming language. | 12-11-2008 |
20090037890 | METHOD AND SYSTEM FOR GENERATING AN APPLICATION - Methods and systems for generating an application are described. In one embodiment, source code associated with an application may be accessed. A header section of a main segment may be generated based on the compiling. The header section may describe the application. A user interface section of the main segment may be generated based on the compiling. The user interface section may be capable of being used to draw screens, display information, and receive user input. A procedures section of the main segment may be generated based on the compiling. The user interface section may be capable of being used to draw screens, display information, and receive user input. A text resources segment of the application may be generated based on the compiling. The text resources segment may include textual data. A binary resources segment of the application may be generated based on the compiling. The binary resources segment may include binary data. | 02-05-2009 |
20090328015 | Matching Based Pattern Inference for SMT Solvers - A method for automatically analyzing formulas and adding pattern annotations to quantifiers based on a database of common pattern idioms. The method involves matching base pattern inference for Satisfiability Modulo Theories (SMT) solvers. The method uses a database for fault detection in externally supplied pattern annotated formulas. The method also uses matching code trees to mixed second-order pattern matching. | 12-31-2009 |
20100037212 | IMMUTABLE PARSING - Immutable structures are employed to effect immutable parsing. In particular, an immutable parsing configuration, comprising a stack and lookahead buffer, is utilized by a parser to perform lexical and syntactical analysis of an input stream and optionally output an immutable parse tree or the like. Performance with respect to the immutable structures can be optimized utilizing sharing and lazy computation. In turn, immutability benefits are afforded with respect to parsing including safe sharing amongst services and/or across multiple threads as well as history preservation, among other things. | 02-11-2010 |
20100058301 | SYSTEM AND METHOD FOR BRANCH EXTRACTION OBFUSCATION - Disclosed herein are systems, methods, and computer readable-media for obfuscating code. The method includes extracting a conditional statement from a computer program, creating a function equivalent to the conditional statement, creating a pointer that points to the function, storing the pointer in an array of pointers, replacing the conditional statement with a call to the function using the pointer at an index in the array, and during runtime of the computer program, dynamically calculating the index corresponding to the pointer in the array. In one aspect, a subset of instructions is extracted from a path associated with the conditional statement and the subset of instructions is placed in the function to evaluate the conditional statement. In another aspect, the conditional statement is replaced with a call to a select function that (1) calculates the index into the array, (2) retrieves the function pointer from the array using the index, and (3) calls the function using the function pointer. Calls can be routed through a select function before the function pointer is used to call the function evaluating the conditional statement. Each step in the method can be applied to source code of the computer program, an intermediate representation of the computer program, and assembly code of the computer program. | 03-04-2010 |
20100333077 | Apparatus, Method, and Software for Analyzing Network Traffic in a Service Aware Network - The present invention generally relates to a method for describing network events in a service aware network (“SAN”). In addition, the present invention relates to software that performs the method and has a programming model containing protocol libraries, abstract protocol messages declarations, and network events. The method and software enable a user to define basic as well as complex network events in the application, presentation, session, transport and/or network layers of a communication model, which result in internet protocol (“IP”) level triggers or other triggers. Such triggers will result in actions which may be applicable in all layers of a communication model up to the highest layer. As a result, the method and software allow a user to describe a hierarchy of high level network events through a hierarchy of lower level events. In addition, a development system and an apparatus which utilizes the method and software are also provided. | 12-30-2010 |
20110167415 | LANGUAGE PROCESSING APPARATUS, LANGUAGE PROCESSING METHOD, AND COMPUTER PROGRAM PRODUCT - 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. | 07-07-2011 |
20130014093 | CODE INSPECTION EXECUTING SYSTEM FOR PERFORMING A CODE INSPECTION OF ABAP SOURCE CODES - The present invention relates to a code inspection executing system for performing a code inspection of ABAP source codes, and particularly, to a code inspection executing system for performing a code inspection of ABAP source codes, which provides the reliable maintainability, performance, accuracy, stability, and security of an ABAP application by inspecting coding defects such as system failure and stoppage, data loss and transformation, excessive performance deterioration, erroneous behavior of functions and results thereof, complex code structures, and spelling errors. | 01-10-2013 |
20140109067 | INTEGRATING PREPROCESSOR BEHAVIOR INTO PARSING - A method, computer program product, and system is described. Software code text associated with a software code editor and including one or more preprocessor statements is identified. The software code text is translated into a preprocessor output using one or more preprocessors associated with the software code text. One or more transformations of the one or more preprocessor statements is identified based upon comparing the preprocessor output with the software code text. One or more locations in the software code text associated with the one or more transformations is identified based upon comparing the preprocessor output with the software code text. The software code text is parsed, based upon lexing the software code text to generate an integrated token stream model including a first token stream representing the software code text and one or more other token streams representing the one or more transformations of the software code text. | 04-17-2014 |
20150363177 | MULTI-BRANCH DETERMINATION SYNTAX OPTIMIZATION APPARATUS - A multi-branch determination syntax optimization apparatus includes: a memory that retains multi-branch determination syntax including tokens; a database that retains (1) CPU performance information being a parameter depending on a CPU incorporated in the multi-branch determination syntax optimization apparatus and set based on time required for multi-branch determination processing and (2) frequently-appearing token table representing types and rates of appearance of tokens sorted in order of appearance frequency in a query that statically analyzes a source code and performs lexical analysis in advance; and a conversion section that executes determination for the multi-branch determination syntax by referring to the CPU performance information and the frequently-appearing token table, and creates a branch code converted to make a speculatively executable branch for the token type having a high frequency of appearance and to make a branch using the jump table for the token type having a low frequency of appearance. | 12-17-2015 |