![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Thursday 19 March 2009, 12:30-13:30
A Verifiable, Executable SLR Parser
- 👤 Speaker: Aditi Barthwal (The Australian National University)
- 📅 Date & Time: Thursday 19 March 2009, 12:30 - 13:30
- 📍 Venue: Computer Laboratory, William Gates Building, Room SS03
Abstract
This talk is based on one I will be presenting at the ESOP conference. In this talk, I will describe the mechanisation of an SLR parser produced by a parser generator. I will present the main properties proved about the parser, in particular, soundness: if the parser results in a parse tree on a given input, then the parse tree is valid with respect to the grammar, and the leaves of the parse tree match the input; completeness: if the input is in the language of the grammar then the parser constructs the correct parse tree for the input with respect to the grammar; and non-ambiguity: grammars successfully converted to SLR automata are unambiguous. We will also briefly have a look at the complexity introduced when providing executable versions of the algorithms involved.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room SS03
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.