Abstract
There are different means of specifying a parsing algorithm. The most frequently used are a pseudo-code description of the algorithm and deduction rules.
The pseudo-code description has the advantage of being relatively close to the proper implementation. Consequently, implementing an algorithm given in pseudo-code is more or less immediate. However, the pseudo-code specification makes a lot of choices that actually do not belong to the parsing strategy of the algorithm. It introduces data structures and control structures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Villemonte de la Clergerie, Eric. 2006. Designing tabular parsers for various syntactic formalisms. ESSLLI Lecture Notes.
Gallo, G., G. Longo, S. Nguyen, and S. Pallottino. 1993. Directed Hypergraphs and Applications. Discrete Applied Mathematics, 42:177–201.
Shieber, Stuart M. 1984. Direct parsing of ID/LP grammars. Linguistics and Philosophy, 7(2):135–154.
Sikkel, Klaas. 1997. Parsing Schemata. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg, New York.
Bellman, Richard 1957. Dynamic Programming. Princeton University Press.
McAllester, David 2002. On the complexity analysis of static analyses. Journal of the ACM, 49(4):512–537.
Barton, G. Edward, Jr. 1985. The computational difficulty of ID/LP parsing. In Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics, pages 76–81, Chicago.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Kallmeyer, L. (2010). Parsing: Preliminaries. In: Parsing Beyond Context-Free Grammars. Cognitive Technologies, vol 0. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14846-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-14846-0_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14845-3
Online ISBN: 978-3-642-14846-0
eBook Packages: Computer ScienceComputer Science (R0)