Compressed Interpreter Source Execution Without Repeated Lexical Analysis

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The repeated decompression and lexical analysis of interpreter-type source codes stored in a compressed state lead to time-consuming processing and resource wastage during program execution.

Innovation Solution

An information processing apparatus conducts lexical analysis on the source code, compresses it using a compression dictionary that associates internal codes with compression codes, and converts the compressed source code into internal code for efficient execution without decompression, utilizing a nodeless tree structure for entropy coding and syntax analysis.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If the source code is stored in a compressed state to save storage space, then the storage efficiency is improved, but the execution speed deteriorates due to repeated decompression and lexical analysis

Engineering Contradiction:
Improvestorage spaceVSAvoidexecution speed
Core Design Contradiction:
Quantity of substanceVSSpeed

Solution Approach 1:

The patent performs lexical analysis and internal code assignment in advance during the compression phase, storing the results in a compression dictionary. When executing compressed source code, the system directly converts compression codes to internal codes using the pre-built dictionary, eliminating the need for repeated decompression and lexical analysis, thus resolving the contradiction between storage efficiency and execution speed

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a compression dictionary that stores the mapping relationship between compression codes and internal codes. This dictionary acts as a pre-computed copy of the lexical analysis results, allowing direct code conversion during execution without reprocessing the original source code, thereby maintaining both storage efficiency and execution speed

Inventive Principle:
Principle #26Copying

2Productivity

If the source code is decompressed and lexical analysis is conducted repeatedly during execution, then the execution can proceed, but time and computational resources are wasted

Engineering Contradiction:
Improveprocessing efficiencyVSAvoidexecution time
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent performs lexical analysis and internal code assignment in advance during the compression phase, storing the results in a compression dictionary. When executing compressed source code, the system directly converts compression codes to internal codes using the pre-built dictionary, eliminating the need for repeated decompression and lexical analysis, thus resolving the contradiction between storage efficiency and execution speed

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent discards the traditional approach of decompressing and re-analyzing source code during execution. Instead, it recovers and utilizes the pre-computed lexical analysis results stored in the compression dictionary, directly converting compression codes to internal codes, thereby eliminating time and resource waste

Inventive Principle:
Principle #34Discarding and recovering

Data Source

PatentUS10684831B2Information processing apparatus, information processing method, and recording medium
Publication Date: 2020.06.16 FUJITSU LTD
  • US10684831B2 patent drawing
  • US10684831B2 patent drawing
  • US10684831B2 patent drawing

AI summary

An information processing apparatus includes: a processor configured to: conduct lexical analysis on an interpreter-type source code; compress a source code, on which the lexical analysis has been conducted, by using a compression dictionary that associates an internal code and a compression code; when an execution command of an interpreter is received for the source code compressed, convert the source code compressed into an internal code in accordance with the compression dictionary; and sequentially execute processing in accordance with the internal code converted.