On the public citation graph

Interpretation and reduction of attribute grammars

https://doi.org/10.1007/bf00264472
0 signed · 34 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-10003-2_70openalex-snapshot
Formal Properties of One-Visit and Multi-Pass Attribute Grammars
inferredcites →https://doi.org/10.1007/3-540-10003-2_97openalex-snapshot
Grammatical families
inferredcites →https://doi.org/10.1007/3-540-10233-7openalex-snapshot
Grammar and L forms: An introduction
inferredcites →https://doi.org/10.1007/3-540-10843-2_16openalex-snapshot
Passes, sweeps and visits
inferredcites →https://doi.org/10.1007/978-3-662-21545-6_28openalex-snapshot
Context-Free Grammar Forms
inferredcites →https://doi.org/10.1007/bf00264495openalex-snapshot
A characterization of attribute evaluation in passes
inferredcites →https://doi.org/10.1007/bf00289307openalex-snapshot
The formal power of one-visit attribute grammars
inferredcites →https://doi.org/10.1007/bf00995501openalex-snapshot
Semantic equivalence of covering attribute grammars
inferredcites →https://doi.org/10.1007/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bf01786970openalex-snapshot
k-visit attribute grammars
inferredcites →https://doi.org/10.1016/0022-0000(82)90030-7openalex-snapshot
Simple multi-visit attribute grammars
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(70)90446-8openalex-snapshot
Properties of deterministic top-down grammars
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(81)90466-6openalex-snapshot
Passes and paths of attribute grammars
inferredcites →https://doi.org/10.1016/s0022-0000(75)80051-1openalex-snapshot
Context-free grammar forms
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/1008861.1008863openalex-snapshot
Review of "Introduction to automata theory, languages and computation" by John E. Hopcroft and Jeffrey D. Ullman. Addison-Wesley 1979.
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.v9i114.6532openalex-snapshot
Subclasses of Attribute Grammars

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-51709-9_5openalex-snapshot
Anhang
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/bf02737108openalex-snapshot
Composition and evaluation of attribute coupled grammars
inferred← citeshttps://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1007/bfb0019356openalex-snapshot
Toward knowledge-based specifications of languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80043-2openalex-snapshot
Machines for attribute grammars
inferred← citeshttps://doi.org/10.1109/32.60293openalex-snapshot
Automating visual language generation
inferred← citeshttps://doi.org/10.1109/wvl.1988.18011openalex-snapshot
A tree systems inference algorithm for an iconic environment
inferred← citeshttps://doi.org/10.1109/wvl.1988.18014openalex-snapshot
The design of a visual language compiler
inferred← citeshttps://doi.org/10.1137/0215005openalex-snapshot
The Complexity of Languages Generated by Attribute Grammars
inferred← citeshttps://doi.org/10.1145/70642.70645openalex-snapshot
The complexity of the circularity problem for attribute grammars: a note on a counterexample for a simpler construction
inferred← citeshttps://doi.org/10.1145/76359.76366openalex-snapshot
Passes, sweeps, and visits in attribute grammars
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.