On the public citation graph

Modelling compiler generation by graph grammars

https://doi.org/10.1007/bfb0000105
0 signed · 17 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/bf01692511openalex-snapshot
Semantics of context-free languages
inferredcites →https://doi.org/10.1007/bfb0025714openalex-snapshot
Introduction to the algebraic theory of graph grammars (a survey)
inferredcites →https://doi.org/10.1007/bfb0034297openalex-snapshot
GAG: A Practical Compiler Generator
inferredcites →https://doi.org/10.1093/comjnl/26.2.142openalex-snapshot
Extended Attribute Grammars
inferredcites →https://doi.org/10.1137/0209034openalex-snapshot
The Mathematics of Record Handling
inferredcites →https://doi.org/10.7146/dpb.v10i105.6520openalex-snapshot
Extended 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/3-540-18771-5_63openalex-snapshot
Is parallelism already concurrency? Part 1: Derivations in graph grammars
inferred← citeshttps://doi.org/10.1007/978-3-030-51372-6_13openalex-snapshot
Graph Parsing as Graph Transformation
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/bfb0000123openalex-snapshot
On graph rewriting systems (Graph-Grammars)
inferred← citeshttps://doi.org/10.1007/bfb0017398openalex-snapshot
The term generating power of context-free hypergraph grammars
inferred← citeshttps://doi.org/10.1016/0306-4379(87)90026-3openalex-snapshot
An architecture for processing graph-grammar applications
inferred← citeshttps://doi.org/10.1016/1045-926x(92)90012-bopenalex-snapshot
Visual concurrent programming with Δ-grammars
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00226-6openalex-snapshot
Generating irregular partitionable data structures
inferred← citeshttps://doi.org/10.1145/1072997.1073000openalex-snapshot
Toward an engineering discipline for grammarware
inferred← citeshttps://doi.org/10.21936/si2011_v32.n4b.129openalex-snapshot
Projektowanie wizualne z wykorzystaniem hierarchicznych hipergrafów
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.