XML Parser Validation Engine Inversion for Memory Reduction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current XML parsing technologies do not integrate validation as an integral part of parsing, leading to inefficiencies due to large tables and obscured control flow, which slows down processing and increases memory footprint.

Innovation Solution

A method that allows the validation engine to be written in a recursive-descent code-driven manner, where the validation engine drives the tokenizer, enabling integrated validation and parsing without the need for large tables, resulting in a faster and more efficient parsing process.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If validation engine is driven by tokenizer with large tables, then validation can be performed, but memory footprint increases and processing efficiency decreases

Engineering Contradiction:
Improvevalidation capabilityVSAvoidprocessing efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent inverts the traditional driver relationship by making the validation engine drive the tokenizer instead of the tokenizer driving the validation engine. This reversal eliminates the need for large lookup tables and enables recursive-descent code-driven validation, significantly reducing memory footprint and improving processing efficiency while maintaining validation reliability

Inventive Principle:
Principle #13The other way round (Inversion)

2Reliability

If validation engine is driven by tokenizer with large tables, then validation can be performed, but memory footprint increases

Engineering Contradiction:
Improvevalidation capabilityVSAvoidmemory footprint
Core Design Contradiction:
ReliabilityVSWeight of stationary object

Solution Approach 1:

The patent inverts the traditional driver relationship by making the validation engine drive the tokenizer instead of the tokenizer driving the validation engine. This reversal eliminates the need for large lookup tables and enables recursive-descent code-driven validation, significantly reducing memory footprint while maintaining validation reliability

Inventive Principle:
Principle #13The other way round (Inversion)

3Reliability

If validation engine is driven by tokenizer, then validation can be performed, but control flow becomes obscured

Engineering Contradiction:
Improvevalidation capabilityVSAvoidcontrol flow clarity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent inverts the traditional driver relationship by making the validation engine drive the tokenizer instead of the tokenizer driving the validation engine. This reversal clarifies control flow by establishing a straightforward sequential validation process where the validation engine explicitly controls tokenization, making the parsing and validation interaction more transparent and easier to understand

Inventive Principle:
Principle #13The other way round (Inversion)

Data Source

PatentUS8935605B2Validator-driven architecture of an XML parsing and validating solution
Publication Date: 2015.01.13 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US8935605B2 patent drawing
  • US8935605B2 patent drawing
  • US8935605B2 patent drawing

AI summary

A method for parsing a document in an Extensible Markup Language (XML) format includes identifying data via the XML format, defining a tag set including a plurality of tags, defining a tokenizer that produces one token at a time, parsing the XML document via a parser, validating the XML document via a validation engine, the validation engine driving the tokenizer, the validating being an integral part of the parsing, and permitting the validation engine to be written in a recursive-descent code-driven manner.