DFKI Research Report-92-43

[Back]

RR-92-43



Language: English

by Christoph Klauck, Jakob Mauss

A Heuristic driven Parser for Attributed Node Labeled Graph Grammars and its Application to Feature Recognition in CIM

17 Pages

Abstract

To integrate CA*-systems with other applications in the CIM world, one principal approach currently under development is the feature recognition process based on graph grammars. It enables any CIM component to recognize the higher-level entities - the so-called features - used in this component out of a lower-data exchange format, which might be the internal representation of a CAD system as well as some standard data exchange format. In this paper we present a 'made-to-measure' parsing algorithm for feature recognition. The heuristic driven chart based bottom up parser analyzes attributed node labeled graphs (representing workpieces) with a (feature-)specific attributed node labeled graph grammar (representing the feature definitions) yielding a high level (qualitative) description of the workpiece in terms of features.

This document is available as Postscript.

The next abstract is here, and the previous abstract is here.

DFKI-Bibliothek (bib@dfki.uni-kl.de)

Note: This page was written to look best with CSS stylesheet support Level 1 or higher. Since you can see this, your browser obviously doesn't support CSS, or you have turned it off. We highly recommend you use a browser that supports and uses CSS, and review this page once you do. However, don't fear, we've tried to write this page to still work and be readable without CSS.