Combined Grammar Compilation for Binary Data Stream Conversion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for converting and transmitting binary EXI data streams are time-consuming and memory-intensive, especially when multiple schemata are involved, requiring the generation of numerous grammar variants to handle various combinations, leading to high memory requirements and inefficient processing.
Innovation Solution
A method that initializes a combined grammar by reading pre-generated atomic grammars from memory and compiling them in a runtime environment, allowing for efficient conversion of binary data streams without the need to store multiple grammar variants, enabling faster generation and reduced memory usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple grammar variants are generated in advance to handle different schema combinations, then the system can handle various schema combinations, but the memory space requirement increases significantly
Solution Approach 1:
The patent segments the grammar handling process by separating the core grammar structure from schema-specific variations. Instead of storing complete grammar variants for each schema combination, the system stores a single base grammar and generates schema-specific variations dynamically through substitution and combination operations, reducing memory requirements while maintaining adaptability.
Solution Approach 2:
The patent implements dynamic grammar generation by allowing the grammar to be constructed and modified at runtime based on the actual schema combinations needed. Rather than pre-generating all possible grammar variants, the system dynamically assembles grammars from modular components, enabling flexible adaptation to different schema combinations without storing all variants in advance.
2Productivity
If grammars are generated in advance for all schema combinations, then the conversion process is faster, but the number of grammar variants to store becomes extremely large
Solution Approach 1:
The patent applies preliminary action by pre-compiling schema definitions and grammar templates into reusable components that can be quickly assembled during runtime. The core grammar structure and schema metadata are prepared in advance, but complete grammar variants are generated on-demand by combining these pre-prepared components, achieving fast conversion without storing all possible variants.
Solution Approach 2:
The patent creates a universal grammar framework that can handle multiple schema combinations through a single unified structure. The grammar system is designed to be multi-functional, accommodating different schema types and combinations through parameterized rules and modular components, eliminating the need for separate grammar variants for each combination.
3Quantity of substance
If a combination of multiple schemata is used to code a grammar, then the data representation becomes more compact and efficient, but the process of coding and managing the grammar becomes time-consuming and work-intensive
Solution Approach 1:
The patent uses copying by allowing schema definitions and grammar rules to be referenced and reused across multiple contexts without duplication. Instead of manually coding grammars for each schema combination, the system copies and combines pre-defined schema templates and grammar rules, automatically generating the necessary grammar structures through systematic composition of reusable components.
Solution Approach 2:
The patent implements self-service by enabling the grammar generation process to automatically assemble grammars from schema definitions without requiring manual intervention. The system self-generates grammar variants by programmatically combining schema information with grammar templates, eliminating the time-consuming manual coding process while maintaining data compactness.
Data Source
AI summary
A method is provided for converting a binary data stream, (e.g., an EXI data stream). In an initialization phase of the method, a plurality of grammars, previously produced from at least one description language scheme, are read from a memory area and combined to form a combined grammar and wherein the combined grammar is supplied to a runtime environment for the purpose of converting the binary data stream. The method firstly permits substantially accelerated production of the desired grammar in comparison with a grammar produced as required from individual schemes, and secondly the memory space requirement may be kept down, because there is no need to keep a combinational variety of grammars available.