dc.contributor.author | Mejstrik, Norman Louis, | en_US |
dc.date.accessioned | 2013-08-16T12:28:48Z | |
dc.date.available | 2013-08-16T12:28:48Z | |
dc.date.issued | 1982 | en_US |
dc.identifier.uri | https://hdl.handle.net/11244/5070 | |
dc.description.abstract | To illustrate the theory, a transform statement syntax is developed, and an interpreter is used to demonstrate operations on several types of structures. The work documented herein is a potential basis for an advanced data structure manipulation language or program generator. | en_US |
dc.description.abstract | A method of formally specifying operations on a class of linked data structures is developed. Data structures are syntactically specified using K-formula grammars. The class of linked data structures whose K-formulas are recognizable by pushdown automata is shown to include those structures with an Eulerian traversal. A method for specifying all allowable operations on a given structure is given, using the structure grammar as a basis. | en_US |
dc.format.extent | vii, 113 leaves : | en_US |
dc.subject | Computer Science. | en_US |
dc.title | Formal specification of operations on a class of syntactically-specified data structures. | en_US |
dc.type | Thesis | en_US |
dc.thesis.degree | Ph.D. | en_US |
dc.thesis.degreeDiscipline | School of Electrical and Computer Engineering | en_US |
dc.note | Source: Dissertation Abstracts International, Volume: 43-11, Section: B, page: 3661. | en_US |
ou.identifier | (UMI)AAI8306724 | en_US |
ou.group | College of Engineering::School of Electrical and Computer Engineering | |