Abstract

In part I [11] of the paper elimination of global procedure parameters and modularity of programming languages have been investigated. The methods developed there are used in the present part II to prove that the so called macro program problem for ALGOL 60 and other ALGOL-like languages is algorithmically unsolvable (Theorem 4.3 and 4.4). Macro grammars theory is applied in order to determine sublanguages for which the macro program problem is solvable (Theorem 4.1, 5.2---5.5).

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 call

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.