Write a Blog >>
SLE 2019
Sun 20 - Fri 25 October 2019 Athens, Greece
co-located with SPLASH 2019
Mon 21 Oct 2019 16:30 - 16:50 at Templars - Session 4: Parsing Chair(s): Adrian Johnstone

Grammar-based test case generation has focused almost exclusively on generating syntactically correct programs (i.e., positive tests) from a reference grammar but a positive reference test suite cannot detect when the unit under test accepts words outside the language (i.e., false positives). Here, we investigate the converse problem and describe two mutation-based approaches for generating programs with guaranteed syntax errors (i.e., negative tests). Word mutation systematically modifies positive tests by deleting, inserting, substituting, and transposing tokens in such a way that at least one impossible token pair emerges. Rule mutation applies such operations to the symbols of the right-hand sides of productions in such a way that each derivation that uses the mutated rule yields a word outside the language.

Mon 21 Oct

Displayed time zone: Beirut change

16:00 - 17:30
Session 4: ParsingSLE 2019 at Templars
Chair(s): Adrian Johnstone Royal Holloway, University of London
Multiple Lexicalisation - A Java Based Study
SLE 2019
Elizabeth Scott Royal Holloway University of London, Adrian Johnstone Royal Holloway, University of London
Breaking Parsers: Mutation-based Generation of Programs with Guaranteed Syntax ErrorsNEW IDEABest Paper
SLE 2019
Moeketsi Raselimo Stellenbosch University, Jan Taljaard Stellenbosch University, Bernd Fischer Stellenbosch University
Default disambiguation for online parsers
SLE 2019
Lukas Diekmann King's College London, Laurence Tratt King's College London
DOI Pre-print