382results about "Parser generation" patented technology

A system is provided for building a parser generator. The system includes a grammar input module for inputting in the parser generator a grammar expressed in a given formalism. A checking module formally verifies that a given grammar belongs to a predetermined class of grammars for which a translation to a correct, terminating parser is feasible. A checking module formally verifies that a grammar expressed in the formalism is well-formed. A semantic action module defines a parsing result depending on semantic actions embedded in the grammar. The semantic action module ensures in a formal way that all semantic actions of the grammar are terminating semantic actions. A formal module generates a parser with total correctness guarantees, using the modules to verify that the grammar is well-formed, belongs to a certain class of feasible, terminating grammars and all its semantic actions are terminating.

Performance of a heterogeneous multiprocessor is educed as much as possible within a short time without any awareness of parallelization matched with a configuration of the heterogeneous multiprocessor. In a heterogeneous multiprocessor system, tasks having parallelism are automatically extracted by a compiler, a portion to be efficiently processed by a dedicated processor is extracted from an input program being a processing target, and processing time is estimated. Thus, by arranging the tasks according to PU characteristics, scheduling for efficiently operating a plurality of PU's in parallel is carried out.

Systems, methods, and computer program products are provided for identifying software files, flaws in code, and program fragments by obtaining a software file, determining a plurality of artifacts, accessing a database which stores a plurality of reference artifacts for reference software files, comparing at least one of the artifacts to at least one of the reference artifacts stored in the database, and identifying the software file by identifying the reference software file having the reference artifacts that correspond to the plurality of artifacts. Certain embodiments can also automatically provide updated versions of files, patches to be applied, or repaired blocks of code to replace flawed blocks. Example embodiments can accept a wide variety of file types, including source code and binary files and can analyze source code or convert files to an intermediate representation (IR) and analyze the IR.

Techniques for analyzing software in which un-instrumented components can be discovered and conditionally instrumented during a runtime of the software. Initially, software such as an application can be configured with a baseline set of instrumented components such as methods. As the application runs, performance data gathered from the instrumentation may indicate that the performance of some methods is below expectations. To analyze this, any methods which are callable from a method at issue are discovered, such as by inspecting the byte code of loaded classes in a JAVA Virtual Machine (JVM). To limit and focus the diagnosis, the instrumentation which is added to the discovered components can be conditional, so that the instrumentation is executed only in a specified context. The context can involve, e.g., a specified sequence of components in which a discovered component is called, and/or transaction data in which a discovered component is called.

A method and apparatus are disclosed for enhancing operable functionality of input source code files from a software program by identifying a first code snippet and a first library function which generate similar outputs from a shared input by parsing each and every line of code in a candidate code snippet to generate a templatized code snippet data structure for the first code snippet, and then testing the templatized code snippet data structure against extracted library function information to check for similarity of outputs between the first code snippet and the first library function in response to a shared input so that the developer is presented with a library function recommendation which includes the first code snippet, the first library function, and instructions for replacing the first code snippet with the first library function.

The invention discloses a highly-available contract executing method, which includes steps of (1), compiling an intelligent contract code according to contract information, wherein the intelligent contract code comprises more than maximum stack depth number of local variables, parameters or structure bodies; (2), performing grammar semantic parsing on the intelligent contract code, and generatinga corresponding abstract grammar tree; (3), converting the abstract grammar tree data structure to be a binary byte assembly code sequence and an related order; (4), explaining and executing the byteassembly code sequence by a contract virtual machine. Specific to the problems that the stack is easy to overflow and a stack element cannot be visited at random, the original intelligent contract design adopts an avoiding plan of small stack depth and exchangeable different storage spaces ordinarily; through the plan of realizing the order visit at random by the contract encoder and the virtual machine, the stack overflow is prevented and the random visit of the stack element can be realized. More complex available intelligent contract can be operated on the system; the cost for contract writing, compilation, and execution is lower.

Systems, methods, and computer program products are provided for locating design patterns in software. An example method includes accessing a database having multiple artifacts corresponding to multiple software, and identifying a design pattern for at least one of the software files by automatically analyzing at least one of the artifacts associated with the software. Additional embodiments also provide for storing an identifier for the design pattern for the software in the database. For certain example embodiments, the artifacts include developmental, which may be searched for a string that denotes a design pattern, such as flaw, feature, or repair. Additional example embodiments also include finding in the software file a program fragment that implements the design pattern.

A method of XML element level comparison is provided. In an exemplary embodiment, the method of XML element level comparison includes creating an application-specific parser for a first incoming XML instance. The method may also include generating a comparison agent. The comparison agent may include the application-specific parser for the first incoming XML instance and an element value of the first incoming XML instance. For example, the application-specific parser includes an XPATH and a comparison code action pair. The method may also include evaluating a second incoming XML instance with the comparison agent at runtime.

A terminal equipped with a central processing unit (CPU) and a graphics processing unit (GPU) performs a method for executing applications in adaptation to the load of the CPU and GPU. The application execution method of the present invention includes checking, when a code of application to be executed is input, workloads of a central processing unit and a graphics processing unit. The method also includes comparing the workloads of the central processing unit and the graphics processing unit with respective workload threshold values, and compiling the code according to comparison result. The method further includes generating a binary for executing the application at one of the central processing unit and the graphics processing unit using the compiled code, and executing the application with the generated binary. The method reduces application execution time by adjusting the workloads of the CPU and GPU according to the total workload, thereby saving power.

A method of XML file processing is provided. The method may include creating a schema repository for storing more than one version of an XML schema. One of the more than one version of the XML schema may be retrieved from the schema repository. The method may also include receiving the one of the more than one version of the XML schema and a set of semantic actions by a version-sensitive parser generation engine. A XML version-sensitive parser may be generated by the version-specific parser generation engine.

A modeling tool may be created directed from a drawing. A plurality of components and their relationships are deduced from the drawing and defined as a metamodel. One or more user operations performed while creating the drawing are also determined and used in building the metamodel. The metamodel may be used in a fixed mode to create a model with definition of the metamodel. The metamodel may be also used in a flexible mode to further redefine the metamodel or create a second metamodel.

A computer implemented method of generating a compiler description from an architecture description. Information is automatically extracted from an architecture description that is usable in a description of an architecture described by the architecture description. The extracted information is imported into a program comprising a graphical user interface that accepts user provided additional information that is usable in the compiler description. User provided additional information is accessed that is usable in the compiler description. A compiler description is automatically generated for the architecture described by the architecture description, based on the automatically extracted information and the accessed user provided additional information.

A method of XML parsing is provided. In an exemplary embodiment, the method may include: parsing of an XML document; constructing an XML XPATH which includes at least one XML XPATH tag; constructing a JAR file of Java classes which include at least one package path that matches the at least one XML XPATH tag; accessing the JAR file of Java classes which include the at least one package path that matches the at least one XML XPATH tag; and transferring the at least one XML XPATH tag to the JAR file of Java classes including the at least one package path that matches the at least one XML XPATH tag for processing.

The invention provides a traceability application-oriented blockchain database data management system, comprising: 1) an analysis and conversion component layer comprising a plurality of analysis andconversion components ARP to realize simple processing and analysis of BDQL statements; 2) a logic combination processing layer, which is used for realizing recombination of statements; 3) a data driving layer converting data into a data format required by the BCD driver, wherein the data is sent to the BCD driver after being processed by the logic processing layer, and the BCD driver converts thedata format into BCD executable data BED and sends the BCD executable data BED to the data storage layer; and 4) a data storage layer for storing data. The invention discloses a traceability application-oriented block chain database data management method. The method comprises the steps of block chain database BDQL language conversion and data query, insertion and updating operation in a block chain database through BDQL. According to the system and the method, the data format is converted, the standardized operation is completed, a developer directly inputs SQL-like statements, and the BCD of the block chain database is added, modified and checked through the BDQL.

Systems, methods, and computer program products are shown for providing a corpus. An example embodiment includes automatically obtaining a plurality of software files, determining a plurality of artifacts for each of the plurality of software files, and storing the plurality of artifacts for each of the plurality of software files in a database. Additional embodiments determine some of the artifacts for each of the software files by converting each of the software files into an intermediate representation and determining at least some of the artifacts from the intermediate representation for each of the software files. Certain example embodiments determine at least some of the artifacts for each of the software files by extracting a string of characters from each of the plurality of software files. The software files can be in a source code or a binary format.

Embodiments of the present application disclose a method and an apparatus for calling an interactive control. In the method disclosed by the embodiments of the present application, a lightweight parser dedicated to parsing the jump link is embedded in the applied client in advance, and by using the jump link protocol which is naturally supported by various operating systems, interactive parameters for calling the interactive control are encapsulated into the jump link, and the interactive parameters are sent to the applied client, so that the interactive parameters are parsed by the parser to finish code update in the client. Thus, by pre-embedding the parser in the client, users do not have to install the latest client frequently; and since the parser has the single function, is lightweight, and is dedicated to parsing the jump link which is naturally supported by various operating systems, so that the parser embedded in the client is different from the SDK embedded in the client, the lightweight parser does not cause the client to be bloated, and a plurality of running memories and storage spaces on the mobile side are saved.

The invention discloses a script conversion method and device, a computer device and a storage medium, wherein the method comprises: obtaining a script identification and a target script type inputtedby a user; acquiring a script to be converted corresponding to the script identifier, and parsing the script to be converted to obtain an analysis result, wherein the analysis result comprises scriptparameter information; determining a script conversion rule according to the script parameter information; converting a script statement of the script to be converted into a target script statement corresponding to the target script type according to the determined script conversion rule; generating a target script based on the converted target script statement. The method can be applied to the data warehouse of big data, and the historical script of the data warehouse can be converted quickly and automatically, thus the conversion efficiency of the script is improved.