Abstract
In pictorial LR parsing it is always difficult to establish from which point of a picture the parsing process has to start. This paper introduces an algorithm that allows any element of the input to be considered as the starting one and, at the same time, assures that the parsing process is not compromised. The algorithm is first described on string grammars seen as a subclass of pictorial grammars and then adapted to the two-dimensional case. The extensions to generalized LR parsing and pictorial generalized LR parsing are immediate.- Anthology ID:
- 1993.iwpt-1.6
- Volume:
- Proceedings of the Third International Workshop on Parsing Technologies
- Month:
- August 10-13
- Year:
- 1993
- Address:
- Tilburg, Netherlands and Durbuy, Belgium
- Editors:
- Harry Bunt, Robert Berwick, Ken Church, Aravind Joshi, Ronald Kaplan, Martin Kay, Bernard Lang, Makoto Nagao, Anton Nijholt, Mark Steedman, Henry Thompson, Masaru Tomita, K. Vijay-Shanker, Yorick Wilks, Kent Wittenburg
- Venue:
- IWPT
- SIG:
- SIGPARSE
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 49–60
- Language:
- URL:
- https://aclanthology.org/1993.iwpt-1.6
- DOI:
- Cite (ACL):
- Gennaro Costagliola. 1993. (Pictorial) LR Parsing from an Arbitrary Starting Point. In Proceedings of the Third International Workshop on Parsing Technologies, pages 49–60, Tilburg, Netherlands and Durbuy, Belgium. Association for Computational Linguistics.
- Cite (Informal):
- (Pictorial) LR Parsing from an Arbitrary Starting Point (Costagliola, IWPT 1993)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-4/1993.iwpt-1.6.pdf