|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 listsZoology Department - Tea Talks Cambridge Next Generation Sequencing Bioinformatics Day II Conservation seminars
Other talksGroup-theoretic algorithms for matching problems with applications to computer vision. Professor Freddy Radtke - Title to be confirmed Day 2 - Corporate Finance Theory Symposium 2015 Balancing selection in Müllerian mimicry: causes and consequences South Africa 2014 Challenges and pitfalls in the application of transcranial direct-current stimulation (tDCS)