4 results about "Context-free grammar" patented technology

The invention discloses a multi-modal property prediction method based on syntax tree constraint molecular representation. The method comprises the following steps: combining syntax tree representation based on context-independent grammar with a molecular property prediction task; setting a multi-modal feature fusion framework, and establishing strong relevance between features and prediction results; and the fusion features are finally input into the predictor network module to complete the prediction of the properties of the target molecules. According to the method, syntax tree representation based on context-independent grammar is combined with a molecular property prediction task, a hierarchical structure and a chemical grammar rule of coding molecules are displayed, it is ensured that prediction molecules meet SMILES grammar specifications, and the problem that grammar constraints of a traditional sequence model are missing is fundamentally solved.

The invention discloses a heterogeneous migration method for multiple databases, which comprises the following steps of: converting an SQL (Structured Query Language) script of a source database into an operable data structure through the combination of regular expression preprocessing and context-independent grammar analysis; obtaining a migration sequence according to the operable data structure; generating a code according to the migration sequence; and migrating the source database to the target database according to the generated code. According to the method, the database heterogeneous migration accuracy is remarkably improved.

The application discloses a kind of based on the instruction scheduling optimization method of Bisheng compiler of Peng platform, storage medium, equipment and computer program product, comprising: obtaining the source program to be scheduled by Bisheng compiler on Peng platform, whether source program is legal using context-independent grammar judgment;The power consumption required for scheduling illegal source program is calculated and sorted, and the sub-functions in the illegal source program are rearranged by dependency graph construction algorithm in turn to the illegal source program sorted from small to large;Illegal source program in sub-function is modified by log analysis method in turn to the illegal source program sorted from large to small;Illegal source program is handled using the above two methods from two ends to middle, and then whether the source program is legal after processing is judged;If still illegal, exchange two kinds of methods to handle illegal source program, judge whether the source program is legal again, if legal, carry out instruction scheduling by Bisheng compiler;Otherwise, mark the illegal source program, and alarm.

This invention discloses a fuzzy testing method for Satisfiability Modulo Theories (SMT) solvers based on large language model generator synthesis and skeleton guidance, belonging to the field of software testing technology. The method includes: extracting context-free grammars from documents using a large language model and synthesizing corresponding Boolean term generators; generating a small number of samples and parsing them using SMT solvers, collecting error information and feeding it back to the large language model for iterative self-correction until the generator outputs valid terms; randomly removing sub-formulas from seed formulas to extract the structural skeleton; calling the generator to generate new Boolean terms and filling them into the structural skeleton to synthesize new test formulas; inputting the test formulas into multiple SMT solvers for differential testing to detect solver defects. This invention requires only a one-time model interaction, significantly reducing runtime overhead while ensuring the grammatical validity of the test formulas, and can efficiently trigger deep defects in the SMT solvers.