I always loved this article by Neelakantan Krishnaswami about using Antimorov derivatives to create simple DFAs for matching regular expressions:
http://semantic-domain.blogspot.co.uk/2013/11/antimirov-derivatives-for-regular.html
The code is wonderfully simple but only works for acyclic problems like regular expressions.
Matt Might published an interesting post that extends the concept of derivatives to allow grammars to be parsed (2011):
http://matt.might.net/papers/might2011derivatives.pdf
To date I have failed to translate these solutions into an ML but I wonder what they would look like and, in particular, if this really is a pragmatic approach.
To date I have failed to translate these solutions into an ML but I wonder what they would look like and, in particular, if this really is a pragmatic approach to parsing.
There is a follow up work from Matt Might's group:
I think a version of this was published in PLDI 2016.--
You received this message because you are subscribed to the Google Groups "Pragmatic functional programming research" group.
To unsubscribe from this group and stop receiving emails from it, send an email to pragmatic-functional-progr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.