Context-free graph grammars
From MaRDI portal
Publication:4155839
DOI10.1016/S0019-9958(78)90528-4zbMath0377.68042MaRDI QIDQ4155839
Publication date: 1978
Published in: Information and Control (Search for Journal in Brave)
Related Items
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing, Characteristics of graph languages generated by edge replacement, Power properties of NLC graph grammars with a polynomial membership problem, Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement, On the generative power of sequential and parallel programmed graph grammars, Context-free grammars as a tool for describing polynomial-time subclasses of hard problems, Graph grammars with neighbourhood-controlled embedding, Using attributed flow graph parsing to recognize clichés in programs, Graph grammars according to the type of input and manipulated data: a survey, The complexity of graph languages generated by hyperedge replacement
