A language independent task engine for incremental name and type analysis

A language independent task engine for incremental name and type analysis

Wachsmuth, G.H.
Konat, G.D.P.
Vergu, V.A.
Groenewegen, D.M.
Visser, E.

Electrical Engineering, Mathematics and Computer Science

Software Computer Technology

2013-10-31

This paper is a pre-print of: Guido H. Wachsmuth, Gabriel D.P. Konat, Vlad A. Vergu, Danny M. Groenewegen, Eelco Visser. A Language Independent Task Engine for Incremental Name and Type Analysis. In: Martin Erwig, Richard F. Paige, Eric Van Wyk, editors, Software Language Engineering, Sixth International Conference, SLE 2013, Indianapolis, USA, October, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8225, Springer Verlag 2013. Doi: 10.1007/978-3-319-02654-1_15 DEs depend on incremental name and type analysis for responsive feedback for large projects. In this paper, we present a language-independent approach for incremental name and type analysis. Analysis consists of two phases. The first phase analyzes lexical scopes and binding instances and creates deferred analysis tasks. A task captures a single name resolution or type analysis step. Tasks might depend on other tasks and are evaluated in the second phase. Incrementality is supported on file and task level. When a file changes, only this file is recollected and only those tasks are reevaluated, which are affected by the changes in the collected data. The analysis does neither re-parse nor re-traverse unchanged files, even if they are affected by changes in other files. We implemented the approach as part of the Spoofax Language Workbench and evaluated it for the WebDSL web programming language.

http://resolver.tudelft.nl/uuid:c5fe92ea-65be-4b0c-88c7-1c3f341ab403

Delft University of Technology, Software Engineering Research Group

2014-10-31

1872-5392

Technical Report Series TUD-SERG-2013-014

Institutional Repository

lecture notes

(c) 2013 The authors
Springer