Deriving tolerant grammars from a base-line grammar

Authors

Steven Klusener and Ralf Lämmel

Abstract

A grammar-based approach to tool development in re- and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considerable up-front investment to obtain a grammar for a relevant language or cocktail of languages. Existing work on grammar recovery addresses this concern to some extent. Secondly, it is often not feasible to insist on a precise grammar, e.g., when different dialects need to be covered. This calls for tolerant grammars.

In this paper, we provide a well-engineered approach to the derivation of tolerant grammars, which is based on previous work on error recovery, fuzzy parsing, and island grammars. The technology of this paper has been used in a complex Cobol restructuring project on several millions of lines of code in different Cobol dialects.

Our approach is founded on an approximation relation between a tolerant grammar and a base-line grammar which serves as a point of reference. Thereby, we avoid false positives and false negatives when parsing constructs of interest in a tolerant mode. Our approach accomplishes the effective derivation of a tolerant grammar from the syntactical structure that is relevant for a certain re- or reverse engineering tool. To this end, the productions for the constructs of interest are reused from the base-line grammar together with further productions that are needed for completion.

Download

[.ps], [.pdf]

Bibtex entry

@inproceedings{KL03-CTP,
 author      = "S.~Klusener and R.~L{\"a}mmel",
 title       = "{Deriving tolerant grammars from a base-line grammar}",
 booktitle   = "{Proc.\ International Conference on Software Maintenance (ICSM'03)}",
 publisher   = "IEEE Computer Society Press",
 year        = 2003,
 month       = sep,
 note        = "10 pages; To appear"
}