Abstract
The “primordial soup algorithm” [Janssen et al., 1992] is a metaphor for the more abstract notion of a parsing schema. One specifies which trees can be constructed during parsing and how these can be constructed; one does not specify how these trees are to be searched for and stored.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). The primordial soup framework. In: Parsing Schemata. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60541-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-60541-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64451-1
Online ISBN: 978-3-642-60541-3
eBook Packages: Springer Book Archive