Patent EP0256881A2 successfully refreshed from Google Patents.
EP0256881A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
An automated method for creating a configuration database
Assignee: Westinghouse Electric Corp
•
Filing: 1987-08-18
•
Granted: —
•
Expires: 2007-08-18
Abstract
Abstract The present invention includes a compiler that translates a user provided database English-like description into a centralized database that is accessible by data acquisition software. The description is parsed by the compiler using a finite state table driven parser. The syntax table is converted into a syntax state or node table and a transition table. The transition table defines the recognizable tokens in each state. If a token matches a particular transition set, an action routine can be performed. When the end of the description is reached, the compiler combines the sections of the intermediate database into one continuous database suitable for loading into a data acquisition computer.
Inventors
- 👤 Robert William Thompson, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-07 21:40
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/25; G06F16/258
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
78 words
A method of creating a contiguous configuration database from a given database description having an English-like syntax including syntax nodes, where each block represents description of a data acquisition sensor, comprising the steps of: (a) reading (144) a token in the form of a section from said database description including said block; characterized by parsing said database description, and (b) executing (146-182) a current syntax node associated with the token to complete an entry in the configuration database.
Claim 2
Independent Claim
78 words
A method of creating a contiguous configuration database from a given database description having an English-like syntax including syntax nodes, where each block represents description of a data acquisition sensor, comprising the steps of: (a) reading (144) a token in the form of a section from said database description including said block; characterized by parsing said database description, and (b) executing (146-182) a current syntax node associated with the token to complete an entry in the configuration database.
Claim 3
Dependent Claim
75 words
A method as recited in claim 1, wherein step (b) comprises the steps of: (bi) comparing (146) token values (200) in transition sets (200-208) associated with the current syntax node (188) until a match to the token occurs; (bii) executing (150) an action routine designated (204) in the matched transition set (200-208), the action routine making an entry into the database for the matched token; and (biii) transferring (160-182) to a destination syntax node (206).
Claim 4
Dependent Claim
69 words
A method as recited in claim 2, wherein step (biii) includes the steps of: (1) executing (144-158) the destination syntax node (206) for the next read token; and (2) performing a transfer, (160-182) the transfer including returning (170) to the current syntax node and executing the current syntax node, returning (174) to a syntax node immediately following the qurrent syntax node or transferring (180) to a different syntax node.
Claim 5
Dependent Claim
92 words
A method as recited in claim 1 wherein the step of parsing comprises parsing the language-type description using a syntax table by comparing tokens to token values in transition sets until a match occurs and executing action routines identified by the syntax table (184, 192) for matched tokens, the action routines filling the intermediate database structures; and combining (302-316) the intermediate database structures into the contiguous configuration database (288) by concatenating the intermediate database structures and creating a header record (290) identifying the relative location of each structure within the configuration database.
Claim 6
Dependent Claim
132 words
A contiguous configuration database and a syntax table data structure combination, for parsing a language-type description characterized by a syntax node array (184) including syntax nodes each having a name (188) and a transition address (190) for a group of transition sets (196-210) associated with each node; and a transition table (192) including groups of transition sets, each transition set including a token value field (200) and a token type field (202) used to identify tokens in the language-type description, an action routine designation field (204) designating an action routine which fills the configuration database with the tokens, a destination node field (206) indicating the next syntax node to be executed and a transfer type field (208) identifying the type transfer that occurs between a current syntax node and a destination node.
Claim 7
Dependent Claim
132 words
A contiguous configuration database and a syntax table data structure combination, for parsing a language-type description characterized by a syntax node array (184) including syntax nodes each having a name (188) and a transition address (190) for a group of transition sets (196-210) associated with each node; and a transition table (192) including groups of transition sets, each transition set including a token value field (200) and a token type field (202) used to identify tokens in the language-type description, an action routine designation field (204) designating an action routine which fills the configuration database with the tokens, a destination node field (206) indicating the next syntax node to be executed and a transfer type field (208) identifying the type transfer that occurs between a current syntax node and a destination node.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.