24 results about "Assignment" patented technology

The invention discloses an instruction-level code optimization method and device based on template matching, a medium and equipment. According to the method, instruction-level codes serve as input, the input instruction-level codes are firstly constructed into corresponding control flow diagrams, then value ranges of active variables and register quantities are initialized based on the control flow diagrams, then variable assignment instructions and related instructions are found out from instruction sequences of basic blocks to form instruction segments to be optimized, and the instruction segments to be optimized are optimized. The method comprises the following steps of: optimizing an instruction fragment, obtaining an optimized instruction fragment through template matching, performing SMT equivalence verification on the instruction fragment before and after optimization based on an active variable and a value range of a register quantity, and finally optimizing an input instruction-level code in a manner of replacing the instruction fragment before optimization with the optimized instruction fragment which is verified to be equivalent. And finally, the optimized instruction-level code is obtained.

The embodiment of the invention provides an automatic order sending method of a platform and related equipment, and belongs to the technical field of computers. The method comprises the following steps: acquiring work order information needing to be dispatched; inputting the work order information into a large language model based on cue word engineering to obtain a first-level prediction result; if the first-level prediction result contains a preset value, starting an auxiliary model, and inputting the work order information and the first-level prediction result into the auxiliary model to obtain a second-level prediction result; and fusing the first-level prediction result and the second-level prediction result to obtain an order sending result. According to the invention, order sending prediction is carried out through the large language model and the auxiliary model, so that the accuracy of order sending prediction is improved.

This invention relates to a reliable translation method for synchronous dataflow languages ​​based on the 8114 criterion, belonging to the field of code generation. The invention obtains the abstract syntax tree of the Ctemp intermediate language through lexical and syntactic analysis and translation of Lustre source code; it traverses the Ctemp abstract syntax tree and designs translation methods for control flow statements and assignment statements within the tree structure; it traverses expressions within statements and designs translation methods that add type casting to ensure that statements are semantically correct while avoiding implicit type conversions; it extends the theorem on type relations in Cltype for verifying type operations; and it extends the theorem on type casting and binary operations in Ctemp semantics to achieve semantic formal verification. This invention significantly improves the compliance of C code generated by code generation tools with the GJB 8114 specification.

A system for generating a unit test based on source code is disclosed having a computer, a source code file, an abstract syntax tree, and at least one unit test. The source code file contains a source code having a plurality of constructs each belonging to a type including functions, return statements, attribute assignments, function calls, and branches. An abstract syntax tree is generated by a computer based on a source code and a plurality of constructions, the abstract syntax tree having a plurality of nodes, where each of the plurality of constructions in the source code has a corresponding node. At least one unit test is generated by a computer based on nodes of the abstract syntax tree and predefined rules, the unit test comprising at least one packet function corresponding to a function configuration or a branch configuration, and the unit test comprising at least one trial function corresponding to a return statement configuration, an attribute assignment configuration, or a function call configuration.

The invention provides a compiling method and device, electronic equipment, a storage medium and a product, and relates to the technical field of code compiling. The compiling method comprises the steps of obtaining configuration information of a target program; based on language type information in the configuration information, determining a language type of the target program; determining compiling tool chain configuration parameters according to the language category, and assigning values to the corresponding compiling tool chain configuration parameters in the compiling command by using the configuration information to generate a target compiling command; executing the target compiling command, compiling the target program into an executable program, and running the executable program. According to the method, the language category of the target program can be determined by obtaining the language category information in the configuration information; the configuration information is utilized to configure parameter assignment for a compiling tool chain in a compiling command corresponding to the target program, and the compiling command corresponding to the target program is generated; therefore, the task of compiling the target programs of different language categories can be realized by executing the compiling command.

The invention discloses a script coding method and a script execution method for secret score calculation, and the coding method is characterized in that three script instructions are defined: instruction 1: inputting an assignment instruction of a discrimination result of an evaluation object; instruction 2: inputting an assignment instruction for scoring the unit; command 3: outputting an instruction. The key technology of the corresponding script decoding method is that the memory is used for caching unit scores, an access address is specified by an instruction 1 and an instruction 2, the scores cached by the memory are assigned by the output of the instruction 1 or the instruction 2, and the scores cached by the memory are input as an instruction 3. Also disclosed are a program and a storage medium. The method has the main technical effects that the secret evaluation score of the standard definition is realized, and a re-calculation function and a real-time programming execution effect are also realized.

There is described a computing device (900) for static analysis (301) of source code (402), the computing device being configured to: obtain an abstract code representation (204a) of the source code; generating a connection graph (701) from the abstract code representation, where the connection graph (701) represents connections between constructs in the source code (402); determining an escape scope (602, 603) of one or more nodes (601) in the connection graph (701), where the nodes (601) in the connection graph (701) correspond to the construct in the source code (402); an escape situation for the one or more nodes (601) is propagated through the connection graph (701) to generate an optimized connection graph (205a, 705), where the escape situation is based on the escape scope of the one or more nodes (601). Thereby, an optimized connection graph based on the escape scope of the node may be used to optimize the compiler (404).

The invention relates to a dynamic expression processing method based on a JSON semantic specification and a traffic transaction system, and belongs to the technical field of computer data process.The method comprises the steps that a JSON expression is defined as a JSON array with dynamic semantics, and the structure of the JSON expression at least comprises an assignment expression; the formats of the condition expression and the assignment expression are defined as ternary JSON arrays; a multi-assignment mechanism is defined, and when the assignment expression is a JSON array, multiple assignment operations are executed in sequence according to the array sequence; and defining the JSON expression group as a JSON array comprising a plurality of JSON expressions, sequentially executing the action of each JSON expression according to a sequence, and terminating the subsequent execution until detecting that the assignment result comprises a predefined termination variable. According to the method and the system, flexible business rule management can be realized in the traffic transaction system, and the research, development, operation and maintenance cost is reduced.

An embodiment may involve: obtaining textual content including a plurality of token strings, wherein each of the plurality of token strings includes one or more tokens; determining, for the plurality of token strings, respectively corresponding sets of n-gram tuples; assigning respective weights to the plurality of token strings, wherein, for each of the plurality of token strings, the assignment is based on the respectively corresponding set of n-gram tuples; identifying a subset of the plurality of token strings, wherein each of the subset of the plurality of token strings is characterized by a respective weight that exceeds a predetermined threshold weight; and storing sets of n-gram tuples respectively corresponding to the subset of the plurality of token strings.

The invention discloses a controllable mathematical instruction data synthesis method. A large language model for synthesizing mathematical instruction data performs multiple tasks at the same time. Comparing the answer of the answering process output by the large language model, the reference answer and the execution result of the program code; and if the three parameters are equal, carrying out numerical value replacement on the parameters in the output data of the seed mathematical instruction data by the large language model, and combining new numerical values of the parameters with the general mathematical problem template to form new mathematical instruction data. According to the method, starting from seed mathematical instruction data, a large language model is utilized to generate a problem solving process, a problem solving process answer, a reference answer, a parameter, a general mathematical problem template, a program code, variable assignment in the program code and an execution code. Generation of each part has clear rules and requirements, all links are matched with one another and progressive layer by layer in the generation process, and finally generated new mathematical instruction data are processed and checked for multiple rounds, so that accuracy and high quality are guaranteed.

Described are techniques for automated least privilege role definition. The techniques include enumerating access patterns including a subject, a verb, an object location, and an object type of respective Application Programming Interface (API) calls in source code associated with a binary program. For a first function call in the source code, the technique is configured to generate a first object type based on an API definition associated with the function call, a first verb based on an API-to-verb matching database, a first subject based on a program-to-subject mapping database and the binary program, and a first object location based on the API definition associated with the function call. The technique further includes generating a Role Based Access Control (RBAC) role definition based on the enumerated access patterns.

A system is provided.SOLUTION: The system includes a means for receiving a question related to assignment setting, information collection, data arrangement, and presentation input by a student in a learning process, a means for generating an appropriate prompt by a generation engine corresponding to question content, a means for transmitting the generated prompt to a natural language processing model and receiving an answer, and a means for shaping the received answer, transmitting the shaped answer to a terminal of the student, and displaying the shaped answer.SELECTED DRAWING: Figure 1

A method and apparatus for generating unit test code are provided. The method includes determining one or more assignment expressions and conditional expressions in a control flow of a function under test by traversing each expression of the control flow, wherein a variable in the conditional expression is associated with at least one of the one or more assignment expressions; eliminating the local variable in the conditional expression based on the at least one assignment expression; and generating the unit test code corresponding to the function under test based on the conditional expression in which the local variable is eliminated.

The invention relates to a runtime forcing method, industrial equipment, a system and a storage medium. In the application, when a compiler compiles an original code input by a user to generate a syntax tree, if the original code contains an assignment statement of a variable, the assignment statement is constructed into a target code supporting any bit forcing; the compiler generates an executable program according to the syntax tree and transmits the executable program to a programmable controller of the industrial equipment; when the programmable controller runs the executable program, performing bit operation according to the original value, the forced value and the forced flag bit of the variable to generate an actual value, and assigning the actual value to the variable; it can be seen that when the programmable controller runs the executable program to achieve variable enforcement, accurate assignment of the variable can be achieved through the bit operation mode, the mode eliminates a jump instruction, the program execution overhead of the programmable controller is greatly reduced, meanwhile, the scheme can further achieve a bit-level variable enforcement function, and the program enforcement efficiency is improved. And the forced fineness is improved.

According to one aspect of the present invention, an information processing system is provided, comprising at least one processor capable of executing a program such that the following steps are performed: an acquisition step, which acquires object information relating to at least one object placed in a representation space, wherein the representation space is configured to visually represent the object, the object information includes element information relating to a plurality of elements constituting the object, an assignment step, which assigns attributes different from an identification code to the elements based on the object information, wherein the identification code is a non-natural language code that is mechanically uniquely assigned to each of the plurality of elements when the object is defined in the representation space, the attributes are described in natural language, and an update step, which updates the attributes of the target element based on the latest attributes of adjacent elements adjacent to the target element, which is one of the plurality of elements.

To provide a program, a system and an information processing method for enabling a programmer or the like to preliminarily recognize the existence of an error or an anti-pattern to be generated in the execution of a program without executing a program written in an SQL sentence.SOLUTION: By the control unit 12, 52 executing the program, detecting a predetermined data manipulation language set in advance from the received SQL statement and decomposing a statement including the data manipulation language into constituent elements; Which table is being processed is specified from the decomposed components, a field of an innermost table is specified by analyzing a multilayered data manipulation language for the received SQL statement, and at least one of verification of a comparison operation and verification of an assignment operation is performed or an anti-pattern is detected for the specified field of the innermost table based on the acquired definition information.SELECTED DRAWING: Figure 1

The invention provides a code compiling method and device, electronic equipment and a readable storage medium, and relates to the technical field of processors, the method comprises the steps of obtaining an assignment statement in a to-be-compiled code and a register corresponding to each variable in the assignment statement; if a conflict register with a plurality of corresponding variables exists in the register, setting a shadow register and a semaphore for each variable corresponding to the conflict register; compiling the to-be-compiled code into a first hardware description language code comprising a shadow register and a semaphore; the shadow register is used for writing a variable value of a variable corresponding to the shadow register; the semaphore is used for sequentially writing the variable values in the shadow register into the conflict register according to the priority of the variables after the variable values are written into the shadow register. According to the method, the problem of multi-source driving errors when the same variable is assigned by a plurality of assignment statements in the code compiling process can be solved.

To reduce burdens on a human resources person in personnel relocation.SOLUTION: A work placement selection support device 10 includes: a selection information generation unit 11 that in a case where personnel information on a target person of personnel relocation corresponds to any of a plurality of selection conditions set in advance, calculates an index value for the corresponding selection condition and generates selection information that specifies work placement related to the calculated index value, an identifier of the target person, and the corresponding selection condition; and a work placement candidate selection unit 12 that selects a work placement candidate for the target person on the basis of the selection information. The selection conditions include a condition that restricts a job content in which a specific target person can engage.SELECTED DRAWING: Figure 1

The embodiment of the invention provides a compiling optimization method, electronic equipment, a compiling optimization device and a storage medium. The compilation optimization method comprises the following steps: checking a field meeting a target condition in a static language code; recording the assignment type of the field in response to the condition that the field meets the target condition; an assignment type is injected into the virtual machine code; compiling a virtual machine code; the fields meeting the target condition comprise the fields of which the assignment types are more accurate than the declaration types and which are not modified any more after assignment. According to the method, the compiler can obtain accurate type information to carry out compilation optimization during compilation in a type injection manner, so that the code compilation performance is improved.

This application provides a code compilation method, apparatus, electronic device, and readable storage medium, relating to the field of processor technology. The method includes: obtaining assignment statements in the code to be compiled, and registers corresponding to each variable in the assignment statements; if there are conflict registers with multiple corresponding variables in the registers, setting a shadow register and a semaphore for each variable corresponding to the conflict registers; compiling the code to be compiled into first hardware description language code including shadow registers and semaphores; the shadow registers are used to write the variable values ​​of the variables corresponding to the shadow registers; the semaphores are used to sequentially write the variable values ​​in the shadow registers to the conflict registers according to the priority of the variables after the variable values ​​are written to the shadow registers. The method of this application can solve the multi-source drive error problem when multiple assignment statements assign values ​​to the same variable during code compilation.

A system for generating unit tests based on source code is disclosed having a computer; a source code file containing source code having a plurality of constructs; the plurality of constructs each being of a type, such types including functions, return statements, property assignments, function calls, and branches; an abstract syntax tree generated by the computer based on the source code and the plurality of constructs; the abstract syntax tree having a plurality of nodes, wherein each of the plurality of constructs in the source code has a corresponding node; at least one unit test generated by the computer based on the nodes of the abstract syntax tree and pre-defined rules; the unit test including at least one grouping function corresponding to a function or a branch construct and at least one trial function corresponding to a return statement, a property assignment, or a function call construct.