Abstract
This chapter describes the structure and use of a compiling system in which the translator is independent of the translation rules and, hence, is independent of either the object or target language. It discusses the meta language in which the translation rules are expressed. It also presents a set of examples illustrating the use of the meta language to specify translations of an algorithmic language into the language of a hypothetical machine. The translator is a program that operates on a set of specifications already described and on a string of symbols in the object language for those specifications. It produces a string of symbols in the output language. The translator itself is completely independent of either language and may operate on any object language. The heart of the translator is a program that diagrams a string of input symbols by referencing the specifications. The output of this program is a linked list connecting selected definitions together. In the operation of the translator, this output list serves as input to a second program that forms the output string from the indicated sequences of definitions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Tracts in Computer Science and Technology and Their Application
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
