On the public citation graph

Composition and evaluation of attribute coupled grammars

https://doi.org/10.1007/bf02737108
0 signed · 99 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07141-5_228openalex-snapshot
Code-Optimierung Mittels Attributierter Transformationsgrammatiken
inferredcites →https://doi.org/10.1007/3-540-08065-1_2openalex-snapshot
Semantic attributes processing in the system DELTA
inferredcites →https://doi.org/10.1007/3-540-09510-1_48openalex-snapshot
More on advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1007/3-540-10843-2_16openalex-snapshot
Passes, sweeps and visits
inferredcites →https://doi.org/10.1007/3-540-11571-4openalex-snapshot
An Attribute Grammar for the Semantic Analysis of Ada
inferredcites →https://doi.org/10.1007/3-540-19072-4openalex-snapshot
Attribute Grammar Inversion and Source-to-source Translation
inferredcites →https://doi.org/10.1007/978-3-642-67600-0_10openalex-snapshot
OPTRAN, a Language for the Specification of Program Transformations
inferredcites →https://doi.org/10.1007/978-3-642-72248-6_5openalex-snapshot
Attributed Tree Transducers
inferredcites →https://doi.org/10.1007/bf00264472openalex-snapshot
Interpretation and reduction of attribute grammars
inferredcites →https://doi.org/10.1007/bf00264495openalex-snapshot
A characterization of attribute evaluation in passes
inferredcites →https://doi.org/10.1007/bf00265558openalex-snapshot
Computation sequences: A way to characterize classes of attribute grammars
inferredcites →https://doi.org/10.1007/bf00288644openalex-snapshot
Ordered attributed grammars
inferredcites →https://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01702865openalex-snapshot
Semantics of context-free languages: Correction
inferredcites →https://doi.org/10.1007/bfb0034297openalex-snapshot
GAG: A Practical Compiler Generator
inferredcites →https://doi.org/10.1007/bfb0059699openalex-snapshot
Examples of formal semantics
inferredcites →https://doi.org/10.1016/0022-0000(82)90030-7openalex-snapshot
Simple multi-visit attribute grammars
inferredcites →https://doi.org/10.1016/0167-6423(83)90021-7openalex-snapshot
Increasing modularity and language-independency in automatically generated compilers
inferredcites →https://doi.org/10.1016/0304-3975(81)90080-3openalex-snapshot
More on advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1016/0304-3975(82)90003-2openalex-snapshot
Attribute grammars and recursive program schemes I
inferredcites →https://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50014-2openalex-snapshot
SOME OPEN QUESTIONS AND RECENT RESULTS ON TREE TRANSDUCERS AND TREE LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0019-9958(82)90786-0openalex-snapshot
On the equivalence problem for attribute systems
inferredcites →https://doi.org/10.1016/s0019-9958(86)80043-2openalex-snapshot
Machines for attribute grammars
inferredcites →https://doi.org/10.1016/s0022-0000(74)80045-0openalex-snapshot
Attributed translations
inferredcites →https://doi.org/10.1109/sfcs.1980.37openalex-snapshot
Proofs by induction in equational theories with constructors
inferredcites →https://doi.org/10.1109/tse.1986.6312955openalex-snapshot
The automatic inversion of attribute grammars
inferredcites →https://doi.org/10.1137/0210060openalex-snapshot
Minimizing the Number of Evaluation Passes for Attribute Grammars
inferredcites →https://doi.org/10.1145/22899.22905openalex-snapshot
A software architecture for supporting the exchange of electronic manuscripts
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/361227.361231openalex-snapshot
The intrinsically exponential complexity of the circularity problem for attribute grammars
inferredcites →https://doi.org/10.1145/502874.502881openalex-snapshot
Sub-protocol-evaluators for attribute grammars
inferredcites →https://doi.org/10.1145/502874.502890openalex-snapshot
Attribute coupled grammars
inferredcites →https://doi.org/10.1145/502949.502881openalex-snapshot
Sub-protocol-evaluators for attribute grammars
inferredcites →https://doi.org/10.1145/502949.502882openalex-snapshot
Strongly non-circular attribute grammars and their recursive evaluation
inferredcites →https://doi.org/10.1145/502949.502890openalex-snapshot
Attribute coupled grammars
inferredcites →https://doi.org/10.1145/512927.512941openalex-snapshot
Advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1145/582153.582167openalex-snapshot
Eliminating redundant object code
inferredcites →https://doi.org/10.1145/582153.582178openalex-snapshot
A semantics-directed compiler generator
inferredcites →https://doi.org/10.1145/800055.802020openalex-snapshot
Listlessness is better than laziness
inferredcites →https://doi.org/10.1145/800168.811538openalex-snapshot
Automatic generation of efficient evaluators for attribute grammars
inferredcites →https://doi.org/10.1145/800181.810328openalex-snapshot
Alternating semantic evaluator
inferredcites →https://doi.org/10.1145/800230.806993openalex-snapshot
A truly generative semantics-directed compiler generator
inferredcites →https://doi.org/10.1145/872726.806993openalex-snapshot
A truly generative semantics-directed compiler generator
inferredcites →https://doi.org/10.3990/1.6119089openalex-snapshot
Theory of attribute grammars
inferredcites →https://doi.org/10.5555/800253.807733openalex-snapshot
Design evaluation of the compiler generating system MUG1
inferredcites →https://doi.org/10.7146/dpb.v10i138.7946openalex-snapshot
Computation sequences: A way to characterize subclasses of attribute grammars.
inferredcites →https://doi.org/10.7916/d8fb59x7openalex-snapshot
Covers of Attribute Grammars and Sub-Protocol .Attribute Evaluators

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.4380221102openalex-snapshot
Towards a toolkit for building language implementations
inferred← citeshttps://doi.org/10.1006/inco.1995.1016openalex-snapshot
Attributed Tree Transducers Cannot Induce All Deterministic Bottom-up Tree Transformations
inferred← citeshttps://doi.org/10.1006/inco.1998.2736openalex-snapshot
The Generating Power of Total Deterministic Tree Transducers
inferred← citeshttps://doi.org/10.1006/inco.1999.2807openalex-snapshot
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
inferred← citeshttps://doi.org/10.1006/jcss.1998.1573openalex-snapshot
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
inferred← citeshttps://doi.org/10.1006/jcss.1999.1684openalex-snapshot
A Comparison of Tree Transductions Defined by Monadic Second Order Logic and by Attribute Grammars
inferred← citeshttps://doi.org/10.1007/10704567_22openalex-snapshot
Declarative Program Transformation: A Deforestation Case-Study
inferred← citeshttps://doi.org/10.1007/10705424_8openalex-snapshot
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_13openalex-snapshot
Relating Accumulative and Non-accumulative Functional Programs
inferred← citeshttps://doi.org/10.1007/3-540-45607-4_3openalex-snapshot
On Deforesting Parameters of Accumulating Maps
inferred← citeshttps://doi.org/10.1007/3-540-50820-1_45openalex-snapshot
Coupled context-free grammar as a programming paradigm
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_11openalex-snapshot
Abstract interpretation using attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-57877-3_4openalex-snapshot
Coupling evaluators for attribute coupled grammars
inferred← citeshttps://doi.org/10.1007/978-1-4471-3501-2_13openalex-snapshot
Attributed Transformational Code Generation for Dynamic Compilers
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_4openalex-snapshot
Modular Design of Domain-Specific Languages Using Splittings of Catamorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_28openalex-snapshot
The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_13openalex-snapshot
Benefits of Tree Transducers for Optimizing Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_23openalex-snapshot
Extended Multi Bottom-Up Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_16openalex-snapshot
Categorical Descriptional Composition
inferred← citeshttps://doi.org/10.1007/bf01178667openalex-snapshot
Synthesized and inherited functions
inferred← citeshttps://doi.org/10.1007/bfb0036191openalex-snapshot
A two-dimensional hierarchy for attributed tree transducers
inferred← citeshttps://doi.org/10.1007/s00224-006-1235-9openalex-snapshot
Formal Efficiency Analysis for Tree Transducer Composition
inferred← citeshttps://doi.org/10.1007/s00224-008-9125-yopenalex-snapshot
Composing Stack-Attributed Tree Transducers
inferred← citeshttps://doi.org/10.1007/s00236-009-0105-8openalex-snapshot
Extended multi bottom–up tree transducers
inferred← citeshttps://doi.org/10.1007/s00236-019-00360-8openalex-snapshot
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
inferred← citeshttps://doi.org/10.1007/s002360050105openalex-snapshot
Prototyping realistic programming languages based on formal specifications
inferred← citeshttps://doi.org/10.1007/s10009-009-0107-4openalex-snapshot
Flexibility in modeling languages and tools: a call to arms
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90191-uopenalex-snapshot
Tree transducers with external functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-037101-3.50010-7openalex-snapshot
Program Transformation of CCFG Programs* *This research was supported in part by a Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture (No. 62460221).
inferred← citeshttps://doi.org/10.1016/b978-0-12-037104-4.50011-6openalex-snapshot
The Unfold/Fold Transformation for Attribute Grammars
inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.019openalex-snapshot
Compositions of extended top-down tree transducers
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.10.008openalex-snapshot
Attribute grammars for unranked trees as a query language for structured documents
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.007openalex-snapshot
Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80927-7openalex-snapshot
Deriving Event-Based Document Transformers from Tree-Based Specifications
inferred← citeshttps://doi.org/10.1017/s0956796803004933openalex-snapshot
Composition of functions with accumulating parameters
inferred← citeshttps://doi.org/10.1017/s095679680800693xopenalex-snapshot
Algebraic fusion of functions with an accumulating parameter and its improvement
inferred← citeshttps://doi.org/10.1017/s0960129503004109openalex-snapshot
Syntactic composition of top-down tree transducers is short cut fusion
inferred← citeshttps://doi.org/10.1093/comjnl/35.4.376openalex-snapshot
Constructing Programs as Executable Attribute Grammars
inferred← citeshttps://doi.org/10.1109/cmpsac.1990.139412openalex-snapshot
A tool specification language for software maintenance
inferred← citeshttps://doi.org/10.1137/s0097539701394511openalex-snapshot
Macro Tree Translations of Linear Size Increase are MSO Definable
inferred← citeshttps://doi.org/10.1142/9789814271059_0011openalex-snapshot
Type Checking of Tree Walking Transducers
inferred← citeshttps://doi.org/10.1145/1159803.1159835openalex-snapshot
Algebraic fusion of functions with an accumulating parameter and its improvement
inferred← citeshttps://doi.org/10.1145/143165.143210openalex-snapshot
Composable attribute grammars
inferred← citeshttps://doi.org/10.1145/174675.177971openalex-snapshot
Composing tree attributions
inferred← citeshttps://doi.org/10.1145/225540.225544openalex-snapshot
Conditional attribute grammars
inferred← citeshttps://doi.org/10.1162/coli_a_00291openalex-snapshot
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures
inferred← citeshttps://doi.org/10.18725/oparu-1060openalex-snapshot
Synthesized and inherited functions - a new computational model for syntax-directed semantics
inferred← citeshttps://doi.org/10.2197/ipsjjip.27.411openalex-snapshot
Using Algebraic Properties and Function Fusion to Evaluate Tree Accumulations in Parallel
inferred← citeshttps://doi.org/10.2197/ipsjtrans.2.175openalex-snapshot
Computing the Cost of Typechecking of Composition of Macro Tree Transducers
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.