A class of linearly parsable graph grammars

DOI10.1007/BF00289155zbMath0369.68040OpenAlexW2030734020MaRDI QIDQ1243139

Reinhold Franck

Publication date: 1978

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289155

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing ⋮ Power properties of NLC graph grammars with a polynomial membership problem ⋮ Predictive Top-Down Parsing for Hyperedge Replacement Grammars ⋮ Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement ⋮ Application of Attribute NCE Graph Grammars to Syntactic Editing of Tabular Forms

Cites Work

• Grammars on partial graphs
• Pair grammars, graph languages and string-to-graph translations
• Automatische Rechenplanfertigung bei programmgesteuerten Rechenmaschinen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of linearly parsable graph grammars