CN116088938B - Continuous instruction processing method and system, electronic equipment and storage medium - Google Patents

Continuous instruction processing method and system, electronic equipment and storage medium Download PDF

Info

Publication number
CN116088938B
CN116088938B CN202310385778.8A CN202310385778A CN116088938B CN 116088938 B CN116088938 B CN 116088938B CN 202310385778 A CN202310385778 A CN 202310385778A CN 116088938 B CN116088938 B CN 116088938B
Authority
CN
China
Prior art keywords
state
target
option
processed
processing
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202310385778.8A
Other languages
Chinese (zh)
Other versions
CN116088938A (en
Inventor
请求不公布姓名
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Moore Threads Technology Co Ltd
Original Assignee
Moore Threads Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Moore Threads Technology Co Ltd filed Critical Moore Threads Technology Co Ltd
Priority to CN202310385778.8A priority Critical patent/CN116088938B/en
Publication of CN116088938A publication Critical patent/CN116088938A/en
Application granted granted Critical
Publication of CN116088938B publication Critical patent/CN116088938B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/30003—Arrangements for executing specific machine instructions
    • G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
    • G06F9/30029—Logical and Boolean instructions, e.g. XOR, NOT
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
    • G06F9/32—Address formation of the next instruction, e.g. by incrementing the instruction counter
    • G06F9/322—Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address
    • G06F9/327—Address formation of the next instruction, e.g. by incrementing the instruction counter for non-sequential address for interrupts
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The disclosure relates to the technical field of computers, and discloses a continuous instruction processing method and system, electronic equipment and a storage medium, wherein the method comprises the following steps: splitting the input continuous instructions to obtain a plurality of operation options to be processed; executing state detection on any option to be processed according to the target state tree, and updating the current option state by executing state transition after the state detection is passed; after the states of the plurality of to-be-processed option are transferred, a target option state is obtained, a target state processing table is inquired, and a target processing function corresponding to the target option state is determined; and calling a target processing function, and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction. The embodiment of the disclosure can rapidly complete continuous instruction processing.

Description

Continuous instruction processing method and system, electronic equipment and storage medium
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a method and system for processing continuous instructions, an electronic device, and a storage medium.
Background
The related art sequential instruction processing method requires the use of conditional branch codes (e.g., if else, switch case, etc.) to process different logical branches, resulting in a bulky and unclear code. In addition, if a large number of conditional branch codes strongly related to the service scenario are used in the codes, the codes are difficult to multiplex. Moreover, when a processing instruction needs to be added, a branch judgment and processing logic needs to be added, and the newly added branch judgment and processing logic may be associated with or even conflict with the existing branch judgment and processing logic, so that the newly added processing instruction becomes extremely difficult and the code expansibility is poor.
Disclosure of Invention
The disclosure provides a continuous instruction processing method and system, an electronic device and a technical scheme of a storage medium.
According to an aspect of the present disclosure, there is provided a continuous instruction processing method including: splitting the input continuous instructions to obtain a plurality of to-be-processed option; for any option to be processed, performing state detection on the option to be processed according to a target state tree, and after the state detection is passed, updating a current option state by performing state transition, wherein one option state is used for indicating an option combination mode, and the target state tree comprises a plurality of predefined option states and transition relations among different predefined option states; after the states of the plurality of to-be-processed option are transferred, a target option state is obtained, a target state processing table is inquired, and a target processing function corresponding to the target option state is determined, wherein the target state processing table comprises processing functions corresponding to all predefined option states in the target state tree; and calling the target processing function, and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction.
In one possible implementation, the method further includes: pre-building the target state tree before inputting the continuous instructions; the pre-building the target state tree includes: determining a plurality of preset option modes and a plurality of option combination modes corresponding to the preset option modes; and constructing the target state tree according to the multiple option combination modes, wherein any node in the target state tree is used for indicating a predefined option state.
In one possible implementation, the method further includes: pre-building the target state processing table after building the target state tree and before inputting the continuous instructions; the pre-constructing the target state processing table includes: determining a processing function corresponding to each predefined option state in the target state tree; and constructing the target state processing table according to processing functions corresponding to each predefined option state in the target state tree.
In one possible implementation manner, for any pending option, performing state detection on the pending option according to a target state tree, where the state detection includes: judging whether a predefined option state included in the target state tree is formed after the current option state is combined with the option to be processed, and obtaining a judging result; and determining whether the option to be processed passes the state detection or not according to the judging result.
In a possible implementation manner, the determining, according to the determination result, whether the option to be processed passes state detection includes: and when the judging result is that the current option state and the option to be processed are combined to form a predefined option state included in the target state tree, determining that the option to be processed passes state detection.
In a possible implementation manner, the determining, according to the determination result, whether the option to be processed passes state detection includes: and when the judging result is that the current option state is combined with the option to be processed and then does not form any one predefined option state included in the target state tree, determining that the option to be processed does not pass state detection.
In one possible implementation, the method further includes: when the pending option fails to pass the state detection, interrupting the current instruction processing flow, and generating and sending out prompt information, wherein the prompt information is used for indicating that the error input is received.
In one possible implementation, the method further includes: for any option to be processed, when the option to be processed comprises an option value, storing the option to be processed and the option value of the option to be processed in a key value pair mode.
In one possible implementation manner, the calling the target processing function, executing instruction processing, and obtaining an instruction processing result corresponding to the continuous instruction includes: and calling the target processing function, and executing instruction processing by using the plurality of to-be-processed option and the option values thereof as parameters to obtain an instruction processing result.
In one possible implementation, the different ops have unique codes; for any option state, the unique code corresponding to the option state is determined according to the unique code corresponding to each option included in the option combination mode indicated by the option state.
According to an aspect of the present disclosure, there is provided a continuous instruction processing system including: the splitting module is used for splitting the input continuous instructions to obtain a plurality of to-be-processed option; the state detection module is used for executing state detection on any option to be processed according to a target state tree; the state transfer module is used for updating the current option state by executing state transfer after the state detection is passed, and obtaining a target option state after the state transfer is executed by the plurality of to-be-processed options, wherein one option state is used for indicating an option combination mode, and the target state tree comprises a plurality of predefined option states and transfer relations among different predefined option states; the function determining module is used for querying a target state processing table and determining a target processing function corresponding to the target option state, wherein the target state processing table comprises processing functions corresponding to each predefined option state in the target state tree; and the processing module is used for calling the target processing function and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction.
In one possible implementation, the system further includes: the target state tree construction module is used for constructing the target state tree in advance before the continuous instruction is input; the target state tree construction module is specifically configured to: determining a plurality of preset option modes and a plurality of option combination modes corresponding to the preset option modes; and constructing the target state tree according to the multiple option combination modes, wherein any node in the target state tree is used for indicating a predefined option state.
In one possible implementation, the system further includes: a target state processing table construction module, configured to construct the target state processing table in advance after the target state tree is constructed and before the continuous instruction is input; the target state processing table construction module is specifically configured to: determining a processing function corresponding to each predefined option state in the target state tree; and constructing the target state processing table according to processing functions corresponding to each predefined option state in the target state tree.
In one possible implementation manner, the state detection module includes: the judging sub-module is used for judging whether a predefined option state included in the target state tree is formed after the current option state is combined with the option to be processed, so as to obtain a judging result; and the determining submodule is used for determining whether the option to be processed passes the state detection or not according to the judging result.
In one possible implementation, the determining submodule is configured to: and when the judging result is that the current option state and the option to be processed are combined to form a predefined option state included in the target state tree, determining that the option to be processed passes state detection.
In one possible implementation, the determining submodule is configured to: and when the judging result is that the current option state is combined with the option to be processed and then does not form any one predefined option state included in the target state tree, determining that the option to be processed does not pass state detection.
In one possible implementation, the system further includes: the interrupt module is used for interrupting the current instruction processing flow when the to-be-processed option fails to pass the state detection; the prompt module is used for generating and sending out prompt information, wherein the prompt information is used for indicating that the error input is received.
In one possible implementation, the system further includes: the storage module is used for storing the option to be processed and the option value of the option to be processed according to a key value pair mode when the option to be processed comprises the option value.
In one possible implementation manner, the processing module is configured to: and calling the target processing function, and executing instruction processing by using the plurality of to-be-processed option and the option values thereof as parameters to obtain an instruction processing result.
In one possible implementation, the different ops have unique codes; for any option state, the unique code corresponding to the option state is determined according to the unique code corresponding to each option included in the option combination mode indicated by the option state.
According to an aspect of the present disclosure, there is provided an electronic apparatus including: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to invoke the instructions stored in the memory to perform the above method.
According to an aspect of the present disclosure, there is provided a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the above-described method.
In the embodiment of the disclosure, splitting an input continuous instruction to obtain a plurality of to-be-processed ops; for any option to be processed, executing state detection on the option to be processed according to a target state tree comprising a plurality of predefined option states and transition relations among different predefined option states, and updating the current option state by executing state transition after the state detection is passed, wherein one option state is used for indicating an option combination mode; after the state transition is carried out on the plurality of to-be-processed option, a target option state is obtained, a target state processing table comprising processing functions corresponding to all predefined option states in a target state tree is queried, and a target processing function corresponding to the target option state is determined; and calling a target processing function, and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction. By constructing the target state tree and the target state processing table in advance, any correctly input continuous instruction can be abstracted into a target option state, the condition that a large number of condition transfer codes are used to cause the code to be bloated and unclear is avoided, further, continuous instruction processing can be completed rapidly by calling a target processing function corresponding to the target option state, and the target state tree and the target state processing table can be multiplexed among different continuous instructions, so that the expandability of the continuous instruction is realized.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure. Other features and aspects of the present disclosure will become apparent from the following detailed description of exemplary embodiments, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the technical aspects of the disclosure.
Fig. 1 shows a flowchart of a sequential instruction processing method according to an embodiment of the present disclosure.
FIG. 2 shows a schematic diagram of a target state tree according to an embodiment of the present disclosure.
Fig. 3 illustrates a schematic diagram of uniquely encoding different preset operations according to an embodiment of the present disclosure.
Fig. 4 shows a schematic diagram of a bitmap-form object state tree according to an embodiment of the present disclosure.
Fig. 5 illustrates a schematic diagram of a preset operation in which any one of predefined operating states can accept input according to an embodiment of the present disclosure.
Fig. 6 shows a schematic diagram of a state transition path from an initial state to a predefined operating state 7 according to an embodiment of the present disclosure.
Fig. 7 shows a schematic diagram of a target state processing table according to an embodiment of the disclosure.
Fig. 8 illustrates a flowchart of performing state detection for any one of the pending operations, according to an embodiment of the present disclosure.
FIG. 9 illustrates a block diagram of a sequential instruction processing system, according to an embodiment of the present disclosure.
Fig. 10 shows a block diagram of an electronic device, according to an embodiment of the disclosure.
Detailed Description
Various exemplary embodiments, features and aspects of the disclosure will be described in detail below with reference to the drawings. In the drawings, like reference numbers indicate identical or functionally similar elements. Although various aspects of the embodiments are illustrated in the accompanying drawings, the drawings are not necessarily drawn to scale unless specifically indicated.
The word "exemplary" is used herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.
The term "and/or" is herein merely an association relationship describing an associated object, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone. In addition, the term "at least one" herein means any one of a plurality or any combination of at least two of a plurality, for example, including at least one of A, B, C, and may mean including any one or more elements selected from the group consisting of A, B and C.
Furthermore, numerous specific details are set forth in the following detailed description in order to provide a better understanding of the present disclosure. It will be understood by those skilled in the art that the present disclosure may be practiced without some of these specific details. In some instances, methods, means, elements, and circuits well known to those skilled in the art have not been described in detail in order not to obscure the present disclosure.
Fig. 1 shows a flowchart of a sequential instruction processing method according to an embodiment of the present disclosure. The method may be performed by an electronic device, such as a terminal device or a server, the terminal device may be a User Equipment (UE), a mobile device, a User terminal, a cellular phone, a cordless phone, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device, a computing device, a vehicle mounted device, a wearable device, etc., and the method may be implemented by a processor invoking computer readable instructions stored in a memory. Alternatively, the method may be performed by a server. As shown in fig. 1, the method includes:
in step S11, the input continuous instruction is split to obtain a plurality of pending ops.
In general, the input form of the continuous instruction may be a character string form or any binary data. Taking the string form as an example, a certain continuous instruction input may be "-a=valuea-b=valueb-C-D-e=value". Wherein "A, B, C, D, E" may be referred to as an option, representing the processing that this successive instruction would like to request to be performed; "valueA, valueB, valueE" may be an option value corresponding to option "A, B, E". An option may or may not have an option value that is a complement to an option.
For example, it is desirable to query system hardware information in a system and output the queried information into a file a.txt, one possible sequential instruction input is: -Query = hardware-LogFile = a.txt. The Query and the LogFile are the option, and the hardware and the a.txt are the option values corresponding to the Query and the LogFile, respectively. hardware indicates that hardware information is to be queried, and a.txt indicates the log file name of the specified output.
After receiving an input continuous instruction, splitting the continuous instruction to obtain a plurality of pending ops. For example, for the above sequential instruction-query=hardware-log file=a.txt, two independent pending options are obtained after splitting: query and LogFile.
In one possible implementation, the method further includes: for any option to be processed, when the option to be processed comprises an option value, storing the option to be processed and the option value of the option to be processed in a key value pair mode.
And storing the option to be processed and the option value thereof in a key value pair mode, and preparing for entering the parameters of the subsequent processing function.
For example, for the above-described sequential instruction-query=hardware-log file=a.txt, the pending option is to: query and its corresponding option value: hardware stores in key-value pairs (key-value) and will wait for the option: log file and its corresponding option value: txt is stored in the form of key-value pairs (key-value).
In step S12, for any one of the pending option, performing state detection on the pending option according to a target state tree, and after the state detection passes, updating a current option state by performing state transition, where one option state is used to indicate an option combination mode, and the target state tree includes a plurality of predefined option states and transition relationships between different predefined option states.
And sequentially inputting a plurality of to-be-processed option obtained by splitting the continuous instruction into a pre-constructed target state tree comprising a plurality of predefined option states. And aiming at any one input option to be processed, executing state detection according to the target state tree, and judging whether the option to be processed is a correct input or not.
The target state tree is pre-built before executing the sequential instruction processing application scenario. The specific process of constructing the target state tree and the specific process of state detection will be described in detail below according to possible implementation manners of the present disclosure, and will not be described herein.
After the pending option state is detected, the pending option is indicated as being correctly input, so that state transition is executed according to transition relations among different predefined option states included in the target state tree, and the current option state is updated. The option state obtained after the state transfer is an option state formed by combining the option state before the state transfer and the input option to be processed, namely an option combination. The following describes the state detection process in detail according to a possible implementation manner of the present disclosure, which is not described herein.
In step S13, after the plurality of pending option have all performed state transition, a target option state is obtained, and a target state processing table is queried to determine a target processing function corresponding to the target option state, where the target state processing table includes processing functions corresponding to each predefined option state in the target state tree.
And (3) a plurality of pending option obtained by splitting the continuous instruction pass through state detection, and after the state transition is sequentially executed, a target option state, namely a target option combination corresponding to the continuous instruction, is obtained.
After the target option states corresponding to the continuous instructions are obtained, determining target processing functions corresponding to the target option states, namely the target processing functions corresponding to the continuous instructions, by querying a pre-built target state processing table comprising processing functions corresponding to each predefined option state in a target state tree.
The target state processing table is pre-built before executing the sequential instruction processing application scenario. The specific process of constructing the target state processing table will be described in detail in connection with possible implementation manners of the present disclosure, which will not be described herein.
In step S14, the target processing function is called, and instruction processing is performed, so as to obtain an instruction processing result corresponding to the continuous instruction.
And (3) processing the continuous instructions by calling a target processing function corresponding to the target option state to obtain instruction processing results corresponding to the continuous instructions. The specific process of executing instruction processing on the call target processing function will be described in detail in connection with possible implementation manners of the present disclosure, which will not be described herein.
In the embodiment of the disclosure, by constructing the target state tree and the target state processing table in advance, any correctly input continuous instruction can be abstracted into a target option state, so that the condition that a large number of condition transfer codes are used to cause the code to be bulky and unclear is avoided, further, continuous instruction processing can be rapidly completed by calling the target processing function corresponding to the target option state, and the target state tree and the target state processing table can be multiplexed among different continuous instructions, thereby realizing the expandability of the continuous instruction.
The target state tree and the target state processing table are previously constructed before the continuous instruction processing method shown in fig. 1 is executed, and a detailed description is given below of a specific process of constructing the target state tree and the target state processing table.
In one possible implementation, the method further includes: pre-building a target state tree before inputting a continuous instruction; pre-building a target state tree, including: determining a plurality of preset option modes and a plurality of option combination modes corresponding to the preset option modes; and constructing a target state tree according to a plurality of option combination modes, wherein any node in the target state tree is used for indicating a predefined option state.
In the initialization phase, a plurality of preset options are determined. The preset option may be any option that may be input, and the specific form and number of preset options may be determined according to actual situations, which is not specifically limited in the present disclosure. Determining a plurality of preset options and a plurality of option combination modes in which the preset options possibly appear. An option combination may be abstracted into a predefined option state. The set of a plurality of predefined option states forms a target state tree.
For example, the plurality of preset options includes: A. b, C, D, E, F, the combination modes of the plurality of preset options which may appear include: A. b, C, AB, AD, BD, CE, CF, ABD. Thus, the plurality of predefined option states includes: A. b, C, AB, AD, BD, CE, CF, ABD. The set of predefined option states forms a target state tree. FIG. 2 shows a schematic diagram of a target state tree according to an embodiment of the present disclosure. As shown in fig. 2, any node in the target state tree is used to indicate a predefined operation state (predefined option state), and the connection between the node and its child node is represented, which can cause the transition from the predefined option state indicated by the node to the input of the predefined option state indicated by the child node. Without any input initialization, the root node (root) indicates null. As shown in fig. 2, a box is used to indicate an input preset operation (preset option), and a circle is used to indicate a predefined operation state (predefined option state). As shown in fig. 2, after a preset operation (preset option) D is input in a predefined operation state (predefined option state) a, the operation is shifted to a predefined operation state (predefined option state) AD. The remaining predefined operating states, and the state transitions after accepting input in the predefined operating states, are shown in fig. 2, and are not described in detail herein.
In one possible implementation, the different ops have unique codes; for any option state, the unique code corresponding to the option state is determined according to the unique code corresponding to each option included in the option combination mode indicated by the option state.
To better distinguish between representing different preset options, each preset option may be uniquely encoded.
For example, in the case where there are 4 preset ops, the 4 preset ops may be uniquely encoded using 4-bit binary encoding. Fig. 3 illustrates a schematic diagram of uniquely encoding different preset operations according to an embodiment of the present disclosure. As shown in fig. 3, preset operation 1 (preset option 1) is encoded to 0001, preset operation 2 (preset option 2) is encoded to 0010, preset operation 3 (preset option 3) is encoded to 0100, and preset operation 4 (preset option 4) is encoded to 1000. Wherein 0001, 0010, 0100, 1000 are binary numbers.
According to actual situation, more digits of codes can be adopted to carry out unique codes on a plurality of preset ops, for example, 16-bit, 32-bit, 64-bit or more than 64-bit custom data and the like, the digits of the codes can depend on the number of preset ops, and the disclosure is not limited in particular. In addition to the unique encoding of the different ops by binary encoding, other encoding forms may be used to uniquely encode the different ops, which is not particularly limited in this disclosure.
After each preset option is uniquely encoded with binary encoding, the predefined option state may be represented by an or operation between different preset options. For example, after the or operation is performed on the code 0001 of the preset option1 and the code 0010 of the preset option2, the predetermined option state 0011 is indicated, and so on, which is not described in detail.
Further, the target state tree can be stored in a simpler bitmap form. Fig. 4 shows a schematic diagram of a bitmap-form object state tree according to an embodiment of the present disclosure. As shown in fig. 4, 9 predefined operation states (predefined option states) are included in the target state tree: predefined operation state 0 (predefined option state 0) to predefined operation state 8 (predefined option state 8).
In the bitmap-form object state tree shown in fig. 4, a preset option which can be accepted by each predefined option state and a predefined option state obtained after accepting the execution state transition of the preset option are implicitly included. Fig. 5 illustrates a schematic diagram of a preset operation in which any one of predefined operating states can accept input according to an embodiment of the present disclosure. As shown in fig. 5, when the current state is a predefined operation state 0001 (predefined option state 0), the preset operation that can accept an input includes: 0010 (preset option 2), or 0100 (preset option 3), or 1000 (preset option 4). Predefined option state 0 (0001) accepts input preset option2 (0010), and predefined option state 4 (0011) can be obtained after state transition; or predefined option state 0 (0001) accepts the input preset option3 (0100), and predefined option state 5 (0101) can be obtained after state transition; or predefined option state 0 (0001) accepts input preset option4 (1000), and after state transition, predefined option state 6 (1001) can be obtained.
As shown in fig. 5, when the current state is the predefined operation state 1001 (predefined option state 6) or 1111 (predefined option state 8), it can accept the inputted preset operation as none, i.e. there is no acceptable preset option, because it cannot transition to the existing predefined option state after accepting any preset option, i.e. it indicates an erroneous input after accepting any preset option. Other preset operations in which the predefined operation state can accept input are shown in fig. 5, and are not described here.
Based on the schematic diagram of the preset option that any one of the predefined option states can accept input, a state transition path between different predefined option states can be obtained. Fig. 6 shows a schematic diagram of a state transition path from an initial state to a predefined operating state 7 according to an embodiment of the present disclosure. Similarly, other state transition paths may be obtained, and will not be described in detail herein.
As shown in fig. 6, the transition from the initial state to the predefined operation state 7 includes two-bar state transition paths. First state transition path: after the initial state (0000) accepts the input preset operation 1 (0001), the method transitions to the predefined operation state 0 (0001); after the predefined operation state 0 accepts the input preset operation 2 (0010), the method transitions to a predefined operation state 4 (0011); after the predefined operation state 4 accepts the input preset operation 3 (0100), it shifts to the predefined operation state 7 (0111). Second state transition path: after the initial state 0000 accepts the input preset operation 2 (0010), it transits to the predefined operation state 1 (0010); after the predefined operation state 1 accepts the input preset operation 1 (0001), the operation state transitions to the predefined operation state 4 (0011); after the predefined operation state 4 accepts the input preset operation 3 (0100), it shifts to the predefined operation state 7 (0111).
In one possible implementation, the method further includes: pre-building a target state processing table after building a target state tree and before inputting continuous instructions; pre-building a target state processing table, including: determining a processing function corresponding to each predefined option state in the target state tree; and constructing a target state processing table according to processing functions corresponding to each predefined option state in the target state tree.
After the target state tree is obtained in the initialization stage, determining processing functions corresponding to each predefined option state in the target state tree, and further constructing a target state processing table. The processing function corresponding to the predefined option state may be determined according to an actual situation, and the predefined option state and the processing function may be in a one-to-one relationship, or may be that a plurality of predefined option states correspond to the same processing function, which is not specifically limited in the present disclosure.
Fig. 7 shows a schematic diagram of a target state processing table according to an embodiment of the disclosure. Taking the target state tree shown in fig. 2 as an example, determining corresponding processing functions for each predefined option state in the target state tree shown in fig. 2, to obtain the target state processing table shown in fig. 7. As shown in fig. 7, the predefined operation state (predefined option state) a corresponds to the processing function 1, the predefined operation state B (predefined option state B) corresponds to the processing function 2, and the processing functions corresponding to the remaining predefined operation states are shown in fig. 7, which is not described herein.
After the target state tree and the target state processing table are previously constructed in the above manner, the user can execute continuous instruction processing using the target state tree and the target state processing table: splitting the input continuous instructions to obtain a plurality of pending ops, and then sequentially inputting the pending ops into a target state tree to execute state detection.
In one possible implementation manner, for any one option to be processed, performing state detection on the option to be processed according to a target state tree, including: judging whether a predefined option state included in a target state tree is formed after the current option state is combined with the option to be processed, and obtaining a judging result; and determining whether the option to be processed passes the state detection according to the judging result.
Any one pending option needs to execute state detection after inputting a target state tree. The method comprises the steps of judging whether a current option state is a predefined option state in a target state tree, judging whether the current option state is combined with the input option to be processed after the current option state is input into the predefined option state in the target state tree, judging whether the option to be processed is correctly input or not according to the judgment result, and determining whether the option to be processed passes state detection or not according to the judgment result.
Fig. 8 illustrates a flowchart of performing state detection for any one of the pending operations, according to an embodiment of the present disclosure. As shown in fig. 8, the current option state is a predefined operation state 1 (predefined option state 1) in the target state tree, and an input operation to be processed (an option to be processed) is received in the current option state, and further, state detection is performed on the option to be processed, so as to determine whether the option to be processed is a correct input or an incorrect input.
In one possible implementation manner, determining whether the option to be processed passes the state detection according to the determination result includes: and when the judgment result is that the current option state is combined with the option to be processed to form a predefined option state included in the target state tree, determining that the option to be processed passes state detection.
When the current option state and the to-be-processed option are combined to form a predefined option state included in the target state tree, it can be determined that the to-be-processed option is correctly input, that is, the to-be-processed option passes state detection.
After the pending option passes the state detection, executing a state transition to update the current option state, wherein the updated option state is an option state formed by combining the pre-update option and the input pending option, and the option state is also a predefined option state included in the target state tree.
As shown in fig. 8, after determining that the inputted pending option is a correct input, a state transition is performed from the current predefined operation state 1 (predefined option state 1) to the predefined operation state 2 (predefined option state 2), wherein the predefined option state 2 is an option state constituted by combining the predefined option state 1 with the inputted pending option.
In one possible implementation manner, determining whether the option to be processed passes the state detection according to the determination result includes: and when the judgment result is that the current option state is combined with the option to be processed and does not form any predefined option state included in the target state tree, determining that the option to be processed does not pass the state detection.
After the current option state is combined with the to-be-processed option, any predefined option state included in the target state tree is not formed, and it can be determined that the to-be-processed option is an error input, that is, the to-be-processed option fails to pass state detection.
In one possible implementation, the method further includes: when the pending option fails to pass the state detection, interrupting the current instruction processing flow, and generating and sending out prompt information, wherein the prompt information is used for indicating that the error input is received.
When the current input to-be-processed option is determined to be the error input, namely the current input to-be-processed option fails to pass the state detection, the whole instruction processing flow is interrupted, and prompt information for indicating that the error input is received is generated and sent.
As shown in fig. 8, when it is determined that the currently input pending option is an erroneous input, a hint information indicating that the erroneous input was received is generated and issued.
The currently input pending option is a cause of erroneous input, may be an editing error of a user, may be other options beyond a preset option, and may be other causes, which is not specifically limited in this disclosure.
In one possible implementation manner, the method calls a target processing function, executes instruction processing to obtain an instruction processing result corresponding to a continuous instruction, and includes: and calling a target processing function, and executing instruction processing by using a plurality of to-be-processed option and option values thereof as parameters to obtain an instruction processing result.
When a plurality of pending option obtained by splitting continuous instructions pass through state detection and state transition is sequentially executed, a target option state can be obtained. Further, the target processing function corresponding to the target option state can be determined by querying the target state processing table.
And executing instruction processing by calling a target processing function and taking a plurality of to-be-processed option and option values thereof as parameters to obtain an instruction processing result corresponding to the continuous instruction, thereby ending the whole continuous instruction processing flow.
In the embodiment of the disclosure, splitting an input continuous instruction to obtain a plurality of to-be-processed ops; for any option to be processed, executing state detection on the option to be processed according to a target state tree comprising a plurality of predefined option states and transition relations among different predefined option states, and updating the current option state by executing state transition after the state detection is passed, wherein one option state is used for indicating an option combination mode; after the state transition is carried out on the plurality of to-be-processed option, a target option state is obtained, a target state processing table comprising processing functions corresponding to all predefined option states in a target state tree is queried, and a target processing function corresponding to the target option state is determined; and calling a target processing function, and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction. By constructing the target state tree and the target state processing table in advance, any correctly input continuous instruction can be abstracted into a target option state, the condition that a large number of condition transfer codes are used to cause the code to be bloated and unclear is avoided, further, continuous instruction processing can be completed rapidly by calling a target processing function corresponding to the target option state, and the target state tree and the target state processing table can be multiplexed among different continuous instructions, so that the expandability of the continuous instruction is realized.
It will be appreciated that the above-mentioned method embodiments of the present disclosure may be combined with each other to form a combined embodiment without departing from the principle logic, and are limited to the description of the present disclosure. It will be appreciated by those skilled in the art that in the above-described methods of the embodiments, the particular order of execution of the steps should be determined by their function and possible inherent logic.
In addition, the disclosure further provides a continuous instruction processing system, an electronic device, a computer readable storage medium, and a program, where the foregoing may be used to implement any one of the continuous instruction processing methods provided in the disclosure, and corresponding technical schemes and descriptions and corresponding descriptions referring to method parts are not repeated.
FIG. 9 illustrates a block diagram of a sequential instruction processing system, according to an embodiment of the present disclosure. As shown in fig. 9, the system 90 includes:
a splitting module 91, configured to split an input continuous instruction to obtain a plurality of pending ops;
the state detection module 92 is configured to execute state detection on any option to be processed according to the target state tree;
a state transition module 93, configured to update a current option state by executing state transition after the state detection passes, and obtain a target option state after the state transition is performed by each of the plurality of pending options, where one option state is used to indicate an option combination mode, and the target state tree includes a plurality of predefined option states and transition relationships between different predefined option states;
The function determining module 94 is configured to query a target state processing table, and determine a target processing function corresponding to a target option state, where the target state processing table includes processing functions corresponding to predefined option states in a target state tree;
the processing module 95 invokes the target processing function to execute instruction processing, and obtains an instruction processing result corresponding to the continuous instruction.
In one possible implementation, the system 90 further includes: the target state tree construction module is used for constructing a target state tree in advance before a continuous instruction is input;
the target state tree construction module is specifically used for:
determining a plurality of preset option modes and a plurality of option combination modes corresponding to the preset option modes;
and constructing a target state tree according to a plurality of option combination modes, wherein any node in the target state tree is used for indicating a predefined option state.
In one possible implementation, the system 90 further includes: the target state processing table construction module is used for pre-constructing a target state processing table after constructing a target state tree and before inputting continuous instructions;
the target state processing table construction module is specifically used for:
determining a processing function corresponding to each predefined option state in the target state tree;
And constructing a target state processing table according to processing functions corresponding to each predefined option state in the target state tree.
In one possible implementation, the status detection module 92 includes:
the judging sub-module is used for judging whether a predefined option state included in the target state tree is formed after the current option state is combined with the option to be processed, so as to obtain a judging result;
and the determining submodule is used for determining whether the option to be processed passes the state detection according to the judging result.
In one possible implementation, the determining sub-module is configured to:
and when the judging result is that the current option state and the option to be processed are combined to form a predefined option state included in the target state tree, determining that the option to be processed passes the state detection.
In one possible implementation, the determining sub-module is configured to:
and when the judgment result is that the current option state is combined with the option to be processed and does not form any predefined option state included in the target state tree, determining that the option to be processed does not pass the state detection.
In one possible implementation, the system 90 further includes:
the interrupt module is used for interrupting the current instruction processing flow when the to-be-processed option does not pass the state detection;
And the prompt module is used for generating and sending out prompt information, wherein the prompt information is used for indicating that the error input is received.
In one possible implementation, the system 90 further includes:
the storage module is used for storing the option to be processed and the option value of the option to be processed according to a key value pair mode when the option to be processed comprises the option value.
In one possible implementation, the processing module 95 is configured to:
and calling a target processing function, and executing instruction processing by using a plurality of to-be-processed option and option values thereof as parameters to obtain an instruction processing result.
In one possible implementation, the different ops have unique codes; for any option state, the unique code corresponding to the option state is determined according to the unique code corresponding to each option included in the option combination mode indicated by the option state.
The method has specific technical association with the internal structure of the computer system, and can solve the technical problems of improving the hardware operation efficiency or the execution effect (including reducing the data storage amount, reducing the data transmission amount, improving the hardware processing speed and the like), thereby obtaining the technical effect of improving the internal performance of the computer system which accords with the natural law.
In some embodiments, functions or modules included in an apparatus provided by the embodiments of the present disclosure may be used to perform a method described in the foregoing method embodiments, and specific implementations thereof may refer to descriptions of the foregoing method embodiments, which are not repeated herein for brevity.
The disclosed embodiments also provide a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the above-described method. The computer readable storage medium may be a volatile or nonvolatile computer readable storage medium.
The embodiment of the disclosure also provides an electronic device, which comprises: a processor; a memory for storing processor-executable instructions; wherein the processor is configured to invoke the instructions stored in the memory to perform the above method.
Embodiments of the present disclosure also provide a computer program product comprising computer readable code, or a non-transitory computer readable storage medium carrying computer readable code, which when run in a processor of an electronic device, performs the above method.
The electronic device may be provided as a terminal, server or other form of device.
Fig. 10 shows a block diagram of an electronic device, according to an embodiment of the disclosure. Referring to fig. 10, an electronic device 1900 may be provided as a server or terminal device. Referring to fig. 10, electronic device 1900 includes a processing component 1922 that further includes one or more processors and memory resources represented by memory 1932 for storing instructions, such as application programs, that can be executed by processing component 1922. The application programs stored in memory 1932 may include one or more modules each corresponding to a set of instructions. Further, processing component 1922 is configured to execute instructions to perform the methods described above.
The electronic device 1900 may also include a power component 1926 configured to perform power management of the electronic device 1900, a wired or wireless network interface 1950 configured to connect the electronic device 1900 to a network, and an input/output interface 1958. Electronic device 1900 may operate an operating system based on memory 1932, such as the Microsoft Server operating system (Windows Server) TM ) Apple Inc. developed graphical user interface based operating System (Mac OS X TM ) Multi-user multi-process computer operating system (Unix) TM ) Unix-like operating system (Linux) of free and open source code TM ) Unix-like operating system (FreeBSD) with open source code TM ) Or the like.
In an exemplary embodiment, a non-transitory computer readable storage medium is also provided, such as memory 1932, including computer program instructions executable by processing component 1922 of electronic device 1900 to perform the methods described above.
The present disclosure may be a system, method, and/or computer program product. The computer program product may include a computer readable storage medium having computer readable program instructions embodied thereon for causing a processor to implement aspects of the present disclosure.
The computer readable storage medium may be a tangible device that can hold and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: portable computer disks, hard disks, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), static Random Access Memory (SRAM), portable compact disk read-only memory (CD-ROM), digital Versatile Disks (DVD), memory sticks, floppy disks, mechanical coding devices, punch cards or in-groove structures such as punch cards or grooves having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media, as used herein, are not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through waveguides or other transmission media (e.g., optical pulses through fiber optic cables), or electrical signals transmitted through wires.
The computer readable program instructions described herein may be downloaded from a computer readable storage medium to a respective computing/processing device or to an external computer or external storage device over a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmissions, wireless transmissions, routers, firewalls, switches, gateway computers and/or edge servers. The network interface card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium in the respective computing/processing device.
Computer program instructions for performing the operations of the present disclosure can be assembly instructions, instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, c++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may be executed entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present disclosure are implemented by personalizing electronic circuitry, such as programmable logic circuitry, field Programmable Gate Arrays (FPGAs), or Programmable Logic Arrays (PLAs), with state information of computer readable program instructions, which can execute the computer readable program instructions.
Various aspects of the present disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.
These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable medium having the instructions stored therein includes an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The computer program product may be realized in particular by means of hardware, software or a combination thereof. In an alternative embodiment, the computer program product is embodied as a computer storage medium, and in another alternative embodiment, the computer program product is embodied as a software product, such as a software development kit (Software Development Kit, SDK), or the like.
The foregoing description of various embodiments is intended to highlight differences between the various embodiments, which may be the same or similar to each other by reference, and is not repeated herein for the sake of brevity.
It will be appreciated by those skilled in the art that in the above-described method of the specific embodiments, the written order of steps is not meant to imply a strict order of execution but rather should be construed according to the function and possibly inherent logic of the steps.
If the technical scheme of the application relates to personal information, the product applying the technical scheme of the application clearly informs the personal information processing rule before processing the personal information, and obtains independent consent of the individual. If the technical scheme of the application relates to sensitive personal information, the product applying the technical scheme of the application obtains individual consent before processing the sensitive personal information, and simultaneously meets the requirement of 'explicit consent'. For example, a clear and remarkable mark is set at a personal information acquisition device such as a camera to inform that the personal information acquisition range is entered, personal information is acquired, and if the personal voluntarily enters the acquisition range, the personal information is considered as consent to be acquired; or on the device for processing the personal information, under the condition that obvious identification/information is utilized to inform the personal information processing rule, personal authorization is obtained by popup information or a person is requested to upload personal information and the like; the personal information processing rule may include information such as a personal information processor, a personal information processing purpose, a processing mode, and a type of personal information to be processed.
The foregoing description of the embodiments of the present disclosure has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the improvement of technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (20)

1. A method of processing successive instructions, comprising:
splitting the input continuous instructions to obtain a plurality of operations to be processed;
for any operation to be processed, performing state detection on the operation to be processed according to a target state tree to judge whether the operation to be processed is correctly input, and after the state detection is passed, updating a current operation state by performing state transition, wherein the operation state obtained after the state transition is an operation state formed by combining an operation state before the state transition with the operation to be processed, and one operation state is used for indicating an operation combination mode, and the target state tree comprises a plurality of predefined operation states and transition relations among different predefined operation states;
After the state transition is carried out on the plurality of to-be-processed operations, obtaining a target operation state corresponding to the continuous instruction, and inquiring a target state processing table to determine a target processing function corresponding to the target operation state, wherein the target state processing table comprises processing functions corresponding to all predefined operation states in the target state tree;
calling the target processing function, and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction;
the executing, for any one of the pending operations, the state detection on the pending operation according to the target state tree includes:
judging whether a predefined operation state included in the target state tree is formed after the current operation state is combined with the operation to be processed, and obtaining a judgment result;
and determining whether the operation to be processed passes the state detection or not according to the judging result.
2. The method according to claim 1, wherein the method further comprises: pre-building the target state tree before inputting the continuous instructions;
the pre-building the target state tree includes:
determining a plurality of preset operations and a plurality of operation combination modes corresponding to the preset operations;
And constructing the target state tree according to the operation combination modes, wherein any node in the target state tree is used for indicating a predefined operation state.
3. The method according to claim 2, wherein the method further comprises: pre-building the target state processing table after building the target state tree and before inputting the continuous instructions;
the pre-constructing the target state processing table includes:
determining processing functions corresponding to each predefined operation state in the target state tree;
and constructing the target state processing table according to processing functions corresponding to each predefined operation state in the target state tree.
4. The method according to claim 1, wherein determining whether the pending operation passes state detection according to the determination result comprises:
and when the judging result is that the current operation state and the to-be-processed operation are combined to form one predefined operation state included in the target state tree, determining that the to-be-processed operation passes state detection.
5. The method according to claim 1, wherein determining whether the pending operation passes state detection according to the determination result comprises:
And when the judgment result is that the current operation state is combined with the to-be-processed operation and does not form any one of the predefined operation states included in the target state tree, determining that the to-be-processed operation does not pass state detection.
6. The method of claim 5, wherein the method further comprises:
when the operation to be processed does not pass the state detection, interrupting the current instruction processing flow, and generating and sending out prompt information, wherein the prompt information is used for indicating that the error input is received.
7. The method according to claim 1, wherein the method further comprises:
and storing the operation values of the operation to be processed and the operation to be processed according to a key value pair when the operation to be processed comprises the operation value aiming at any operation to be processed.
8. The method of claim 7, wherein the calling the target processing function to perform instruction processing to obtain an instruction processing result corresponding to the continuous instruction comprises:
and calling the target processing function, and executing instruction processing by using the plurality of to-be-processed operations and the operation values thereof as parameters to obtain an instruction processing result.
9. The method of any one of claims 1 to 8, wherein the different operations have unique codes; for any one operation state, the unique code corresponding to the operation state is determined according to the unique code corresponding to each operation included in the operation combination mode indicated by the operation state.
10. A sequential instruction processing system, comprising:
the splitting module is used for splitting the input continuous instructions to obtain a plurality of operations to be processed;
the state detection module is used for executing state detection on any operation to be processed according to a target state tree so as to judge whether the operation to be processed is correctly input;
the state transfer module is used for updating the current operation state by executing state transfer after the state detection is passed, and obtaining a target operation state corresponding to the continuous instruction after the state transfer is completed for all the plurality of pending operations, wherein the operation state obtained after the state transfer is an operation state formed by combining the operation state before the state transfer with the pending operation, one operation state is used for indicating an operation combination mode, and the target state tree comprises a plurality of predefined operation states and transfer relations among different predefined operation states;
The function determining module is used for querying a target state processing table and determining a target processing function corresponding to the target operation state, wherein the target state processing table comprises processing functions corresponding to all predefined operation states in the target state tree;
the processing module is used for calling the target processing function and executing instruction processing to obtain an instruction processing result corresponding to the continuous instruction;
the state detection module comprises:
the judging submodule is used for judging whether a predefined operation state included in the target state tree is formed after the current operation state is combined with the operation to be processed, so as to obtain a judging result;
and the determining submodule is used for determining whether the operation to be processed passes the state detection or not according to the judging result.
11. The system of claim 10, wherein the system further comprises: the target state tree construction module is used for constructing the target state tree in advance before the continuous instruction is input;
the target state tree construction module is specifically configured to:
determining a plurality of preset operations and a plurality of operation combination modes corresponding to the preset operations;
And constructing the target state tree according to the operation combination modes, wherein any node in the target state tree is used for indicating a predefined operation state.
12. The system of claim 11, wherein the system further comprises: a target state processing table construction module, configured to construct the target state processing table in advance after the target state tree is constructed and before the continuous instruction is input;
the target state processing table construction module is specifically configured to:
determining processing functions corresponding to each predefined operation state in the target state tree;
and constructing the target state processing table according to processing functions corresponding to each predefined operation state in the target state tree.
13. The system of claim 10, wherein the determining submodule is configured to:
and when the judging result is that the current operation state and the to-be-processed operation are combined to form one predefined operation state included in the target state tree, determining that the to-be-processed operation passes state detection.
14. The system of claim 10, wherein the determining submodule is configured to:
And when the judgment result is that the current operation state is combined with the to-be-processed operation and does not form any one of the predefined operation states included in the target state tree, determining that the to-be-processed operation does not pass state detection.
15. The system of claim 14, wherein the system further comprises:
the interrupt module is used for interrupting the current instruction processing flow when the operation to be processed does not pass the state detection;
the prompt module is used for generating and sending out prompt information, wherein the prompt information is used for indicating that the error input is received.
16. The system of claim 10, wherein the system further comprises:
the storage module is used for storing the operation to be processed and the operation value of the operation to be processed in a key value pair mode when the operation to be processed comprises the operation value.
17. The system of claim 16, wherein the processing module is configured to:
and calling the target processing function, and executing instruction processing by using the plurality of to-be-processed operations and the operation values thereof as parameters to obtain an instruction processing result.
18. The system of any one of claims 10 to 17, wherein the different operations have unique codes; for any one operation state, the unique code corresponding to the operation state is determined according to the unique code corresponding to each operation included in the operation combination mode indicated by the operation state.
19. An electronic device, comprising:
a processor;
a memory for storing processor-executable instructions;
wherein the processor is configured to invoke the instructions stored in the memory to perform the method of any of claims 1 to 9.
20. A computer readable storage medium having stored thereon computer program instructions, which when executed by a processor, implement the method of any of claims 1 to 9.
CN202310385778.8A 2023-04-12 2023-04-12 Continuous instruction processing method and system, electronic equipment and storage medium Active CN116088938B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310385778.8A CN116088938B (en) 2023-04-12 2023-04-12 Continuous instruction processing method and system, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310385778.8A CN116088938B (en) 2023-04-12 2023-04-12 Continuous instruction processing method and system, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN116088938A CN116088938A (en) 2023-05-09
CN116088938B true CN116088938B (en) 2023-07-18

Family

ID=86208703

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310385778.8A Active CN116088938B (en) 2023-04-12 2023-04-12 Continuous instruction processing method and system, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN116088938B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112764911A (en) * 2021-01-29 2021-05-07 建信金融科技有限责任公司 Task scheduling method and device, electronic equipment and readable storage medium
CN113722022A (en) * 2021-08-25 2021-11-30 中国建设银行股份有限公司 State management system and method
CN114880241A (en) * 2022-06-07 2022-08-09 北京来也网络科技有限公司 Task robot testing method and device, electronic equipment and storage medium

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7526750B2 (en) * 2003-10-15 2009-04-28 Microsoft Corporation Object-based systematic state space exploration of software
CN106034246A (en) * 2015-03-19 2016-10-19 阿里巴巴集团控股有限公司 Service providing method and device based on user operation behavior
CN106559278B (en) * 2015-09-25 2020-09-15 中兴通讯股份有限公司 Data processing state monitoring method and device
CN112559448B (en) * 2021-02-19 2021-05-18 腾讯科技（深圳）有限公司 Data state migration method and device, computer equipment and storage medium
CN114296855B (en) * 2021-12-29 2024-04-30 北京字节跳动网络技术有限公司 State management method and device of user interface, electronic equipment and storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112764911A (en) * 2021-01-29 2021-05-07 建信金融科技有限责任公司 Task scheduling method and device, electronic equipment and readable storage medium
CN113722022A (en) * 2021-08-25 2021-11-30 中国建设银行股份有限公司 State management system and method
CN114880241A (en) * 2022-06-07 2022-08-09 北京来也网络科技有限公司 Task robot testing method and device, electronic equipment and storage medium

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
Nonblocking supervisory control of state tree structures with event forcing;Deguang Wang等;Journal of the Franklin Institute;第359卷(第16期);全文 *
基于UML状态机的LCA快速查找算法;童小念等;湖南师范大学自然科学学报(第03期);全文 *
基于多状态的系统可靠性预计;曾照洋等;航空标准化与质量(第02期);全文 *
对称离散事件系统状态树结构模型的控制函数不变性研究;焦亭;甘永梅;肖国春;;西安交通大学学报(第11期);全文 *

Also Published As

Publication number Publication date
CN116088938A (en) 2023-05-09

Similar Documents

Publication Publication Date Title
US9990209B2 (en) Digital assistance device for facilitating multi-stage setup
CN109656923B (en) Data processing method and device, electronic equipment and storage medium
CN111552934A (en) Database access method and device
KR20210080150A (en) Translation method, device, electronic equipment and readable storage medium
CN116088938B (en) Continuous instruction processing method and system, electronic equipment and storage medium
US10740218B2 (en) Method and device for determining usage log
CN114880020A (en) Software development kit management method, related device and computer program product
CN115063123A (en) Intelligent manufacturing method and system and electronic equipment
CN112579472B (en) Automatic generation method and device for test cases
CN112000667B (en) Method, apparatus, server and medium for retrieving tree data
CN111813407B (en) Game development method, game running device and electronic equipment
KR101976315B1 (en) Method for constructing polar codes on binary symmetric channel and apparatus therefor
CN111984616A (en) Method, device and system for updating shared file
CN111191779A (en) Data processing method, device, processor and computer readable storage medium
CN116737390B (en) Atomic operation processing method and device, electronic equipment and storage medium
CN110633273A (en) Authority management method and device
CN116204910B (en) Plug-in hash encryption method, nonvolatile readable storage medium and electronic device
CN110727654B (en) Data extraction method and device for distributed system, server and storage medium
CN109426356B (en) Information input method and device
CN109951191B (en) Progressive decoding method and device for non-system Raptor code
CN107562442B (en) Method and device for reading data
US20200327109A1 (en) Method, electronic device and computer program product for creating metadata index
CN116820486A (en) Bug positioning method, device and equipment of application program and storage medium
CN117914695A (en) Network-on-chip configuration method, device and storage medium
CN113472512A (en) Intelligent contract execution method and device, storage medium and electronic equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant