@idrislang has them, too: https://github.com/idris-lang/Idris-dev/commit/180fc75336577d329d7e03a05d81f9d74c8e6000 …https://twitter.com/andreasdotorg/status/879770150475636736 …
-
-
Replying to @65thdiscord @idrislang
Ok,
@edwinbrady, I need to understand how you parse zero or more repetitions with a total function. I can only do one or more.1 reply 0 retweets 0 likes -
The type distinguishes things which definitely consume and things which might not. You can only have a recursive rule after consuming.
3 replies 0 retweets 0 likes -
Replying to @edwinbrady @andreasdotorg and
Then, grammars may be infinite but parsers are guaranteed to consume. I need to write this up, as an exercise in totality in Idris.
1 reply 0 retweets 0 likes
Replying to @edwinbrady @andreasdotorg and
The neat thing is that grammar definitions look more or less like parsec combinators. I'm boarding a plane now, so more on this later!
11:53 AM - 27 Jun 2017
0 replies
0 retweets
1 like
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.