US5086504A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for performing computer system functions defined by a hierarchial programming language having default nodes
Assignee: Agilent Technologies Inc
•
Filing: 1989-02-28
•
Granted: 1992-02-04
•
Expires: 2009-02-28
Abstract
Abstract A method of extending a hierarchial programming language that retains compatibility with programs written for the original language. This method also allows a language to be defined that permits common commands to be abbreviated into shorter forms, providing a more user friendly system, while still permitting the longer form of a command to perform the intended way. The method also allows such a language to be restructured and extended by inserting a new level into the parse tree of the language. The method comprises inserting a default node into the parse tree of the language at the point where the extension, or the shortened command form, occurs. When the disclosed language parser method interprets the tree, the default node will be treated as if the mnemonic of the default node were actually in the command being parsed at the position where the default node appears in the tree. The disclosed method of processing the new parse tree also allows multiple commands per line, as required by existing standards. The method allows default nodes to occur at any level in the tree.
Inventors
- 👤 Jay J. Nemeth-Johannes
- 👤 Stephen J. Greer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 15:29
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/40; G06F8/41; G06F8/42; G06F8/427; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/3183; G01R31/318307; G01R31/319; G01R31/31903; G01R31/31907; G06F2201/00; G06F2201/865
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
146 words
A computer implemented method of parsing a command in an extensible hierarchical programming language within a computer driven system, said language being defined by a parse tree having extension represented by default nodes, said computer implemented method comprising the steps of: retrieving one or more header mnemonics of said command; sequentially matching each of said header mnemonics retrieved to a mnemonic of a node of successive levels of said parse tree; if no match occurs at one of said levels of said parse tree and said level has a default node, skipping said level; matching any remaining default nodes below any node having a mnemonic that matches a last of said header mnemonics; and if said last header mnemonic matches a lowest level node of said parse tree, performing at least one computer system function, within said computer driven system, defined at said lowest level node.
Claim 2
Dependent Claim
146 words
A computer implemented method of parsing a command in an extensible hierarchical programming language within a computer driven system, said language being defined by a parse tree having extension represented by default nodes, said computer implemented method comprising the steps of: retrieving one or more header mnemonics of said command; sequentially matching each of said header mnemonics retrieved to a mnemonic of a node of successive levels of said parse tree; if no match occurs at one of said levels of said parse tree and said level has a default node, skipping said level; matching any remaining default nodes below any node having a mnemonic that matches a last of said header mnemonics; and if said last header mnemonic matches a lowest level node of said parse tree, performing at least one computer system function, within said computer driven system, defined at said lowest level node.
Claim 3
Dependent Claim
227 words
A computer implemented method of parsing one or more commands of a command line in an extensible hierarchical programming language within a computer driven system, said language being defined by a parse tree having extension represented by default nodes, said computer implemented method comprising the steps of: (a) setting a tree level to a highest level of said parse tree; (b) retrieving a next command line; (c) retrieving one or more header mnemonics of a next command of said command line; (d) sequentially matching each of said header mnemonics retrieved to a mnemonic of a node of successive levels of said parse tree, starting at said tree level; (e) if no match occurs at one of said levels of said parse tree and said level has a default node, skipping said level; (f) retaining a previous matching tree level each time a match occurs; (g) matching any remaining default nodes below any node having a mnemonic that matches a last of said header mnemonics; (h) if said last header mnemonic matches a lowest level node of said parse tree, performing at least one computer system function, with said computer driven system, defined at said lowest level node; (i) if more commands remain within said command line, setting said tree level to said previous matching tree level, and proceeding with step (c); and (j) proceeding with step (a).
Claim 4
Dependent Claim
227 words
A computer implemented method of parsing one or more commands of a command line in an extensible hierarchical programming language within a computer driven system, said language being defined by a parse tree having extension represented by default nodes, said computer implemented method comprising the steps of: (a) setting a tree level to a highest level of said parse tree; (b) retrieving a next command line; (c) retrieving one or more header mnemonics of a next command of said command line; (d) sequentially matching each of said header mnemonics retrieved to a mnemonic of a node of successive levels of said parse tree, starting at said tree level; (e) if no match occurs at one of said levels of said parse tree and said level has a default node, skipping said level; (f) retaining a previous matching tree level each time a match occurs; (g) matching any remaining default nodes below any node having a mnemonic that matches a last of said header mnemonics; (h) if said last header mnemonic matches a lowest level node of said parse tree, performing at least one computer system function, with said computer driven system, defined at said lowest level node; (i) if more commands remain within said command line, setting said tree level to said previous matching tree level, and proceeding with step (c); and (j) proceeding with step (a).
Claim 5
Dependent Claim
298 words
A computer implemented method of parsing a series of commands in an extensible hierarchical programming language within a computer driven system, said language being defined by a parse tree having extensions represented by default nodes with parallel nil nodes, said computer implemented method comprising the steps of: (a) setting a current node indicator to reference a root node of said parse tree; (aa) retrieving a next one of said commands; (b) getting a next header mnemonic from said command; (c) if said header mnemonic does not match a mnemonic of a node below said current node in said parse tree, proceeding with step (j); (d) saving a matching node indicator from a node below said current node in said parse tree wherein a mnemonic of said node matches said header mnemonic; (e) if no more header mnemonics are available for said header, proceeding with step (g); (f) setting said current node indicator to said matching node indicator, and proceeding with step (b); (g) if said matching node indicator references a leaf node of said parse tree, proceeding with step (l); (h) if a default node does not exist below said matching node in said parse tree, proceeding with stem (m); (i) setting said matching node indicator to reference a default node below said matching node, and proceeding with step (g); (j) if a nil node does not exist below said current node in said parse tree, proceeding with step (m); (k) setting said current node indicator to reference a nil node below said current node, and proceeding with step (c); (l) performing at least one computer system function, with in said computer driven system, required at said matching node of said parse tree, then proceeding with step (a); (m) returning a command error, then proceeding with step (a).
Claim 6
Dependent Claim
298 words
A computer implemented method of parsing a series of commands in an extensible hierarchical programming language within a computer driven system, said language being defined by a parse tree having extensions represented by default nodes with parallel nil nodes, said computer implemented method comprising the steps of: (a) setting a current node indicator to reference a root node of said parse tree; (aa) retrieving a next one of said commands; (b) getting a next header mnemonic from said command; (c) if said header mnemonic does not match a mnemonic of a node below said current node in said parse tree, proceeding with step (j); (d) saving a matching node indicator from a node below said current node in said parse tree wherein a mnemonic of said node matches said header mnemonic; (e) if no more header mnemonics are available for said header, proceeding with step (g); (f) setting said current node indicator to said matching node indicator, and proceeding with step (b); (g) if said matching node indicator references a leaf node of said parse tree, proceeding with step (l); (h) if a default node does not exist below said matching node in said parse tree, proceeding with stem (m); (i) setting said matching node indicator to reference a default node below said matching node, and proceeding with step (g); (j) if a nil node does not exist below said current node in said parse tree, proceeding with step (m); (k) setting said current node indicator to reference a nil node below said current node, and proceeding with step (c); (l) performing at least one computer system function, with in said computer driven system, required at said matching node of said parse tree, then proceeding with step (a); (m) returning a command error, then proceeding with step (a).
References Cited (Backward Citations)
US4471459A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-02-03 | 1995-08-05 | 1996-02-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-02-03 | 1999-08-05 | 2000-02-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-02-03 | 2003-08-05 | 2004-02-04 | $7700.00 | Window Closed / Lapsed |