On the public citation graph
The formal power of one-visit attribute grammars
0 signed · 79 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00289071openalex-snapshot
Extended linear macro grammars, iteration grammars, and register programs
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01704020openalex-snapshot
Bottom-up and top-down tree transformations— a comparison
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/s0019-9958(77)90309-6openalex-snapshot
IO-macrolanguages and attributed translations
inferredcites →https://doi.org/10.1016/s0019-9958(79)90635-1openalex-snapshot
Bounded nesting in macro grammars
inferredcites →https://doi.org/10.1016/s0022-0000(70)80017-4openalex-snapshot
Generalized2 sequential machine maps
inferredcites →https://doi.org/10.1016/s0022-0000(74)80031-0openalex-snapshot
A generalized approach to formal languages
inferredcites →https://doi.org/10.1016/s0022-0000(74)80045-0openalex-snapshot
Attributed translations
inferredcites →https://doi.org/10.1016/s0022-0000(76)80032-3openalex-snapshot
Un théorème de duplication pour les forêts algébriques
inferredcites →https://doi.org/10.1051/ita/197610r100051openalex-snapshot
Transductions de forêts reconnaissables monadiques, forêts corégulières
inferredcites →https://doi.org/10.1109/sfcs.1976.5openalex-snapshot
An algebraic formulation of knuthian semantics
inferredcites →https://doi.org/10.1109/sfcs.1980.31openalex-snapshot
On the expressive power of attribute grammars
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/359997.359999openalex-snapshot
Semantic evaluation from left to right
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/800168.811538openalex-snapshot
Automatic generation of efficient evaluators for attribute grammars
inferredcites →https://doi.org/10.7146/dpb.v7i90.6505openalex-snapshot
Attribute Grammars and Mathematical Semantics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1996.0090openalex-snapshot
Symbol–Relation Grammars: A Formalism for Graphical Languages
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/3-540-10003-2_70openalex-snapshot
Formal Properties of One-Visit and Multi-Pass Attribute Grammars
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_90openalex-snapshot
Space-restricted attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_25openalex-snapshot
On defining semantics by means of extended attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_93openalex-snapshot
Attribute grammars : Theory and applications
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_37openalex-snapshot
An optimal-time recursive evaluator for attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-50820-1_51openalex-snapshot
Compiling typol with attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-53101-7_6openalex-snapshot
Parallel one-pass compilation
inferred← citeshttps://doi.org/10.1007/3-540-54572-7_1openalex-snapshot
Introduction to attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_156openalex-snapshot
Q-grammars: Results, implementation
inferred← citeshttps://doi.org/10.1007/978-1-4612-1676-6_7openalex-snapshot
Relation Grammars: A Formalism for Syntactic and Semantic Analysis of Visual Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_2openalex-snapshot
Tree Languages Generated by Context-Free Graph Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-75987-4_17openalex-snapshot
Towards Practical Typechecking for Macro Tree Transducers
inferred← citeshttps://doi.org/10.1007/978-94-011-3474-3_1openalex-snapshot
Principles of Principle-Based Parsing
inferred← citeshttps://doi.org/10.1007/bf00264472openalex-snapshot
Interpretation and reduction of attribute grammars
inferred← citeshttps://doi.org/10.1007/bf00279953openalex-snapshot
Apex graph grammars and attribute grammars
inferred← citeshttps://doi.org/10.1007/bf01178504openalex-snapshot
Context-free hypergraph grammars have the same term-generating power as attribute grammars
inferred← citeshttps://doi.org/10.1007/bf01935364openalex-snapshot
A note on one-pass evaluation of attribute grammars
inferred← citeshttps://doi.org/10.1007/bf02737108openalex-snapshot
Composition and evaluation of attribute coupled grammars
inferred← citeshttps://doi.org/10.1007/bf02915449openalex-snapshot
High level tree transducers and iterated pushdown tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0015742openalex-snapshot
Characterization of high level tree transducers
inferred← citeshttps://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/s00236-003-0120-0openalex-snapshot
A comparison of pebble tree transducers with macro 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.1016/0022-0000(82)90030-7openalex-snapshot
Simple multi-visit attribute grammars
inferred← citeshttps://doi.org/10.1016/0167-6423(85)90005-xopenalex-snapshot
A general incremental evaluator for attrbiute grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90024-xopenalex-snapshot
Attribute grammars and recursive program schemes II
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90052-6openalex-snapshot
Pushdown machines for the macro tree transducer
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90353-4openalex-snapshot
Modular tree transducers
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90191-uopenalex-snapshot
Tree transducers with external functions
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90002-8openalex-snapshot
Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming
inferred← citeshttps://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.
inferred← citeshttps://doi.org/10.1016/b978-0-444-81641-2.50026-5openalex-snapshot
Performance Specification and Measurement
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.014openalex-snapshot
Multiple context-free tree grammars: Lexicalization and characterization
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90466-6openalex-snapshot
Passes and paths of attribute grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80021-7openalex-snapshot
Tree automata and attribute grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80043-2openalex-snapshot
Machines for attribute grammars
inferred← citeshttps://doi.org/10.1109/sfcs.1980.31openalex-snapshot
On the expressive power of attribute grammars
inferred← citeshttps://doi.org/10.1109/wvl.1988.18010openalex-snapshot
A model for the specification and interpretation of visual languages
inferred← citeshttps://doi.org/10.1137/0215005openalex-snapshot
The Complexity of Languages Generated by Attribute Grammars
inferred← citeshttps://doi.org/10.1137/s0097539701394511openalex-snapshot
Macro Tree Translations of Linear Size Increase are MSO Definable
inferred← citeshttps://doi.org/10.1145/157485.165085openalex-snapshot
Performance specification using attributed grammars
inferred← citeshttps://doi.org/10.1145/76359.76366openalex-snapshot
Passes, sweeps, and visits in 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.14232/actacyb.22.2.2015.9openalex-snapshot
Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
inferred← citeshttps://doi.org/10.3233/fi-1994-2042openalex-snapshot
TOP-DOWN PARSING WITH SIMULTANEOUS EVALUATION OF NONCIRCULAR ATTRIBUTE GRAMMARS
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0683openalex-snapshot
Context-Free Grammars with Storage
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.