Wed 17 Jun 2015 16:25 - 16:50 at PLDI Main RED (Portland 256) - Potpourri Chair(s): Tiark Rompf

Writing a parser remains remarkably painful. Automatic parser generators offer a powerful and systematic way to parse complex grammars, but debugging conflicts in grammars can be time-consuming even for experienced language designers. Better tools for diagnosing parsing conflicts will alleviate this difficulty. This paper proposes a practical algorithm that generates compact, helpful counterexamples for LALR grammars. For each parsing conflict in a grammar, a counterexample demonstrating the conflict is constructed. When the grammar in question is ambiguous, the algorithm usually generates a compact counterexample illustrating the ambiguity. This algorithm has been implemented as an extension to the CUP parser generator. The results from applying this implementation to a diverse collection of faulty grammars show that the algorithm is practical, effective, and suitable for inclusion in other LALR parser generators.

Wed 17 Jun
Times are displayed in time zone: Tijuana, Baja California change

16:00 - 17:40: PotpourriResearch Papers at PLDI Main RED (Portland 256)
Chair(s): Tiark RompfPurdue & Oracle Labs
16:00 - 16:25
Talk
Research Papers
Stefan MarrInria, France, Chris SeatonOracle Labs / University of Manchester, Stéphane Ducasse INRIA Lille
Media Attached
16:25 - 16:50
Talk
Research Papers
Media Attached
16:50 - 17:15
Talk
Research Papers
Alan LeungUniversity of California, San Diego, John SarracinoUniversity of California, San Diego, Sorin LernerUniversity of California, San Diego
Media Attached
17:15 - 17:40
Talk
Research Papers
Brandon LuciaCarnegie Mellon University, Benjamin RansfordUniversity of Washington
Media Attached