{"id":{"repo_id":"eastern-wash","oai_identifier":"oai:dc.ewu.edu:theses-1852"},"canonical_url":"https://search.dev.ndltd.org/etd/eastern-wash/oai:dc.ewu.edu:theses-1852","repository":{"repo_id":"eastern-wash","name":"Eastern Washington University","base_url":"https://dc.ewu.edu/do/oai/"},"display":{"title":"Conversion form structured programming to an object-oriented programming structure","abstract":"<p>Structured programming languages have been in use for several decades. Each of these languages has different techniques for promoting modularity. As a result of those techniques, computing professionals have become accustomed to the notlon that data and procedures are separate entities. Object-oriented programming languages replace data and procedures with the notions of activity, communication, and inheritance. Since these languages are relatively new, and not well understood, they are not used as often as their predecessors, structured programming languages; even though benefits (listed in the next paragraph) could be achieved by doing so. The best features of object-oriented languages are: modularity, data hiding, data abstraction, overloading, late binding, and inheritance. Many of today's languages support a few of these features, but, not as readily. In fact, many of these benefits can be achieved by a good modular design in conventional languages. Replacing structured programming languages is not suggested. Instead, a method is presented for the conversion of structured programming to an object- oriented structure. In Chapter 2, the groundwork is laid with some basic concepts. In Chapter 3,the two methodologies are compared by looking at some of the beneficial features in existing procedure-oriented languages. In Chapter 4, an algorithm is given for guaranteeing optimal structuring within an application. Chapter 5 is the blueprint for the conversion of any structured program to an object-oriented structure. In Chapter 6, a conclusion is given and four unanswered questions which require further research is presented. Finally, in the Appendix, an example of an actual program and its converted version is given. Explanations of the steps of the development are also provided.</p>","abstract_html":"&lt;p&gt;Structured programming languages have been in use for several decades. Each of these languages has different techniques for promoting modularity. As a result of those techniques, computing professionals have become accustomed to the notlon that data and procedures are separate entities. Object-oriented programming languages replace data and procedures with the notions of activity, communication, and inheritance. Since these languages are relatively new, and not well understood, they are not used as often as their predecessors, structured programming languages; even though benefits (listed in the next paragraph) could be achieved by doing so. The best features of object-oriented languages are: modularity, data hiding, data abstraction, overloading, late binding, and inheritance. Many of today&#x27;s languages support a few of these features, but, not as readily. In fact, many of these benefits can be achieved by a good modular design in conventional languages. Replacing structured programming languages is not suggested. Instead, a method is presented for the conversion of structured programming to an object- oriented structure. In Chapter 2, the groundwork is laid with some basic concepts. In Chapter 3,the two methodologies are compared by looking at some of the beneficial features in existing procedure-oriented languages. In Chapter 4, an algorithm is given for guaranteeing optimal structuring within an application. Chapter 5 is the blueprint for the conversion of any structured program to an object-oriented structure. In Chapter 6, a conclusion is given and four unanswered questions which require further research is presented. Finally, in the Appendix, an example of an actual program and its converted version is given. Explanations of the steps of the development are also provided.&lt;/p&gt;","abstract_has_math":false,"creators":["Krauter, Daryl Edward"],"institution":null,"degree_name":"Master of Science (MS) in Computer Science","degree_level":"Thesis: EWU Only","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1986,"date_issued":"1986-01-01T08:00:00Z","date_published":"1986-01-01T08:00:00Z","updated_at":"2026-07-24T02:12:46Z","subjects":["Programming Languages and Compilers","Theory and Algorithms"],"languages":[],"rights":["Access perpetually restricted to EWU users with an active EWU NetID"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://dc.ewu.edu/theses/856","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Krauter, Daryl Edward"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis: EWU Only"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS) in Computer Science"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Programming Languages and Compilers","Theory and Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["Access perpetually restricted to EWU users with an active EWU NetID"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://dc.ewu.edu/theses/856"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>Structured programming languages have been in use for several decades. Each of these languages has different techniques for promoting modularity. As a result of those techniques, computing professionals have become accustomed to the notlon that data and procedures are separate entities. Object-oriented programming languages replace data and procedures with the notions of activity, communication, and inheritance. Since these languages are relatively new, and not well understood, they are not used as often as their predecessors, structured programming languages; even though benefits (listed in the next paragraph) could be achieved by doing so. The best features of object-oriented languages are: modularity, data hiding, data abstraction, overloading, late binding, and inheritance. Many of today's languages support a few of these features, but, not as readily. In fact, many of these benefits can be achieved by a good modular design in conventional languages. Replacing structured programming languages is not suggested. Instead, a method is presented for the conversion of structured programming to an object- oriented structure. In Chapter 2, the groundwork is laid with some basic concepts. In Chapter 3,the two methodologies are compared by looking at some of the beneficial features in existing procedure-oriented languages. In Chapter 4, an algorithm is given for guaranteeing optimal structuring within an application. Chapter 5 is the blueprint for the conversion of any structured program to an object-oriented structure. In Chapter 6, a conclusion is given and four unanswered questions which require further research is presented. Finally, in the Appendix, an example of an actual program and its converted version is given. Explanations of the steps of the development are also provided.</p>"]},{"key":"dc:title","label":"Title","values":["Conversion form structured programming to an object-oriented programming structure"]}]}],"canonical_facts":{"dc:creator":["Krauter, Daryl Edward"],"dc:description.abstract":["<p>Structured programming languages have been in use for several decades. Each of these languages has different techniques for promoting modularity. As a result of those techniques, computing professionals have become accustomed to the notlon that data and procedures are separate entities. Object-oriented programming languages replace data and procedures with the notions of activity, communication, and inheritance. Since these languages are relatively new, and not well understood, they are not used as often as their predecessors, structured programming languages; even though benefits (listed in the next paragraph) could be achieved by doing so. The best features of object-oriented languages are: modularity, data hiding, data abstraction, overloading, late binding, and inheritance. Many of today's languages support a few of these features, but, not as readily. In fact, many of these benefits can be achieved by a good modular design in conventional languages. Replacing structured programming languages is not suggested. Instead, a method is presented for the conversion of structured programming to an object- oriented structure. In Chapter 2, the groundwork is laid with some basic concepts. In Chapter 3,the two methodologies are compared by looking at some of the beneficial features in existing procedure-oriented languages. In Chapter 4, an algorithm is given for guaranteeing optimal structuring within an application. Chapter 5 is the blueprint for the conversion of any structured program to an object-oriented structure. In Chapter 6, a conclusion is given and four unanswered questions which require further research is presented. Finally, in the Appendix, an example of an actual program and its converted version is given. Explanations of the steps of the development are also provided.</p>"],"dc:identifier":["https://dc.ewu.edu/theses/856"],"dc:rights":["Access perpetually restricted to EWU users with an active EWU NetID"],"dc:subject":["Programming Languages and Compilers","Theory and Algorithms"],"dc:title":["Conversion form structured programming to an object-oriented programming structure"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis: EWU Only"],"thesis:degree_name":["Master of Science (MS) in Computer Science"]},"updated_at":"2026-07-24T02:12:46Z"}