Shape grammar compilers

Thomas C. Henderson, Ashok Samal

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

Compiler generation tools have been used quite successfully to produce parsers for certain classes of string grammars. Such techniques can also be applied to the development of syntactic shape parsers. We present a generalization of LR parsing to shape grammars based on the use of geometrical relations between the symbols. The components of this approach are: 1. (1) a grammar for defining classes of 2-D and 3-D shapes, 2. (2) a shape grammar compiler which produces a tabular representation of the explicit and implicit constraints between the parts of the shape, 3. (3) and a general parsing mechanism which uses these tables of constraints to perform the analysis of unknown shapes.

Original languageEnglish (US)
Pages (from-to)279-288
Number of pages10
JournalPattern Recognition
Volume19
Issue number4
DOIs
Publication statusPublished - 1986

    Fingerprint

Keywords

  • Compiler generation
  • Constraint techniques
  • Shape analysis
  • Syntactic methods

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this