Automatic Grammar Repair
summary
Automatic system repairs context-free grammars by localizing symbol-level faults using spectrum-based fault localization, generating small string-edit patches checked by explicit pre/post-conditions, and validating candidates against test-suite bigrams and parse outcomes. Implemented as gfixr, it fixes 9 of 10 student grammars and maps an ANTLR Pascal grammar to a CUP variant after 11 iterations and 317 candidate variants. Supports substitutions, deletions and restricted patches that reduce permissiveness.
AI-written summary · about
chapters (7)
- 0:00Start
- 0:08Grammars are software. Software contains bugs.
- 5:18Grammar patches via symbol string edit operations (cont.)
- 6:23Grammar patches via symbol string edit operations cont.
- 7:44Automatic grammar repair is useful whenever we have a "reasonable" initial grammar and driving examples.
- 8:21Repairing student grammars
- 10:34Repairing Pascal types from ANTLR to CUP
related talks
59mAutomatic Grammar Repair
15mAn Interactive Feedback System for Grammar Development (Tool Paper)
20mAutomatic Repair of Regular Expressions
04mFTFY: Research advances in automatic bug repair
29mGrammar Inference for Ad Hoc Parsers
24mAutomated extraction of grammar optimization rule configurations in a metamodel-gr...
15mDetecting and explaining (in-)equivalence of context-free grammars
16mWe’ve Got You Covered: Type-Guided Repair of Incomplete Input Generators
