|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Simple, efficient, sound-and-complete combinator parsing for all context-free grammars, using an oracle.
If you have a question about this talk, please contact Jonathan Hayman.
There are lots of problems with existing parsing tools. This talk discusses an approach to parsing without these problems. It is my take on “parsing done right”. The talk will include some fancy examples.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCentre for Family Research The Cultures of Climate Change French Linguistics Research Seminars
Other talksComputing Beatrix Potter: Defying the Enemy Isomorphisms of affine Schur algebras Stephen Langton’s Theological Questions and MS Cambridge, St. John’s College, C7 (57) African natural products Mechanism of premature cracking in jointed plain concrete pavements