Abstract
This paper provides a functional way of describing the analysis of contextual constraints in block-structured, imperative programming languages. As auxiliary formal framework for the intended description, the general concept of many-sorted tree transducer is defined; such transducers are special left-linear, confluent, and noetherian term-rewriting systems in which both sides of the rewrite rules are applicative terms. Then, the contextual analysis is described by five different instances of the auxiliary framework where these instances are known from the literature, viz., top-down tree transducers, macro tree transducers, modular tree transducers, high-level tree transducers, and high-level modular tree transducers. Hence, this paper provides a nontrivial example for each of the mentioned families of tree transducers and it shows how features involved in these tree transducers can be exploited.
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 callDisclaimer: 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.
