Telemetering primitive code analysis algorithm based on semantic spanning tree model

• Main Authors: GU TIANQI, HOU KUN, LI HAOXING, MA YILEI, WANG YI, PENG XIAO, ZHOU WEI, DI YAFENG, LI MENGMENG, JIANG YONGRUI, JI ZUBI, ZHAO JUNXIANG, ZHAO LIANG, HU YU, JIN NA, FENG HUIYING, YIN SIYUAN, WANG XIAOTIAN, LI LEI
• Format: Patent
• Language: Chinese; English
• Published: 25.08.2023
• Subjects: CALCULATING; COMPUTING; COUNTING; ELECTRIC DIGITAL DATA PROCESSING; PHYSICS

A telemetering primitive code analysis algorithm based on a semantic spanning tree model comprises the steps that 1, a script character string is read, whether errors exist in the script character string or not is checked, if the errors exist in the script character string, an error result is fed back, and the analysis work is ended; if the check is successful, entering the step 2); 2) performing lexical analysis on the script character string, and obtaining a symbol queue in which token symbols are stored by using stop position characters and a character composition rule between the two stop position characters; 3) dequeuing the token symbols in the symbol queue one by one from the head of the symbol queue, respectively performing grammatical analysis, and constructing a semantic spanning tree by using a chain stack; 4) acquiring an original code value corresponding to the target physical quantity; and 5) utilizing the semantic spanning tree obtained in the step 3) and the original code value obtained in the