Abstract
A context-free grammar specifies a set of words, and for each of these words one or more derivation trees. Such a tree represents the (or a) hierarchical structure of the corresponding word and is the input of algorithms like those used in a compiler.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B. (1999). Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_7
Download citation
DOI: https://doi.org/10.1007/3-540-48685-2_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66201-3
Online ISBN: 978-3-540-48685-5
eBook Packages: Springer Book Archive