- 1k Downloads
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.
Unable to display preview. Download preview PDF.
- Villemonte de la Clergerie, Eric. 2006. Designing tabular parsers for various syntactic formalisms. ESSLLI Lecture Notes.Google Scholar
- Sikkel, Klaas. 1997. Parsing Schemata. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg, New York.Google Scholar
- Bellman, Richard 1957. Dynamic Programming. Princeton University Press.Google Scholar
- 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.Google Scholar