# US 2004/0083221 A1 · Hardware accelerated validating parser

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0083221 A1
- Document ID: US20040083221A1
- Status: Published application
- Kind: A1
- Application number: 10/334,086
- Filed: 2002-12-31
- Published: 2004-04-29
- Earliest claimed: 2002-10-29
- Assignees: Lockheed Martin Corporation
- Inventors: Michael C. Dapp; Eric C. Lett; Sai Lun Ng
- Web page: https://patentgrep.com/patent/US20040083221A1

## CPC

- G06F 8/427: {Parsing}
- Y10S 707/99943: Generating database or data structure, e.g. via user interface
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

A hardware accelerated validation parser is provided to remove a large portion if not all of the processing and overhead burden of validation parsing from a host processor by parallel access to both a state table and a data dictionary based on a token and merging and selective redirection of the respective outputs thereof; a portion of a transition control word (TCW) formed by the merged data being used to advance through the state table and a portion of the TCW being used to control formation of a tree structured data object (TSDO) corresponding to a text document in a language such as XML™ which supports interoperability and platform independence. A stack is provided to accommodate nesting of elements and aggregate elements. The formation of the TSDO can be and preferably is performed asynchronously and autonomously in parallel with the validation parsing.

## Claims

### Claim 1

A hardware accelerated validation parser for a tokenized text document in a computer language supporting platform independence and interoperability, said validation parser comprising,
means for retrieving data from both a data dictionary and a state table in accordance with a token,
means for merging said data from said state table and said data dictionary to form a transition control word,
means for merging part of said transition control word with another token to retrieve further data from said state table, and
means for forming a tree structured data object corresponding to said tokenized text document under control of part of said transition control word.

### Claim 2 (depends on 1)

The hardware accelerated validation parser as recited in claim 1, further including
means for controlling operation of a stack with said transition control word to derive the next transition state in supporting nested data structures defined in a supported language.

### Claim 3 (depends on 2)

The hardware accelerated validation parser as recited in claim 2, further including
means for forming a data construct from the tokenized text document.

### Claim 4 (depends on 3)

The hardware accelerated validation parser as recited in claim 3, wherein said means for forming a data construct includes an element and attribute buffer.

### Claim 5 (depends on 1)

The hardware accelerated validation parser as recited in claim 1, further including
means for forming a data construct from the tokenized text document.

### Claim 6 (depends on 5)

The hardware accelerated validation parser as recited in claim 5, wherein said means for forming a data construct includes an element and attribute buffer.

### Claim 7

A method of accelerating validation parsing of a tokenized file, said method comprising steps of
retrieving data from both a data dictionary and a state table in accordance with a token,
merging said data from said state table and said data dictionary to form a transition control word, and
merging part of said transition control word with another token to retrieve further data from said state table.

### Claim 8 (depends on 7)

The method as recited in claim 7, including a further step of
operating a stack with said transition control word to derive the next transition state.

### Claim 9 (depends on 7)

The method as recited in claim 7, including a further step of
verifying that an input stream conforms to one of a set of valid input sequences.

### Claim 10 (depends on 9)

The method as recited in claim 9, including a further step of
producing a notification when an input stream deviates from a set of valid, allowable input sequences.

### Claim 11 (depends on 7)

The method as recited in claim 7, including a further step of
producing a notification when an input stream deviates from a set of valid, allowable input sequences.
