Decorating tokens to facilitate recognition of ambiguous language constructs
- 12 November 2002
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 33 (1) , 19-39
Abstract
Software tools are fundamental to the comprehension, analysis, testing and debugging of application systems. A necessary first step in the development of many tools is the construction of a parser front‐end that can recognize the implementation language of the system under development. In this paper, we describe our use of token decoration to facilitate recognition of ambiguous language constructs. We apply our approach to the C++ language since its grammar is replete with ambiguous derivations such as the declaration/expression and template‐declaration/expression ambiguity. We describe our implementation of a parser front‐end for C++, keystone, and we describe our results in decorating tokens for our test suite including the examples from Clause Three of the C++ standard. We are currently exploiting the keystone front‐end to develop a taxonomy for implementation‐based class testing and to reverse‐engineer Unified Modeling Language (UML) class diagrams. Copyright © 2002 John Wiley & Sons, Ltd.Keywords
This publication has 8 references indexed in Scilit:
- Even faster generalized LR parsingActa Informatica, 2001
- Symbol table construction and name lookup in ISO C++2000
- Metric-based analysis of context-free grammars2000
- Why are we using Java again?Communications of the ACM, 1998
- The Java factorCommunications of the ACM, 1998
- Quest for JavaCommunications of the ACM, 1998
- Incremental analysis of real programming languages1997
- Flexible symbol table structures for compiling C++Software: Practice and Experience, 1987