US5375204A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System and method for efficient binary encoding of procedures in a document processing language
Assignee: Ricoh Co Ltd
•
Filing: 1993-01-08
•
Granted: 1994-12-20
•
Expires: 2013-01-08
Abstract
Abstract A system and method for converting a textual representation of nested procedures into a binary format where the binary format contains the length of each procedure at the beginning of the procedure. The system can be implemented using a single temporary storage buffer which is globally available to each procedure and procedures nested within. The first clear text procedure of a group of nested procedures causes the temporary storage buffer to be created. Memory locations are reserved in the temporary storage buffer for storing the length of the procedure, and then the procedure is converted to binary format which is then appended to the end of the buffer after the space reserved for the length of the procedure. Procedures which are nested within the first procedure also have space reserved in the buffer for length information and the binary representations of the nested procedures are appended onto the end of the buffer. When a procedure ends, the length of the procedure is calculated and written into the space previously reserved for length information. The single memory buffer can be considered a logically contiguous memory buffer. Other logically contiguous memory buffers include multiple memory buffers which can be kept track of using an array index of a double linked list data structure.
Inventors
- 👤 Tetsuro Motoyama
- 👤 Donny Tsay
- 👤 Satwinder Mangat
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 20:32
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/12; G06F3/1297; G06F40/00; G06F40/10; G06F40/103; G06F40/12; G06F40/151; G06F40/154; G06F8/00; G06F8/40; G06F8/41; G06F8/42; G06F8/427; G06F8/44; G06K; G06K15/00; G06K15/02; G06K15/18; G06K15/1827; G06K15/1828; G06K15/1848; G06K15/1849; G06K2215/00; G06K2215/0002; G06K2215/0005; G06K2215/0011; Y; Y10; Y10S; Y10S707/00; Y10S707/99931
Claims Analysis
Total Claims: 35
Claim 1
Independent Claim
145 words
A method for encoding a main procedure having at least one nested procedure into a binary representation, comprising the steps of: encoding the main procedure into a binary format; reserving, in a storage buffer, memory locations for length information of the binary encoded main procedure; writing the binary encoded main procedure in the storage buffer; encoding said at least one nested procedure of the main procedure into a binary format; reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedure; writing the binary encoded nested procedure in the storage buffer; writing a length of the binary encoded nested procedure into the memory locations reserved for the length information of the binary encoded nested procedure; and writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 2
Independent Claim
145 words
A method for encoding a main procedure having at least one nested procedure into a binary representation, comprising the steps of: encoding the main procedure into a binary format; reserving, in a storage buffer, memory locations for length information of the binary encoded main procedure; writing the binary encoded main procedure in the storage buffer; encoding said at least one nested procedure of the main procedure into a binary format; reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedure; writing the binary encoded nested procedure in the storage buffer; writing a length of the binary encoded nested procedure into the memory locations reserved for the length information of the binary encoded nested procedure; and writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 3
Dependent Claim
92 words
A method for encoding a textual representation of nested procedures into a binary representation according to claim 1, further comprising the steps of: storing the positions of the reserved memory locations for length information of the binary encoded main procedure, after the step of reserving the memory locations for length information of the binary encoded main procedure; and storing the positions of the reserved memory locations for length information of the binary encoded nested procedure, after the step of reserving the memory locations for length information of the binary encoded nested procedure.
Claim 4
Dependent Claim
52 words
A method for encoding a textual representation of nested procedures into a binary representation according to claim 2, wherein: the step of storing the position information of the binary encoded nested procedure and the step of storing the position information of the nested procedure store the respective position information in one stack.
Claim 5
Dependent Claim
77 words
A method for encoding a textual representation of nested procedures into a binary representation according to claim 2, further comprising the step of: storing position information relating to a next available position of the storage buffer whenever memory locations are reserved in the storage buffer; and storing position information relating to a next available position of the storage buffer whenever at least one of the main and nested binary encoded routine are written into the storage buffer.
Claim 6
Dependent Claim
59 words
A method for encoding a main procedure having at least one nested procedure into a binary representation according to claim 1 further comprising the step: checking the storage buffer before each writing or reserving in the storage buffer for a storage buffer full condition and if said storage buffer is determined to be full, allocating an additional memory buffer.
Claim 7
Dependent Claim
36 words
A method for encoding a main procedure having at least one nested procedure into a binary representation according to claim 5, further comprising the step of: creating an array index for each additional memory buffer allocated.
Claim 8
Dependent Claim
36 words
A method for encoding a main procedure having at least one nested procedure into a binary representation according to claim 5, further comprising the step: creating a linked list data structure for each allocated memory buffer.
Claim 9
Dependent Claim
63 words
A method for encoding a main procedure having at least one nested procedure into a binary representation according to claim 7, further comprising the step of: creating, during the step of creating a linked list data structure, a double linked list data structure having a pointer to a previous linked list data structure and a pointer to a next linked list data structure.
Claim 10
Dependent Claim
52 words
A method for encoding a main procedure having at least one nested procedure according to claim 1, further comprising the steps of: initially representing said main procedure and said at least one nested procedure in a clear text format; and storing the clear text format before the procedures are encoded into binary.
Claim 11
Independent Claim
168 words
A method for encoding a textual representation of nested procedures into a binary representation, comprising the steps of: reserving memory locations in a memory buffer for length information of a main procedure; storing position information of the reserved memory locations of the main procedure; converting a textual representation of the main procedure into a binary representation and writing the binary representation into the memory buffer; reserving memory locations in the memory buffer for length information of nested procedures within the main procedure; storing position information of the reserved memory locations of the nested procedure; converting a textual representation of the nested procedure into a binary representation and writing the binary representation of the nested procedure into the memory buffer; writing a length of the nested procedure into a position in the memory buffer corresponding to the stored position information of the nested procedure; and writing a length of the main procedure into a position in the memory buffer corresponding to the stored position information of the main procedure.
Claim 12
Independent Claim
168 words
A method for encoding a textual representation of nested procedures into a binary representation, comprising the steps of: reserving memory locations in a memory buffer for length information of a main procedure; storing position information of the reserved memory locations of the main procedure; converting a textual representation of the main procedure into a binary representation and writing the binary representation into the memory buffer; reserving memory locations in the memory buffer for length information of nested procedures within the main procedure; storing position information of the reserved memory locations of the nested procedure; converting a textual representation of the nested procedure into a binary representation and writing the binary representation of the nested procedure into the memory buffer; writing a length of the nested procedure into a position in the memory buffer corresponding to the stored position information of the nested procedure; and writing a length of the main procedure into a position in the memory buffer corresponding to the stored position information of the main procedure.
Claim 13
Dependent Claim
69 words
A method for encoding a textual representation of nested procedures into a binary representation according to claim 10, further comprising the step of: storing a next available position of the memory buffer whenever memory locations are reserved in the memory buffer; and storing a next available position of the memory buffer whenever at least one of the main and nested binary encoded procedure are written into the memory buffer.
Claim 14
Dependent Claim
94 words
A method for encoding a textual representation of nested procedures into a binary representation according to claim 10, further comprising the steps of: repeating the steps of reserving memory locations, converting a textual representation of a procedure to a binary representation, and storing the binary representation for each nested procedure within the main procedure when there are a plurality of nested procedures within the main procedure; and repeating the step of writing a length of the nested procedures for each nested procedure when there are a plurality of nested procedures within the main procedure.
Claim 15
Independent Claim
298 words
A method of encoding a main procedure having at least one nested procedure into a binary representation, comprising the steps of: encoding the main procedure into a binary format; reserving, in a storage buffer, memory locations for length information of the binary encoded main procedure; writing the binary encoded main procedure in the storage buffer after determining there are available memory location in the storage buffer for the binary encoded main procedure and if there are not available memory locations in the storage buffer for the binary encoded main procedure, creating an additional memory buffer having an index and writing portions of the binary encoded main procedure which will not fit into said first storage buffer; encoding said at least one nested procedure of the main procedure into a binary format; reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedures if there are available memory locations in said storage buffer and if there are available memory locations, allocating an additional storage buffer having an index; writing the binary encoded nested procedure in the storage buffer if there are available memory locations for the binary encoded nested procedure in the storage buffer and if there are not available memory locations for the binary encoded nested procedure in the storage buffer, allocating an additional storage buffer having an index and writing a portion of the binary encoded nested procedure into the additional storage buffer if there are not available memory locations in said storage buffer; writing a length of the binary encoded nested procedure into the memory locations for the length information of the binary encoded nested procedure; and writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 16
Independent Claim
298 words
A method of encoding a main procedure having at least one nested procedure into a binary representation, comprising the steps of: encoding the main procedure into a binary format; reserving, in a storage buffer, memory locations for length information of the binary encoded main procedure; writing the binary encoded main procedure in the storage buffer after determining there are available memory location in the storage buffer for the binary encoded main procedure and if there are not available memory locations in the storage buffer for the binary encoded main procedure, creating an additional memory buffer having an index and writing portions of the binary encoded main procedure which will not fit into said first storage buffer; encoding said at least one nested procedure of the main procedure into a binary format; reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedures if there are available memory locations in said storage buffer and if there are available memory locations, allocating an additional storage buffer having an index; writing the binary encoded nested procedure in the storage buffer if there are available memory locations for the binary encoded nested procedure in the storage buffer and if there are not available memory locations for the binary encoded nested procedure in the storage buffer, allocating an additional storage buffer having an index and writing a portion of the binary encoded nested procedure into the additional storage buffer if there are not available memory locations in said storage buffer; writing a length of the binary encoded nested procedure into the memory locations for the length information of the binary encoded nested procedure; and writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 17
Independent Claim
137 words
An apparatus for encoding nested procedures into a binary representation, comprising: generating means for generating procedures, said procedures including a main procedure having at least one nested procedure; means for encoding the generated procedures into a binary format Standard Page Description Language ("SPDL") tokensequence, connected to the generating means; a logically contiguous memory buffer connected to the means for encoding the generated procedures into a binary format; means, connected to the logically contiguous memory buffer, for writing a length of the binary representation of the main procedure and said at least one nested procedure into the logically contiguous memory buffer; and means, connected to the logically contiguous memory buffer, for reserving memory locations within the logically contiguous memory buffer for storing lengths of the binary representations of the main procedure and said at least one nested procedure.
Claim 18
Independent Claim
137 words
An apparatus for encoding nested procedures into a binary representation, comprising: generating means for generating procedures, said procedures including a main procedure having at least one nested procedure; means for encoding the generated procedures into a binary format Standard Page Description Language ("SPDL") tokensequence, connected to the generating means; a logically contiguous memory buffer connected to the means for encoding the generated procedures into a binary format; means, connected to the logically contiguous memory buffer, for writing a length of the binary representation of the main procedure and said at least one nested procedure into the logically contiguous memory buffer; and means, connected to the logically contiguous memory buffer, for reserving memory locations within the logically contiguous memory buffer for storing lengths of the binary representations of the main procedure and said at least one nested procedure.
Claim 19
Dependent Claim
64 words
An apparatus for encoding nested procedures into a binary representation according to claim 14, further comprising: a first memory means, connected to the means for reserving memory locations, for storing positions of the reserved memory locations; and a second memory means, connected to the logically contiguous memory buffer, for storing position information relating to a next empty position in the logically contiguous memory buffer.
Claim 20
Independent Claim
151 words
A method for encoding a main procedure having at least one nested procedure into a binary representation, comprising the steps of: encoding the main procedure into a Standard Page Description Language ("SPDL") binary format tokensequence; reserving, in a storage buffer, memory locations for length information of the binary encoded main procedure; writing the binary encoded main procedure in the storage buffer; encoding said at least one nested procedure of the main procedure into a binary format; reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedure; writing the binary encoded nested procedure in the storage buffer; writing a length of the binary encoded nested procedure into the memory locations reserved for the length information of the binary encoded nested procedure; and writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 21
Independent Claim
151 words
A method for encoding a main procedure having at least one nested procedure into a binary representation, comprising the steps of: encoding the main procedure into a Standard Page Description Language ("SPDL") binary format tokensequence; reserving, in a storage buffer, memory locations for length information of the binary encoded main procedure; writing the binary encoded main procedure in the storage buffer; encoding said at least one nested procedure of the main procedure into a binary format; reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedure; writing the binary encoded nested procedure in the storage buffer; writing a length of the binary encoded nested procedure into the memory locations reserved for the length information of the binary encoded nested procedure; and writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 22
Dependent Claim
92 words
A method for encoding a textual representation of nested procedures into a binary representation according to claim 16, further comprising the steps of: storing the positions of the reserved memory locations for length information of the binary encoded main procedure, after the step of reserving the memory locations for length information of the binary encoded main procedure; and storing the positions of the reserved memory locations for length information of the binary encoded nested procedure, after the step of reserving the memory locations for length information of the binary encoded nested procedure.
Claim 23
Independent Claim
161 words
An apparatus for encoding a main procedure having at least one nested procedure into a binary representation, comprising: a storage buffer; means for encoding the main procedure into a binary format; means for reserving, in the storage buffer, memory locations for length information of the binary encoded main procedure; means for writing the binary encoded main procedure in the storage buffer; means for encoding said at least one nested procedure of the main procedure into a binary format; means for reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedure; means for writing the binary encoded nested procedure in the storage buffer; means for writing a length of the binary encoded nested procedure into the memory locations reserved for the length information of the binary encoded nested procedure; and means for writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 24
Independent Claim
161 words
An apparatus for encoding a main procedure having at least one nested procedure into a binary representation, comprising: a storage buffer; means for encoding the main procedure into a binary format; means for reserving, in the storage buffer, memory locations for length information of the binary encoded main procedure; means for writing the binary encoded main procedure in the storage buffer; means for encoding said at least one nested procedure of the main procedure into a binary format; means for reserving, in the storage buffer, memory locations for length information of the binary encoded nested procedure; means for writing the binary encoded nested procedure in the storage buffer; means for writing a length of the binary encoded nested procedure into the memory locations reserved for the length information of the binary encoded nested procedure; and means for writing a length of the binary encoded main procedure into the memory locations reserved for the length information of the binary encoded main procedure.
Claim 25
Dependent Claim
121 words
An apparatus for encoding a textual representation of nested procedures into a binary representation according to claim 18, further comprising: means for storing the positions of the reserved memory locations for length information of the binary encoded main procedure, after the means for reserving the memory locations for length information of the binary encoded main procedure has reserved the memory locations for length information of the binary encoded main procedure; and means for storing the positions of the reserved memory locations for length information of the binary encoded nested procedure, after the means for reserving the memory locations for length information of the binary encoded nested procedure has reserved the memory locations for length information of the binary encoded nested procedure.
Claim 26
Dependent Claim
25 words
An apparatus for encoding a textual representation of nested procedures into a binary representation according to claim 19, wherein: the storage buffer comprises one stack.
Claim 27
Dependent Claim
78 words
An apparatus for encoding a textual representation of nested procedures into a binary representation according to claim 19, further comprising: means for storing position information relating to a next available position of the storage buffer whenever memory locations are reserved in the storage buffer; and means for storing position information relating to a next available position of the storage buffer whenever at least one of the main and nested binary encoded routine are written into the storage buffer.
Claim 28
Dependent Claim
59 words
An apparatus for encoding a main procedure having at least one nested procedure into a binary representation according to claim 18, further comprising: means for checking the storage buffer before each writing or reserving in the storage buffer for a storage buffer full condition and if said storage buffer is determined to be full, allocating an additional memory buffer.
Claim 29
Dependent Claim
35 words
An apparatus for encoding a main procedure having at least one nested procedure into a binary representation according to claim 22, further comprising: means for creating an array index for each additional memory buffer allocated.
Claim 30
Dependent Claim
33 words
An apparatus for encoding a main procedure having at least one nested procedure into a binary representation according to claim 22, wherein: each of said memory buffers is a linked list data structure.
Claim 31
Dependent Claim
56 words
An apparatus for encoding a main procedure having at least one nested procedure into a binary representation according to claim 24, wherein: each of said linked list data structures is a double linked list data structure having a pointer to a previous linked list data structure and a pointer to a next linked list data structure.
Claim 32
Dependent Claim
55 words
An apparatus for encoding a main procedure having at least one nested procedure according to claim 18, further comprising: means for initially representing said main procedure and said at least one nested procedure in a clear text format; and means for storing the clear text format main procedure, before the procedures are encoded into binary.
Claim 33
Independent Claim
184 words
An apparatus for encoding a textual representation of nested procedures into a binary representation, comprising: a memory buffer; means for reserving memory locations in the memory buffer for length information of a main procedure; means for storing position information of the reserved memory locations of the main procedure; means for converting a textual representation of the main procedure into a binary representation and writing the binary representation into the memory buffer; means for reserving memory locations in the memory buffer for length information of nested procedures within the main procedure; means for storing position information of the reserved memory locations of the nested procedure; means for converting a textual representation of the nested procedure into a binary representation and writing the binary representation of the nested procedure into the memory buffer; means for writing a length of the nested procedure into a position in the memory buffer corresponding to the stored position information of the nested procedure; and means for writing a length of the main procedure into a position in the memory buffer corresponding to the stored position information of the main procedure.
Claim 34
Independent Claim
184 words
An apparatus for encoding a textual representation of nested procedures into a binary representation, comprising: a memory buffer; means for reserving memory locations in the memory buffer for length information of a main procedure; means for storing position information of the reserved memory locations of the main procedure; means for converting a textual representation of the main procedure into a binary representation and writing the binary representation into the memory buffer; means for reserving memory locations in the memory buffer for length information of nested procedures within the main procedure; means for storing position information of the reserved memory locations of the nested procedure; means for converting a textual representation of the nested procedure into a binary representation and writing the binary representation of the nested procedure into the memory buffer; means for writing a length of the nested procedure into a position in the memory buffer corresponding to the stored position information of the nested procedure; and means for writing a length of the main procedure into a position in the memory buffer corresponding to the stored position information of the main procedure.
Claim 35
Dependent Claim
70 words
An apparatus for encoding a textual representation of nested procedures into a binary representation according to claim 27, further comprising: means for storing a next available position of the memory buffer whenever memory locations are reserved in the memory buffer; and means for storing a next available position of the memory buffer whenever at least one of the main and nested binary encoded procedure are written into the memory buffer.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-12-19 | 1998-06-20 | 1998-12-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-12-19 | 2002-06-20 | 2002-12-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-12-19 | 2006-06-20 | 2006-12-20 | $7700.00 | Window Closed / Lapsed |