Documents

  • p163-amorim

    Final published version, 837 KB, PDF-document

DOI

Principled syntactic code completion enables developers to change source code by inserting code templates, thus increasing developer efficiency and supporting language exploration. However, existing code completion systems are ad-hoc and neither complete nor sound. They are not complete and only provide few code templates for selected programming languages. They also are not sound and propose code templates that yield invalid programs when inserted. This paper presents a generic framework that automatically derives complete and sound syntactic code completion from the syntax definition of arbitrary languages. A key insight of our work is to provide an explicit syntactic representation for incomplete programs using placeholders. This enables us to address the following challenges for code completion separately: (i) completing incomplete programs by replacing placeholders with code templates, (ii) injecting placeholders into complete programs to make them incomplete, and (iii) introducing lexemes and placeholders into incorrect programs through error-recovery parsing to make them correct so we can apply one of the previous strategies. We formalize our framework and provide an implementation in Spoofax.

Original languageEnglish
Title of host publicationProceedings of the 2016 ACM SIGPLAN International Conference on Software Language Engineering, co-located with SPLASH 2016
EditorsD. Varro, E. Balland, T. van der Storm
Place of PublicationNew York, NY
PublisherAssociation for Computing Machinery (ACM)
Pages163-175
Number of pages13
ISBN (Electronic)978-1-4503-4447-0
DOIs
StatePublished - 20 Oct 2016
EventSLE 2016 - Amsterdam, Netherlands

Conference

ConferenceSLE 2016
CountryNetherlands
CityAmsterdam
Period31/10/161/11/16

    Research areas

  • Code completion, Ides, Language workbenches

ID: 10021961