US5822592A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for determining source code location
Assignee: US West Advanced Technologies Inc
•
Filing: 1997-01-30
•
Granted: 1998-10-13
•
Expires: 2017-01-30
Abstract
Abstract A first improved method is disclosed for constructing a parse tree. The parse tree includes parse tree node records including a child pointer field, a sibling pointer field and an end position field. The improvement comprises storing information in the end position field. The information being selected from the group of an end position value and a parent node address. A second improved method is disclosed for identifying a source code segment associated with a first parse tree node record. The improvement comprises the step of determining the start position of the source code segment based on a variant field of the first node record and a variant field of a second node record. The improvement further comprises the step of determining the end position of the source code segment based on the variant field of the first node record.
Inventors
- 👤 Jianhua Zhu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 14:41
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F8/42; G06F8/427
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
132 words
A method for constructing a parse tree, the parse tree having a plurality of nodes represented by parse tree node records, each record being associated with a source code segment having a start location and an end location, the method comprising: storing a first value in a child pointer field of a record, the first value being selected from a group of nil and a child node address; storing a second value in a sibling pointer field of the record, the second value being selected from a group of nil and a sibling node address; providing a variant field for the record; selecting a third value from a group consisting of a parent node address and an end position; and storing the third value selected in the variant field of the record.
Claim 2
Independent Claim
132 words
A method for constructing a parse tree, the parse tree having a plurality of nodes represented by parse tree node records, each record being associated with a source code segment having a start location and an end location, the method comprising: storing a first value in a child pointer field of a record, the first value being selected from a group of nil and a child node address; storing a second value in a sibling pointer field of the record, the second value being selected from a group of nil and a sibling node address; providing a variant field for the record; selecting a third value from a group consisting of a parent node address and an end position; and storing the third value selected in the variant field of the record.
Claim 3
Dependent Claim
41 words
The method of claim 1 wherein selecting a third value includes: calculating an end position when a node represented by the record has a sibling; and calculating a parent node address when the node represented by the record lacks a sibling.
Claim 4
Independent Claim
104 words
A method for identifying a source code segment associated with a first parse tree node record, wherein a start position of the source code segment is determined based on a field of a second node record, the method comprising: determining the start position based on a variant field of the first node record and a variant field of the second node record wherein the variant fields of the first and second node records have contents selected from a group consisting of a parent node address and an end position; and determining an end position based on the variant field of the first node record.
Claim 5
Independent Claim
104 words
A method for identifying a source code segment associated with a first parse tree node record, wherein a start position of the source code segment is determined based on a field of a second node record, the method comprising: determining the start position based on a variant field of the first node record and a variant field of the second node record wherein the variant fields of the first and second node records have contents selected from a group consisting of a parent node address and an end position; and determining an end position based on the variant field of the first node record.
Claim 6
Dependent Claim
58 words
The method of claim 3 wherein determining an end position includes: determining the end position to equal the value of the variant field when the first node record fails to represent a last child node; determining the end position to equal the end position of a parent node when the first node record represents a last child node.
References Cited (Backward Citations)
US4677550A
Cited
US5202986A
Cited
US5175856A
Cited
US5371747A
Cited
US5522036A
Cited
US5414836A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-10-12 | 2002-04-13 | 2002-10-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-10-12 | 2006-04-13 | 2006-10-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-10-12 | 2010-04-13 | 2010-10-13 | $7700.00 | Window Closed / Lapsed |