Anyone knows of a general algorithm to transform monadic parsers into a state machine? cc /@markhibberd
-
-
@dibblego@markhibberd the idea is to see if we can make it faster by "compiling" it to a state machine as you would do to optimise manually -
@dibblego See also#haskell.au /@etorreborre
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.