Top-down parsers make their predictions in pre-order, in which the parent nodes are identified before any of their children, and which imitates leftmost derivations (see Section 6.1); bottom-up parsers perform their reductions in post-order, in which the parent nodes are identified after all of their children have been identified, and which imitates rightmost derivation (see the introduction in Chapter 7). These two orders of producing and visiting trees are called “canonical”, and so are the parsing techniques that follow them.
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
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Grune, D., Jacobs, C.J.H. (2008). Non-Canonical Parsers. In: Parsing Techniques. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68954-8_10
Download citation
DOI: https://doi.org/10.1007/978-0-387-68954-8_10
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-20248-8
Online ISBN: 978-0-387-68954-8
eBook Packages: Computer ScienceComputer Science (R0)