Abstract
In the previous chapters we have discussed how parsing schemata can be instantiated to parsing algorithms of various kinds. Such algorithms can be coded into programming languages and then executed on a computer system.
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). Boolean circuit parsing. In: Parsing Schemata. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60541-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-60541-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64451-1
Online ISBN: 978-3-642-60541-3
eBook Packages: Springer Book Archive