University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Simple, efficient, sound-and-complete combinator parsing for all context-free grammars, using an oracle.

Simple, efficient, sound-and-complete combinator parsing for all context-free grammars, using an oracle.

Add to your list(s) Download to your calendar using vCal

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2014 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity