scientific article; zbMATH DE number 3943061

MaRDI QIDQ3714485zbMATH OpenFDO

Authors Manfred Kaul

Publication date 1985

zbMATH Keywords

bracket mountainsconfluent graph grammarscontext-free graph grammarscontrol flow model for PROLOG-programsdata structuresdecidabilitygraph languagesimplementation with adjacency listsPascal-programsPetri-netsprecedence graph grammarsprecedence parsers for graphsprecedence relationsseries-parallel-networkswell-structured flowgraphs

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4049101
• scientific article; zbMATH DE number 3845082
• Power properties of NLC graph grammars with a polynomial membership problem
• Graph parsing as graph transformation. Correctness of predictive top-down parsers
• Generalized predictive shift-reduce parsing for hyperedge replacement graph grammars

Cited in

(24)

• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Order independent NCE grammars recognized in polynomial time
• Ambiguity and precedence in syntax description
• Hypergraph languages of bounded degree
• Logical description of context-free graph languages
• Linear graph grammars: Power and complexity
• The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
• Graph traversal and graph transformation
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3845082 (Why is no real title available?)
• scientific article; zbMATH DE number 3856437 (Why is no real title available?)
• Complexity of boundary graph languages
• Adaptive Star Grammars for Graph Models
• scientific article; zbMATH DE number 3902059 (Why is no real title available?)
• scientific article; zbMATH DE number 4043286 (Why is no real title available?)
• scientific article; zbMATH DE number 4049101 (Why is no real title available?)
• Hit ratios
• The bounded degree problem for non-obstructing eNCE graph grammars
• Node replacement in hypergraphs: simulation of hyperedge replacement, and decidability of confluence
• scientific article; zbMATH DE number 3393743 (Why is no real title available?)
• Exponential time analysis of confluent and boundary eNCE graph languages
• Nonterminal separation in graph grammars
• Boundary graph grammars with dynamic edge relabeling
• A comparison of boundary graph grammars and context-free hypergraph grammars

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714485)