Abstract
Syntax describes the structure of language. A well-formed sentence can be broken down into constituents, according to syntactic rules. A constituent that covers more than a single word can be broken down into smaller constituents, and so on. In this way one can obtain a complete, hierarchical description of the syntactic structure of a sentence. A computer program that attributes such structures to sentences is called a parser. This book is about parsers, and our1 particular concern is how such parsers can be described in an abstract, schematic way.
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). Introduction. In: Parsing Schemata. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60541-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-60541-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64451-1
Online ISBN: 978-3-642-60541-3
eBook Packages: Springer Book Archive