Increasing modularity and language-independency in automatically generated compilers

DOI10.1016/0167-6423(83)90021-7zbMATH Open0565.68011OpenAlexW1965240571WikidataQ122977808 ScholiaQ122977808MaRDI QIDQ1058844FDOQ1058844

Harald Ganzinger

Publication date: 1983

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(83)90021-7

zbMATH Keywords

semantic processingautomatic compiler generationlanguage-independent modulesmodular compiler descriptions

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Cited In (14)

• Compositions of extended top-down tree transducers
• Composition and evaluation of attribute coupled grammars
• Extended Multi Bottom-Up Tree Transducers
• The generating power of total deterministic tree transducers
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• Extended multi bottom-up tree transducers
• Composing stack-attributed tree transducers
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• Title not available (Why is that?)
• A Generic Functional Representation of Sorted Trees Supporting Attribution
• Harald Ganzinger’s Legacy: Contributions to Logics and Programming
• Silver: an extensible attribute grammar system
• Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition

This page was built for publication: Increasing modularity and language-independency in automatically generated compilers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058844)