Apex graph grammars and attribute grammars
From MaRDI portal
Publication:1112623
zbMath0659.68096MaRDI QIDQ1112623
George Leih, Grzegorz Rozenberg, Joost Engelfriet
Publication date: 1988
Published in: Acta Informatica (Search for Journal in Brave)
rewritingcontext-free languagesapex graphattribute dependency graph grammarsdirected node-label controlledReplacements
Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (16)
Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ A hierarchy of eNCE families of graph languages ⋮ Boundary graph grammars with dynamic edge relabeling ⋮ On the structure of linear apex NLC graph grammars ⋮ A comparison of boundary graph grammars and context-free hypergraph grammars ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ Quasi-rocking real-time pushdown automata ⋮ Graph grammars according to the type of input and manipulated data: a survey ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ Finite graph automata for linear and boundary graph languages ⋮ Separation results for separated apex NLC and NCE graph languages ⋮ A Greibach normal form for context-free graph grammars ⋮ Linear graph grammars: Power and complexity ⋮ Double Greibach operator grammars ⋮ Nonterminal separation in graph grammars ⋮ Separating \(k\)-separated eNCE graph languages
This page was built for publication: Apex graph grammars and attribute grammars
