Abstract
In Chapters 3 and 4 we have formally established the notion of a parsing schema, and presented some examples. In this chapter and the next one we will discuss relations between parsing schemata.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sikkel, K. (1997). Refinement and generalization. In: Parsing Schemata. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60541-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-60541-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64451-1
Online ISBN: 978-3-642-60541-3
eBook Packages: Springer Book Archive