Sciweavers

Share
PLDI
1997
ACM

Incremental Analysis of real Programming Languages

11 years 2 months ago
Incremental Analysis of real Programming Languages
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequate; in particular, LR(k) grammars are unable to describe the natural syntax of many languages, such as C++ and Fortran, which are inherently non-deterministic. Designers of batch compilers work around such limitations by combining generated components with ad hoc techniques (for instance, performing partial type and scope analysis in tandem with parsing). Unfortunately, the complexity of incremental systems precludes the use of batch solutions. The inability to generate incremental tools for important languages inhibits the widespread use of language-rich interactive environments. We address this problem by extending the language model itself, introducing a program representation based on parse dags that is suitable for both batch and incremental analysis. Ambiguities unresolved by one stage are retained in th...
Tim A. Wagner, Susan L. Graham
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where PLDI
Authors Tim A. Wagner, Susan L. Graham
Comments (0)
books