Reading Words in Graphs Generated by Hyperedge Replacement

Frank Drewes () and Hans-Jörg Kreowski ()
Additional contact information
Frank Drewes: University of Bremen, Department of Computer Science
Hans-Jörg Kreowski: University of Bremen

Chapter Chapter 22 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 243-252 from Springer

Abstract: Abstract The context-free syntax of programming languages like Pascal and Modula is often defined by means of syntax diagrams in a quite intuitive way. The syntactically correct programs are obtained by reading words along paths in syntax diagrams in a certain way. In this paper, we interpret hyperedge replacement graph languages as sets of syntax diagrams and investigate the string languages definable in this way.

Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_22

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().