Description

Compiler techniques are effective and efficient in processing textual programming languages. These techniques can be adapted to recognition and processing of two-dimensional languages (diagrams). Already, grammars and parsers have been used in a variety of diagram-recognition and diagram-processing tasks. Here we explore the use of two other compiler-style use of trees and tree transformation. The second is a multi-pass control structure, with a clear separation between layout, lexical, syntactic, and semantic analysis. Our proposal is illustrated on a case study involving recognition of hand-drawn mathematics notation.

Date of creation, presentation, or exhibit

2002

Comments

©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Document Type

Conference Proceeding

Department, Program, or Center

Computer Science (GCCIS)

Campus

RIT – Main Campus

Share

COinS