fmap in Applicative and Monad
While reading the Applicative section of Typeclassopedia I stumbled upon the line that said: In fact, as we will see, fmap can be implemented using the »
Reconstructing Ruby, Part 9: Memory leaks
Read Part 8 in case you missed it. Right now our ruby program is leaking memory and we should do something about it. In order to »
Reconstructing Ruby, Part 8: Make our parser reentrant
Read Part 7 in case you missed it. Reentrantcy basically means our parser doesn't use any global state. This will eventually allow us to write threaded »
Reconstructing Ruby, Part 7: Expanding our grammar
Read Part 6 in case you missed it. When we left off, we were getting a syntax error from running ./ruby program.rb. If you're up »
Reconstructing Ruby, Part 6: Getting useful syntax errors
Read Part 5 in case you missed it. We're going to start expanding our parser to better understand ruby programs. The example program we're going to »
Reconstructing Ruby, Part 5: The dreaded shift/reduce
Read Part 4 in case you missed it. Sorry for the months of silence. While this post is going to be short, I'm getting back to »
Reconstructing Ruby, Part 4: Our First Parser
Read Part 3 in case you missed it. Now that our lexer is in a pretty good situation, we can start working on our parser. We'll »
Reconstructing Ruby, Part 3: More Tokens
Please check out Part 2 if you missed it! In this post we're going to be adding a lot of tokens to our lexer. Most of »
Reconstructing Ruby, Part 2: Files and Errors
Please read Part 1 of this series if you haven't already. Before we continue, it's worth mentioning that while we're writing a lexer using Flex, Ruby »
Reconstructing Ruby, Part 1: Our First Lexer
Please read my introduction to this series to find out more about it. The first step in writing our implementation of Ruby is to create a »