Language-parametric Techniques for Language-Specific Editors
M. De Jonge
- 29 Jan 2014
TL;DR: This dissertation investigates generic techniques to recover from syntax errors that occur during interactive editing and language-parametric techniques for the implementation of refactoring tools.
read more
Abstract: The goal of this dissertation is to develop techniques that simplify the implementation of tool support for new languages. More specifically, we focus on language-parametric solutions for the implementation of language-specific editor support. In the first part of this dissertation we investigate generic techniques to recover from syntax errors that occur during interactive editing. In the second part we look into language-parametric techniques for the implementation of refactoring tools.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Spoofax language workbench rules for declarative specification of languages and IDEs
Lennart C. L. Kats,Eelco Visser +1 more
- 31 Dec 2010
TL;DR: Spoofax as mentioned in this paper is a language workbench for efficient, agile development of textual domain-specific languages with state-of-the-art IDE support, integrating language processing techniques for parser generation, meta-programming, and IDE development into a single environment.
Substring Parsing for Arbitrary Context-Free Grammars
Jan Rekers,Wilco Koorn +1 more
- 13 Feb 1991
TL;DR: A substring parser is obtained that can be used in a syntax-directed editor to complete fragments of sentences and is useful for noncorrecting syntax error recovery and for incremental parsing.
22
•Journal Article
Disambiguation filters for scannerless generalized LR parsers
TL;DR: In this paper, the authors present the fusion of generalized LR parsing and scannerless parsing, which supports syntax definitions in which all aspects (lexical and context-free) of the syntax of a language are defined explicitly in one formalism.
13
Pure and declarative syntax definition : Paradise lost and regained
Lennart C. L. Kats,Eelco Visser,Guido Wachsmuth +2 more
- 31 Dec 2010
TL;DR: This paper analyzed how these problems arise for different aspects of syntax definitions, discussed their consequences for language engineers, and showed how the pure and declarative nature of syntax definition can be regained.
References
•Book
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft,Rajeev Motwani,Rotwani,Jeffrey D. Ullman +3 more
- 01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
14.5K
On the translation of languages from left to right
TL;DR: LR(k) grammars are defined, which are perhaps the most general ones of this type, and they provide the basis for understanding all of the special tricks which have been used in the construction of parsing algorithms for languages with simple structure, e.g. algebraic languages.
889
ANTLR: a predicated- LL(k) parser generator
Terence Parr,Russell W. Quong +1 more
TL;DR: ANTLR is introduced, a public‐domain parser generator that combines the flexibility of hand‐coded parsing with the convenience of a parser generator, which is a component of PCCTS.
753