Skip to content
0:00 / 0:00

#regularexpressions#derivativesofregularexpressions#haskell

Partial Derivatives of Regular Expressions

NYC Haskell User's Group

1.7K subscribers • 23 videos on Hallway

YouTube
  • Recommended by 1 person: 1 in engineering communities.
  • Presented by Brian Hurt
  • Linked in the descriptionbhurt/presentation

Intermediate. Assumes working knowledge.

2.6K views10 years ago1 recommendation

Computer scienceProgramming languagesAlgorithmsHaskellComputation and complexity

Brian Hurt explains how to implement regular expression matchers using the concept of regular expression derivatives in Haskell.

Brian Hurt New York Haskell Meetup (meetup.com/NY-Haskell/even...) March 23, 2016 Slides: github.com/bhurt/presentation... Brian Hurt explains a different approach, with a number of advantages, to implementing regular expressions. Despite the title, no math is actually required- so if you don't remember calculus (or never took it), that's OK. A pragmatic understanding of regular expressions is assumed however.

Why it's here

1 person recommends this

u/mightybytein r/haskell • Recommends

NYHUG Partial Derivatives of Regular Expressions

u/recursion-ninjain r/haskell • Mentions

On “Matching Typeclasses to Chomsky Hierarchy”

I would assume you can consume a structure `( Foldable t, Functor t) => t a` after you construct an efficient DFA from the `Functor` instance using the method described by Brian Hurt here: link to this video