Vehicle configuration word generation method, device and equipment and readable storage medium

Abstract

The invention discloses a vehicle configuration word generation method, device and equipment and a readable storage medium, and the method comprises the steps: carrying out the logic analysis of a received configuration logic expression of a vehicle, and obtaining an abstract syntax tree which comprises a configuration item and a logic operator; performing dynamic bit mapping on the configuration items to obtain bit masks of the configuration items; comparing the configuration list database with the configuration items to obtain Boolean values of the configuration items; traversing the abstract syntax tree, performing Boolean operation according to the logic operator and the Boolean value to obtain a Boolean operation result of each configuration item, and generating a bitmap result according to the Boolean operation result and the bit mask; and converting the bitmap result into a configuration word. According to the method, the natural expression of the configuration logic is realized by expressing the configuration logic expression as the abstract syntax tree form, and the dependency relationship and conflict in the configuration item are identified through Boolean operation, so that the automatic generation of the configuration word under the complex configuration logic can be realized, the configuration flashing efficiency is improved, and the error rate is reduced.

Description

Technical Field

[0001] This application relates to the field of vehicle configuration management technology, specifically to a method, apparatus, device, and readable storage medium for generating vehicle configuration characters. Background Technology

[0002] As automotive electronics become increasingly sophisticated, modern vehicles contain dozens or even hundreds of ECUs (Electronic Control Units), each with a variety of configurable options. Configuration words, serving as a digital list of vehicle functions and a set of software instructions, precisely indicate which control modules, software packages, and optional functions the vehicle is equipped with, thereby activating or disabling the corresponding control logic, communication, and services.

[0003] Common vehicle configuration word generation schemes include those based on enumeration lists, configuration matrices, and simple encoding mapping. Among these, the enumeration list-based scheme configures by predefined fixed enumeration values ​​for configuration items; the configuration matrix-based scheme establishes a two-dimensional configuration matrix, where rows represent configuration items and columns represent vehicle models or configuration packages, and determines the final configuration word through a lookup table; the simple encoding mapping-based scheme assigns fixed bit offsets to configuration items and generates the configuration word through direct bit operations.

[0004] However, existing vehicle configuration word generation schemes cannot intuitively express the logical relationships between configuration items. For complex configuration logic, they rely on manual identification of configuration dependencies and conflicts, resulting in low efficiency and high error rate in the configuration writing process, which needs to be improved. Summary of the Invention

[0005] This application provides a method, apparatus, device, and readable storage medium for generating vehicle configuration words, which can solve the technical problems in the prior art that the logical relationship between configuration items cannot be intuitively expressed, and that complex configuration logic relies on manual identification of configuration dependencies and conflicts, resulting in low efficiency and high error rate in the configuration writing process.

[0006] In a first aspect, embodiments of this application provide a method for generating vehicle configuration characters, including: The received vehicle configuration logic expression is logically parsed to obtain an abstract syntax tree, which includes configuration items and logical operators; Dynamic bit mapping is performed on the configuration items to obtain the bitmask of each configuration item; The configuration list database and configuration items are compared to obtain the Boolean value of each configuration item; Traverse the abstract syntax tree, perform Boolean operations based on logical operators and Boolean values ​​to obtain the Boolean operation results for each configuration item, and generate a bitmap result based on the Boolean operation results and bitmask; Convert the bitmap result into a configuration word.

[0007] In conjunction with the first aspect, in one implementation, the received vehicle configuration logic expression is logically parsed to obtain an abstract syntax tree, including: Lexical analysis of the configuration logic expression yields configuration items and logical operators; Construct an abstract syntax tree based on configuration items, logical operators, and the precedence of logical operators; The leaf nodes of the abstract syntax tree are determined by the configuration options, while the root node and intermediate nodes are determined by the logical operators.

[0008] In conjunction with the first aspect, in one implementation, dynamic bit mapping is performed on the configuration items to obtain the bitmask of each configuration item, including: The bitmasks of each configuration item are obtained by performing dynamic bit mapping on the configuration items in the order of their positions in the abstract syntax tree.

[0009] In conjunction with the first aspect, in one implementation, the configuration manifest database and configuration items are compared to obtain the Boolean value of each configuration item, including: Retrieve each configuration item sequentially from the configuration manifest database; If the configuration item exists in the configuration manifest database, the boolean value of the configuration item is true; otherwise, the boolean value of the configuration item is false.

[0010] In conjunction with the first aspect, in one implementation, generating a bitmap result based on the Boolean operation result and the bitmask includes: The bit values ​​of each configuration item are determined based on the Boolean operation results; The bit positions of each configuration item are determined based on the bitmask; The bitmap result is determined based on the bit value and bit position.

[0011] In conjunction with the first aspect, in one implementation, converting the bitmap result into a configuration word includes: The configuration word is obtained by performing base conversion and padding missing bits on the bitmap result.

[0012] In conjunction with the first aspect, in one implementation method, the vehicle configuration word generation method further includes: Conflict detection is performed on the bitmap results based on preset conflict rules; If there are logical conflicts in the configuration items of the bitmap result, a corresponding conflict message will be generated.

[0013] Secondly, embodiments of this application provide a vehicle configuration word generation apparatus, comprising: The expression parsing module is used to perform logical parsing on the received vehicle configuration logic expression to obtain an abstract syntax tree, which includes configuration items and logical operators; The bit mapping module is used to dynamically map configuration items to obtain the bitmask of each configuration item; The Boolean value determination module is used to compare the configuration list database and the configuration items to obtain the Boolean value of each configuration item; The bitmap result generation module is used to traverse the abstract syntax tree, perform Boolean operations based on logical operators and Boolean values ​​to obtain the Boolean operation results of each configuration item, and generate bitmap results based on the Boolean operation results and bitmasks; The configuration word generation module is used to convert bitmap results into configuration words.

[0014] Thirdly, embodiments of this application provide a vehicle configuration word generation device, which includes a processor, a memory, and a vehicle configuration word generation program stored in the memory and executable by the processor. When the vehicle configuration word generation program is executed by the processor, it implements the steps of the vehicle configuration word generation method as described above.

[0015] Fourthly, embodiments of this application provide a computer-readable storage medium, characterized in that the computer-readable storage medium stores a vehicle configuration word generation program, wherein when the vehicle configuration word generation program is executed by a processor, it implements the steps of the vehicle configuration word generation method as described above.

[0016] The beneficial effects of the technical solutions provided in this application include: This application achieves a natural expression of configuration logic by representing configuration logic expressions as abstract syntax trees. It uses Boolean operations to identify dependencies and conflicts in configuration items, enabling the automatic generation of configuration words under complex configuration logic, improving configuration writing efficiency and reducing error rate. Attached Figure Description

[0017] Figure 1 This is a flowchart illustrating an embodiment of the vehicle configuration character generation method of this application; Figure 2 This is a schematic diagram illustrating the process of constructing an abstract syntax tree according to an embodiment of this application; Figure 3 This is an example diagram of an abstract syntax tree from an embodiment of this application; Figure 4 This is a schematic diagram of the process for generating a bitmap result according to an embodiment of this application; Figure 5 This is a schematic diagram of the functional modules of an embodiment of the vehicle configuration character generation device of this application; Figure 6 This is a schematic diagram of the hardware structure of the vehicle configuration word generation device involved in the embodiments of this application. Detailed Implementation

[0018] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present application.

[0019] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in further detail below with reference to the accompanying drawings.

[0020] In a first aspect, embodiments of this application provide a method for generating vehicle configuration characters.

[0021] In one embodiment, reference is made to Figure 1 , Figure 1 This is a flowchart illustrating an embodiment of the vehicle configuration character generation method of this application. Figure 1 As shown, the method for generating vehicle configuration characters includes: S101. Logically parse the received vehicle configuration logic expression to obtain an abstract syntax tree, which includes configuration items and logical operators. S102. Perform dynamic bit mapping on the configuration items to obtain the bitmask of each configuration item; S103. Compare the configuration list database and the configuration items to obtain the Boolean value of each configuration item; S104. Traverse the abstract syntax tree, perform Boolean operations based on logical operators and Boolean values ​​to obtain the Boolean operation results for each configuration item, and generate a bitmap result based on the Boolean operation results and bitmask. S105. Convert the bitmap result into a configuration word.

[0022] Specifically, for the input configuration logic expression containing configuration item identifiers and logical operators, the embodiment needs to perform logical parsing to represent it in the form of an abstract syntax tree. During the logical parsing process, the embodiment first performs lexical analysis on the configuration logic expression to identify the configuration items and logical operators. Then, based on the precedence of the logical operators, it converts the configuration items and logical operators into the form of an abstract syntax tree.

[0023] In this context, configuration items are represented as leaf nodes of the abstract syntax tree (ABSL), while logical operators are represented as root and intermediate nodes. Based on the connection relationships, each intermediate or root node indicates that its corresponding branch node requires logical operations according to the logical operator corresponding to that intermediate or root node.

[0024] Then, for each configuration item in the abstract syntax tree, the bitmask corresponding to each configuration item needs to be dynamically determined through bit mapping. This bitmask is used to determine the bit order of each configuration item when generating the bitmap result in the future.

[0025] The Boolean value for each configuration item is determined by comparing each item sequentially with the configuration manifest database. If the configuration item exists in the database, the Boolean value is set to true; otherwise, it is set to false.

[0026] Finally, by traversing the abstract syntax tree and performing Boolean operations based on the logical operators in the abstract syntax tree and the Boolean value of each configuration item, the Boolean operation results of each configuration item are obtained. This is used to identify the dependencies and conflicts of configuration items in the configuration logic expression. Finally, based on the Boolean operation results of each configuration item and the bitmask, the corresponding bitmap result is generated, and after converting the bitmap result, the final configuration word is obtained.

[0027] In this embodiment, the configuration logic is expressed as an abstract syntax tree to achieve a natural expression of the configuration logic. Boolean operations are used to identify dependencies and conflicts in the configuration items, which can realize the automatic generation of configuration words under complex configuration logic, improve the efficiency of configuration writing and reduce the error rate.

[0028] Furthermore, in one embodiment, Figure 2 This is a schematic diagram illustrating the process of constructing an abstract syntax tree according to an embodiment of this application, such as... Figure 2 As shown, the received vehicle configuration logic expression is logically parsed to obtain an abstract syntax tree, including: S201. Perform lexical analysis on the configuration logic expression to obtain configuration items and logical operators; S202. Construct an abstract syntax tree based on configuration items, logical operators, and the precedence of logical operators; The leaf nodes of the abstract syntax tree are determined by the configuration options, while the root node and intermediate nodes are determined by the logical operators.

[0029] Specifically, the input configuration logic expression consists of configuration item identifiers and logical operators. The original configuration logic expression cannot be processed by the configuration word generation program and needs to be transformed into the form of an abstract syntax tree.

[0030] For the input configuration logic expression, the implementation first performs lexical analysis to identify the configuration item identifiers and logical operators. Then, each configuration item is represented as a leaf node of the abstract syntax tree, and each logical operator is represented as an intermediate node or root node of the abstract syntax tree.

[0031] Logical operators include the AND, OR, and NOT operators that represent operational relationships, as well as nested parentheses: parentheses, square brackets, and curly braces, which change the order of operations. The precedence of logical operators, from highest to lowest, is: parentheses, square brackets, curly braces, NOT, AND, and OR. The connections between nodes in the abstract syntax tree are determined by the precedence of these logical operators. Higher precedence operations are located closer to the bottom of the abstract syntax tree, ensuring that subsequent Boolean operations prioritize higher-precedence logical operators.

[0032] Figure 3 This is an example diagram of an abstract syntax tree for an embodiment of this application. Taking the input expression FCD1 AND XAB2 AND (T01F OR Y11E) as an example, it can generate the following: Figure 3 The abstract syntax tree shown. Combined with... Figure 3 As can be seen, the leaf nodes of the abstract syntax tree are all configuration item identifiers, while the intermediate nodes and the root node are all logical relational operators.

[0033] It should be noted that in the constructed abstract syntax tree, according to the properties of logical operators, AND and OR each correspond to two branch nodes, while NOT corresponds to only one branch node, and nested parentheses cannot exist alone in the abstract syntax tree.

[0034] In this embodiment, by logically parsing the configuration logical expression containing logical operators into an abstract syntax tree, the initial parsing of the configuration logical expression can be achieved, and the configuration logical expression can be transformed into a format that can perform logical operations.

[0035] Furthermore, in one embodiment, dynamic bit mapping is performed on the configuration items to obtain the bitmask of each configuration item, including: The bitmasks of each configuration item are obtained by performing dynamic bit mapping on the configuration items in the order of their positions in the abstract syntax tree.

[0036] Specifically, in order to determine the bit position of each configuration item in the bitmap result after completing the Boolean operation to generate the bitmap result, it is also necessary to dynamically set a bitmask for each configuration item.

[0037] During the dynamic bit mapping process, the embodiment traverses the leaf nodes in the abstract syntax tree and maps the configuration items to bitmasks sequentially according to the position order of each configuration item in the abstract syntax tree.

[0038] Taking the input expression FCD1 AND XAB2 AND (T01F OR Y11E) as an example, after mapping sequentially, the bitmask representation of each configuration item is as follows: FCD1 corresponds to bit 0, mask 0x0001; XAB2 corresponds to bit 1, and the mask is 0x0002; T01F corresponds to bit 2, mask 0x0004; Y11E corresponds to bit 3, with a mask of 0x0008.

[0039] The bitmask can also be understood as 2 raised to the power of the current bit. For example, bit 3 corresponds to 2 raised to the power of 3, and the mask is represented as 0x0008, which simplifies subsequent calculations.

[0040] In this embodiment, compared with the existing static bitmask, the dynamic bit mapping method provides a more flexible mask. When a new configuration item is added, only the mapping table needs to be updated, without modifying the core code, which can be adapted to flexible applications in various scenarios.

[0041] Furthermore, in one embodiment, the configuration list database and configuration items are compared to obtain the Boolean value of each configuration item, including: Retrieve each configuration item sequentially from the configuration manifest database; If the configuration item exists in the configuration manifest database, the boolean value of the configuration item is true; otherwise, the boolean value of the configuration item is false.

[0042] Specifically, for each configuration item, the embodiment determines the Boolean value by sequentially searching the configuration manifest database. If the configuration item exists in the configuration manifest database, its Boolean value is true, represented as 1. If the configuration item does not exist in the configuration manifest database, its Boolean value is false, represented as 0.

[0043] Then, based on the Boolean values ​​of each configuration item, the example traverses the abstract syntax tree and performs Boolean operations based on logical operators and Boolean values ​​to obtain the Boolean operation results for each configuration item.

[0044] Boolean operations, as a computational method with short-circuit evaluation optimization capabilities, can quickly identify the dependencies and conflicts among configuration items in configuration logic expressions, thus significantly improving the computational performance of complex expressions.

[0045] In Boolean operations, TRUE represents a true Boolean value, and FALSE represents a false Boolean value. OR means that if either expression on the left or right is TRUE, the result is TRUE; otherwise, FALSE is returned. AND means that if both expressions on the left and right are TRUE, the result is TRUE; otherwise, FALSE is returned. NOT means negating the expression on the right.

[0046] For example, given the expression F08M AND NOT (F07M OR F08P) AND (F082 OR F083) AND F08T, the vehicle configuration list is F08M, F08P, F08C, F082, F08A, F08T. Then, the process of performing Boolean operations on the abstract syntax tree constructed from this expression can be represented as: The first step is to compare the Boolean values ​​of each configuration item with the vehicle configuration list. Then, calculate the expression within the parentheses, resulting in: F08M AND NOTTRUE AND TRUE AND F08T. In other words, in Boolean operations, if either expression on the left or right side of the OR operation is true, the result is true.

[0047] The second step is to calculate the NOT expression, perform the inversion operation, and obtain the result: F08M AND FALSE AND TRUE AND F08T.

[0048] The third step is to calculate the AND expression. The result is FALSE, meaning that the rest are all AND expressions. There is a FALSE when calculating the first AND expression, so the final result is FALSE.

[0049] Therefore, the final result, verified by Boolean operations, identified a conflict in the configuration logic expression.

[0050] It should be noted that, for ease of representation and understanding, the above steps are still described in the form of expressions, but in actual operation, the abstract syntax tree structure is traversed.

[0051] In this embodiment, Boolean operations can be used to automatically identify dependencies and conflicts in configuration items during the configuration word generation process, enabling rapid and accurate parsing of complex configuration expressions.

[0052] Furthermore, in one embodiment, Figure 4 This is a schematic diagram of the process for generating a bitmap result according to an embodiment of this application, such as... Figure 4 As shown, the bitmap result is generated based on the Boolean operation result and the bitmask, including: S401. Determine the bit value of each configuration item based on the Boolean operation result; S402. Determine the bits of each configuration item based on the bitmask; S403. Determine the bitmap result based on the bit value and bit position.

[0053] Furthermore, in one embodiment, converting the bitmap result into a configuration word includes: The configuration word is obtained by performing base conversion and padding missing bits on the bitmap result.

[0054] Specifically, in this embodiment, the bitmap result is actually an abstract syntax tree generated from the configuration logic expression, subjected to Boolean operations, and then converted into sorted binary code. The bits corresponding to each configuration item in the binary code are determined based on their respective bitmasks. The bit values ​​of each configuration item in the binary code are determined by the Boolean operation result: a result of "TURE" corresponds to a bit value of 1, while a result of "FALSE" corresponds to a bit value of 0.

[0055] For example, the input configuration logical expression is FCD1 AND XAB2 AND (T01F OR Y11E). FCD1, XAB2, and Y11E are retrieved from the vehicle configuration list.

[0056] The Boolean values ​​for the configuration items, from left to right, are Bit 0 = TRUE, Bit 1 = TRUE, Bit 2 = FALSE, and Bit 3 = TRUE. In Boolean operations, since the expression between T01F and Y11E within the parentheses is OR, if one of them is TRUE, then all are TRUE. Therefore, the final Boolean operation result is Bit 0 = TRUE, Bit 1 = TRUE, Bit 2 = TRUE, and Bit 3 = TRUE. Correspondingly, the generated bitmap result is 1111.

[0057] For example, if the input configuration logic expression is FCD1 AND XAB2 AND NOT(T01F AND Y11E), through Boolean operations, the expression between T01F and Y11E within the parentheses is an AND expression. Therefore, if any one bit is FALSE, the entire expression is FALSE. Correspondingly, NOT(T01F AND Y11E) is TRUE as a whole. The Boolean operation verification passes, and the generated bitmap result is 1100.

[0058] Then, based on the generated bitmap result, it can be converted into a configuration word through base conversion, and the empty bits are filled with 0 to obtain a hexadecimal vehicle configuration word.

[0059] Taking bitmap result 1111 as an example, the generated configuration word result is 000F.

[0060] In this embodiment, by converting the result of Boolean operation into a bitmap result and then generating the configuration word through a number system conversion, complex configuration expressions can be processed automatically and quickly, making it suitable for batch writing on production lines.

[0061] Furthermore, in one embodiment, the vehicle configuration word generation method further includes: Conflict detection is performed on the bitmap results based on preset conflict rules; If there are logical conflicts in the configuration items of the bitmap result, a corresponding conflict message will be generated.

[0062] Specifically, to avoid configuration item conflicts, the embodiment also sets up a conflict detection mechanism, which performs conflict detection on the bitmap results through the set conflict rules.

[0063] For example, it can detect Boolean logic contradictions between configuration items, such as FCD1 AND NOT FCD1, meaning the same configuration item is both active and disabled. Alternatively, it can detect that only one of two configuration items can exist simultaneously. The default conflict rules are set according to the specific vehicle model.

[0064] When configuration item conflicts exist, the conflict detection mechanism automatically generates conflict alerts to facilitate the location and handling of the conflicts.

[0065] In this embodiment, a conflict detection mechanism is set up to further ensure the security of configuration word writing and realize early warning of conflicts.

[0066] In summary, the vehicle configuration word generation method provided in this application achieves a natural expression of configuration logic by representing configuration logic expressions as abstract syntax trees. It uses Boolean operations to identify dependencies and conflicts in configuration items, enabling automated generation of configuration words under complex configuration logic, improving configuration writing efficiency and reducing error rates. In application scenarios such as configuration management of vehicle electronic control units, final configuration on vehicle production lines, and vehicle function customization for after-sales service, compared to existing solutions, this vehicle configuration word generation method can parse and generate complex configuration expressions within 100ms, demonstrating stronger real-time response capabilities; it supports simultaneous processing of multiple configuration expressions, making it suitable for batch writing on production lines; and adding new configuration items only requires updating the mapping table without modifying the core algorithm, providing stronger scalability.

[0067] Secondly, embodiments of this application also provide a vehicle configuration word generation device.

[0068] In one embodiment, reference is made to Figure 5 , Figure 5 This is a functional module diagram of an embodiment of the vehicle configuration character generation device of this application. Figure 5 As shown, the vehicle configuration word generation device includes: The expression parsing module 501 is used to perform logical parsing on the received vehicle configuration logic expression to obtain an abstract syntax tree, which includes configuration items and logical operators; The bit mapping module 502 is used to dynamically bit map the configuration items to obtain the bit mask of each configuration item; Boolean value determination module 503 is used to compare the configuration list database and the configuration items to obtain the Boolean value of each configuration item; Bitmap result generation module 504 is used to traverse the abstract syntax tree, perform Boolean operations based on logical operators and Boolean values ​​to obtain the Boolean operation results of each configuration item, and generate bitmap results based on the Boolean operation results and bitmasks; Configuration word generation module 505 is used to convert bitmap results into configuration words.

[0069] The functions of each module in the above-mentioned vehicle configuration character generation device correspond to the steps in the above-mentioned vehicle configuration character generation method embodiment, and their functions and implementation processes will not be described in detail here.

[0070] Thirdly, embodiments of this application provide a vehicle configuration word generation device, which can be a personal computer (PC), laptop computer, server, or other device with data processing capabilities.

[0071] Reference Figure 6 , Figure 6 This is a schematic diagram of the hardware structure of the vehicle configuration word generation device involved in the embodiments of this application. In the embodiments of this application, the vehicle configuration word generation device may include a processor, a memory, a communication interface, and a communication bus.

[0072] The communication bus can be of any type and is used to interconnect the processor, memory, and communication interface.

[0073] The communication interface includes input / output (I / O) interfaces, physical interfaces, and logical interfaces used for interconnecting devices within the vehicle configuration word generation device, as well as interfaces used for interconnecting the vehicle configuration word generation device with other devices (such as other computing devices or user equipment). Physical interfaces can be Ethernet interfaces, fiber optic interfaces, ATM interfaces, etc.; user equipment can be displays, keyboards, etc.

[0074] Memory can be various types of storage media, such as random access memory (RAM), read-only memory (ROM), non-volatile RAM (NVRAM), flash memory, optical storage, hard disk, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), etc.

[0075] The processor can be a general-purpose processor, which can call the vehicle configuration word generation program stored in the memory and execute the vehicle configuration word generation method provided in the embodiments of this application. For example, the general-purpose processor can be a central processing unit (CPU). The method executed when the vehicle configuration word generation program is called can be referred to in various embodiments of the vehicle configuration word generation method of this application, and will not be repeated here.

[0076] Those skilled in the art will understand that Figure 6 The hardware structure shown does not constitute a limitation of this application and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0077] Fourthly, embodiments of this application also provide a computer-readable storage medium.

[0078] The present application provides a computer-readable storage medium storing a vehicle configuration word generation program, wherein when the vehicle configuration word generation program is executed by a processor, it implements the steps of the vehicle configuration word generation method described above.

[0079] The method implemented when the vehicle configuration word generation program is executed can be referred to in various embodiments of the vehicle configuration word generation method of this application, and will not be repeated here.

[0080] It should be noted that the sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.

[0081] The terms "comprising" and "having," and any variations thereof, in the specification, claims, and accompanying drawings of this application are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus. The terms "first," "second," and "third," etc., are used to distinguish different objects, etc., and do not indicate a sequence, nor do they limit "first," "second," and "third" to different types.

[0082] In the description of the embodiments of this application, terms such as "exemplary," "for example," or "for instance" are used to indicate examples, illustrations, or explanations. Any embodiment or design described as "exemplary," "for example," or "for instance" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary," "for example," or "for instance" is intended to present the relevant concepts in a concrete manner.

[0083] In the description of the embodiments of this application, unless otherwise stated, " / " means "or". For example, A / B can mean A or B. The "and / or" in the text is merely a description of the relationship between related objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, and B exists alone. In addition, in the description of the embodiments of this application, "multiple" means two or more.

[0084] In some processes described in the embodiments of this application, multiple operations or steps are included in a specific order. However, it should be understood that these operations or steps may not be executed in the order they appear in the embodiments of this application, or they may be executed in parallel. The sequence number of the operation is only used to distinguish different operations, and the sequence number itself does not represent any execution order. In addition, these processes may include more or fewer operations, and these operations or steps may be executed sequentially or in parallel, and these operations or steps may be combined.

[0085] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes several instructions to cause a terminal device to execute the methods of the various embodiments of this application.

[0086] The above are merely preferred embodiments of this application and do not limit the patent scope of this application. Any equivalent structural or procedural transformations made using the content of this application's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of this application.

Claims

1. A method for generating vehicle configuration characters, characterized in that, include: The received vehicle configuration logic expression is logically parsed to obtain an abstract syntax tree, which includes configuration items and logical operators; The bitmask of each configuration item is obtained by performing dynamic bit mapping on the configuration items; The configuration list database and the configuration items are compared to obtain the Boolean value of each configuration item; Traverse the abstract syntax tree, perform Boolean operations on the logical operators and Boolean values ​​to obtain the Boolean operation results for each configuration item, and generate a bitmap result based on the Boolean operation results and the bitmask; The bitmap result is converted into a configuration word.

2. The vehicle configuration character generation method according to claim 1, characterized in that, The step of logically parsing the received vehicle configuration logic expression to obtain an abstract syntax tree includes: Lexical analysis of the configuration logic expression yields configuration items and logical operators; An abstract syntax tree is constructed based on the configuration items, the logical operators, and the operation precedence of the logical operators; The leaf nodes of the abstract syntax tree are determined according to the configuration items, and the root node and intermediate nodes of the abstract syntax tree are determined according to the logical operators.

3. The vehicle configuration character generation method according to claim 1, characterized in that, The step of dynamically bit-mapping the configuration items to obtain the bitmasks of each configuration item includes: The bitmasks of each configuration item are obtained by performing dynamic bit mapping on the configuration items in the order of their positions in the abstract syntax tree.

4. The vehicle configuration character generation method according to claim 1, characterized in that, The step of comparing the configuration list database and the configuration items to obtain the Boolean value of each configuration item includes: Retrieve each of the aforementioned configuration items sequentially from the configuration list database; If the configuration item exists in the configuration list database, the boolean value of the configuration item is true; otherwise, the boolean value of the configuration item is false.

5. The vehicle configuration character generation method according to claim 1, characterized in that, The step of generating a bitmap result based on the Boolean operation result and the bitmask includes: The bit value of each configuration item is determined based on the Boolean operation result; The bits of each configuration item are determined based on the bitmask; The bitmap result is determined based on the bit value and the bit position.

6. The vehicle configuration character generation method according to claim 1, characterized in that, The step of converting the bitmap result into a configuration word includes: The bitmap result is converted to a different number system and missing bits are padded with zeros to obtain the configuration word.

7. The vehicle configuration character generation method according to claim 1, characterized in that, The method further includes: The bitmap results are subjected to conflict detection based on preset conflict rules; If there is a logical conflict in the configuration items of the bitmap result, a corresponding conflict prompt message will be generated.

8. A vehicle configuration character generation device, characterized in that, include: The expression parsing module is used to perform logical parsing on the received vehicle configuration logic expression to obtain an abstract syntax tree, which includes configuration items and logical operators; The bit mapping module is used to dynamically bit map the configuration items to obtain the bitmasks of each configuration item; A Boolean value determination module is used to compare the configuration list database and the configuration items to obtain the Boolean value of each configuration item; The bitmap result generation module is used to traverse the abstract syntax tree, perform Boolean operations based on the logical operators and the Boolean values ​​to obtain the Boolean operation results of each configuration item, and generate a bitmap result based on the Boolean operation results and the bitmask. The configuration word generation module is used to convert the bitmap result into a configuration word.

9. A vehicle configuration character generation device, characterized in that, The vehicle configuration word generation device includes a processor, a memory, and a vehicle configuration word generation program stored in the memory and executable by the processor, wherein when the vehicle configuration word generation program is executed by the processor, it implements the steps of the vehicle configuration word generation method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a vehicle configuration word generation program, wherein when the vehicle configuration word generation program is executed by a processor, it implements the steps of the vehicle configuration word generation method as described in any one of claims 1 to 7.

Images