search

subttle / regular

Finite Automata and Regular Expressions for Regular Languages in Haskell
BSD 3-Clause "New" or "Revised" License
10 stars 1 forks source link

Changes to Config.hs #2

Open subttle opened 5 years ago

subttle commented 5 years ago

Ideally this class should require only toGraph, initial, and final functions.

subttle commented 5 years ago

Also it might be nice to make empty, epsilon, literal, fromSet, etc. into part of some class using an existential type variable for q, but perhaps this should be another separate issue.