Parsing graphs representing two dimensional figures
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 200-206
- https://doi.org/10.1109/wvl.1992.275764
Abstract
Generalized two dimensional context free grammars an extension of context free grammars to two dimensions, is described. This extension is a generalization of Tomita's two dimensional context free grammars (M. Tomita, 1989), and better fits into the families of graph grammars described by Crimi (1990) Relation Grammars and by Flasinski (1988) edNLC Grammars, Figure Grammars are particularly useful for applications such as handwritten mathematical expressions. A two dimensional extension of the Cocke-Kasami-Younger parser for context-free languages is used to parse figures using these grammars Author(s) Pfeiffer, J.J., Jr. Dept. of Comput. Sci., New Mexico State Univ., Las Cruces, NM, USAKeywords
This publication has 6 references indexed in Scilit:
- A generalized parser for 2-D languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient parsing of multidimensional structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Relation grammars for modelling multi-dimensional structuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Parsing of edNLC-graph grammars for scene analysisPattern Recognition, 1988
- An efficient context-free parsing algorithmCommunications of the ACM, 1970
- Recognition and parsing of context-free languages in time n3Information and Control, 1967