Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Maartje de Jonge

dblp:90/3453 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 5 · 4 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
3 papers
Compilers and program optimization · 84% Software testing · 12% Programming languages and type systems · 4%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
parsing
0.432012
Natural and Flexible Error Recovery for Generated Modular Language Environments · ACM Trans. Program. Lang. Syst. 2012
Automated evaluation of syntax error recovery · ASE 2012
Providing rapid feedback in generated modular language environments: adding error recovery to scannerless generalized-LR parsing · OOPSLA 2009
Compilers and program optimization › parsing
error recovery
0.222012
Natural and Flexible Error Recovery for Generated Modular Language Environments · ACM Trans. Program. Lang. Syst. 2012
Providing rapid feedback in generated modular language environments: adding error recovery to scannerless generalized-LR parsing · OOPSLA 2009
Compilers and program optimization › parsing
generalized LR parsing
0.112012
Natural and Flexible Error Recovery for Generated Modular Language Environments · ACM Trans. Program. Lang. Syst. 2012
Compilers and program optimization › parsing
syntax error recovery
0.112012
Automated evaluation of syntax error recovery · ASE 2012
Programming languages and type systems › grammar formalisms
context-free grammar
0.012012
Natural and Flexible Error Recovery for Generated Modular Language Environments · ACM Trans. Program. Lang. Syst. 2012
Software testing › fuzzing
mutation-based fuzzing
0.012012
Automated evaluation of syntax error recovery · ASE 2012
Software testing
test generation
0.012012
Automated evaluation of syntax error recovery · ASE 2012
Software testing
test oracle
0.012012
Automated evaluation of syntax error recovery · ASE 2012

Methods — techniques the papers use, named apart from their topics

scannerless parsing · 0.1recovery rule derivation · 0.1oracle-based evaluation · 0.1mutation-based fuzzing · 0.1island grammars · 0.1backtracking · 0.1
YearPublicationVenuePosition
2012 Automated evaluation of syntax error recovery
abstract
Evaluation of parse error recovery techniques is an open problem. The community lacks objective standards and methods to measure the quality of recovery results. This paper proposes an automated technique for recovery evaluation that offers a solution for two main problems in this area. First, a representative testset is generated by a mutation based fuzzing technique that applies knowledge about common syntax errors. Secondly, the quality of the recovery results is automatically measured using an oracle-based evaluation technique. We evaluate the validity of our approach by comparing results obtained by automated evaluation with results obtained by manual inspection. The evaluation shows a clear correspondence between our quality metric and human judgement.
Maartje de Jonge, Eelco Visser
ASE1
2012 Natural and Flexible Error Recovery for Generated Modular Language Environments
abstract
Integrated Development Environments (IDEs) increase programmer productivity, providing rapid, interactive feedback based on the syntax and semantics of a language. Unlike conventional parsing algorithms, scannerless generalized-LR parsing supports the full set of context-free grammars, which is closed under composition, and hence can parse languages composed from separate grammar modules. To apply this algorithm in an interactive environment, this article introduces a novel error recovery mechanism. Our approach is language independent, and relies on automatic derivation of recovery rules from grammars. By taking layout information into consideration it can efficiently suggest natural recovery suggestions.
Maartje de Jonge, Lennart C. L. Kats, Eelco Visser, Emma Söderberg
ACM Trans. Program. Lang. Syst.1
2011 An Algorithm for Layout Preservation in Refactoring Transformations
Maartje de Jonge, Eelco Visser
SLE1
2009 Providing rapid feedback in generated modular language environments: adding error recovery to scannerless generalized-LR parsing
abstract
Integrated development environments (IDEs) increase programmer productivity, providing rapid, interactive feedback based on the syntax and semantics of a language. A heavy burden lies on developers of new languages to provide adequate IDE support. Code generation techniques provide a viable, efficient approach to semi-automatically produce IDE plugins. Key components for the realization of plugins are the language's grammar and parser. For embedded languages and language extensions, constituent IDE plugin modules and their grammars can be combined. Unlike conventional parsing algorithms, scannerless generalized-LR parsing supports the full set of context-free grammars, which is closed under composition, and hence can parse language embeddings and extensions composed from separate grammar modules. To apply this algorithm in an interactive environment, this paper introduces a novel error recovery mechanism, which allows it to be used with files with syntax errors -- common in interactive editing. Error recovery is vital for providing rapid feedback in case of syntax errors, as most IDE services depend on the parser from syntax highlighting to semantic analysis and cross-referencing. We base our approach on the principles of island grammars, and derive permissive grammars with error recovery productions from normal SDF grammars. To cope with the added complexity of these grammars, we adapt the parser to support backtracking. We evaluate the recovery quality and performance of our approach using a set of composed languages, based on Java and Stratego.
Lennart C. L. Kats, Maartje de Jonge, Emma Nilsson-Nyman, Eelco Visser
OOPSLA2
2009 Natural and Flexible Error Recovery for Generated Parsers
Maartje de Jonge, Emma Nilsson-Nyman, Lennart C. L. Kats, Eelco Visser
SLE1