Version: 5.1.1

F*dging up a Racket

Danny Yoo <dyoo@cs.wpi.edu>

1 Introduction

If people say that Racket is just a Scheme, they are short-selling Racket a little. It’s more accurate to say that Racket is a language laboratory, with support for many different languages.

Is that really true? Racket does include a nice macro system, which allows a programmer to add in new language constructs. For example, we can get while loops into Racket with relative ease:

racket ( define-syntax-rule ( while test body ... ) ( let loop ( ) ( when test body ... ( loop ) ) ) ) ;; From this point forward, we've got while loops. ( while ( not ( string=? ( read-line ) "quit" ) ) ( printf "never going to give you up

" ) ( printf "never going to let you down

" ) )

So we can certainly extend the language. But this still looks just like a Scheme.

Let’s take a closer look at a Racket program. Every Racket program begins with a funny line at the very top that, on first glance, looks redundant:

Why in the world does a Racket program need to say that it’s a Racket program? Isn’t that obvious?

We can understand the situation better by looking at another environment on our desktop, namely the web browser. A web browser supports different kinds of HTML variants, since HTML is a moving target, and browsers have come up with crazy rules for figuring out how to take an arbitrary document and decide what HTML parsing rules to apply to it.

HTML 5 tries to make this determination somewhat more straightforward: we can define an HTML 5 document by putting a DOCTYPE element at the very top of the file which self-describes the document as being html.

<!DOCTYPE html> <html lang="en"> <head><title>Hello world</title></head> <body><p>Hello world!</p></body> </html>

Going back to the world of Racket, we see by analogy that the #lang line in a Racket program is a self-description of how to treat the rest of the program. (Actually, the #lang line is quite bit more active than this, but we’ll get to this in a moment.)

#lang line isn’t inevitable: the main Racket distribution, in fact, comes bundled with several languages which can take the place of the word typed/racket , The racket part in theline isn’t inevitable: the main Racket distribution, in fact, comes bundled with several languages which can take the place of the word racket . Many of these languages ( racket/base lazy ) still look like Racket... but some of them don’t. Here’s one example:

This is an example of a Datalog program that deals with logical relations. Neat!

What might be surprising is that the mechanism for using different languages in Racket is wide open. Let’s expand our minds.

This language does not look like Racket. It looks like line noise. This is brainf*ck . Although this language is not included in the main distribution, because it is on PLaneT , anyone with Racket can easily play with it.

Ignoring the question of why?!! someone would do this, let’s ask another: how do we build this? This tutorial will cover how to build this language into Racket from scratch.

Let’s get started!

2 The view from high orbit

We want to teach Racket what it means when we say something like:

As mentioned earlier, a #lang line is quite active: it tells the Racket runtime how to convert from the surface syntax to an meaningful program. Programs in Racket get digested in a few stages; the process looks something like this:

reader macro expansion surface syntax ---------> AST -----------------> core forms

When Racket sees #lang planet dyoo/bf, it will look for a particular module that we call a reader; a reader consumes surface syntax and excretes ASTs, and these ASTs are then annotated so that Racket knows how to make sense out of them later on. At this point, the rest of the Racket infrastructure kicks in and macro-expands the ASTs out, ultimately, to a core language.

So here’s what we’ll do:

Capture the meaning of brainf*ck by writing a semantics module.

Go from the line noise of the surface syntax into a more structured form by writing a parser module.

Connect the pieces, the semantics and the surface syntax parser, by making a reader module.

Profit!

3 Flight preparations

Since we’re starting from scratch, let’s first make a work directory where we’ll keep our source code. I’ll call the directory "bf/" , but you can use whatever name you want.

$ mkdir bf

Ultimately, we want to put the fruit of our labor onto PLaneT, since that’ll make it easier for others to use our work. Let’s set up a PLaneT development link so the Racket environment knows about our work directory. I already have an account on PLaneT with my username dyoo. You can get an account fairly easily.

If we enter the following at the command line,

$ planet link dyoo bf.plt 1 0 bf

( planet dyoo/bf/... ) to our local "bf/" directory. Later on, when we create a package and upload it to PLaneT, we can drop this development link, and then all the references that use ( planet dyoo/bf/... ) will immediately switch over to the one on the PLaneT server. we’ll make a development link that will associate any module path of the formto our localdirectory. Later on, when we create a package and upload it to PLaneT, we can drop this development link, and then all the references that usewill immediately switch over to the one on the PLaneT server.

But does the link actually work? Let’s write a very simple module in our work directory, and then see that Racket can find it through PLaneT.

$ cd bf ~/bf$ cat >hello.rkt #lang racket "hello world"

Ok, let’s see if Racket can find our magnificant "hello.rkt" module if we use the PLaneTized version of the name.

~/bf$ racket Welcome to Racket v5.1.1. > (require (planet dyoo/bf/hello)) "hello world" >

If we get to this point, then we’ve got the PLaneT development link in place.

4 The brainf*ck language

When we look at the definition of brainf*ck , it’s actually not too bad. There’s two bits of state,

a byte array of data, and

a pointer into that data array

and it has only a few operations that affect this state:

Increment the data pointer (>)

Decrement the data pointer (<)

Increment the byte at the data pointer (+)

Decrement the byte at the data pointer (-)

Write a byte to standard output (.)

Read a byte from standard input (,)

Perform a loop until the byte at the data pointer is zero ([, ])

Let’s write a module that lets us play with such a system: let’s call it "semantics.rkt" .

"semantics.rkt" racket ( require rackunit ) ;; for unit testing ( provide ( all-defined-out ) ) ;; Our state contains two pieces. ( define-struct state ( data ptr ) #:mutable ) ;; Creates a new state, with a byte array of 30000 zeros, and ;; the pointer at index 0. ( define ( new-state ) ( make-state ( make-vector 30000 0 ) 0 ) ) ;; increment the data pointer ( define ( increment-ptr a-state ) ( set-state-ptr! a-state ( add1 ( state-ptr a-state ) ) ) ) ;; decrement the data pointer ( define ( decrement-ptr a-state ) ( set-state-ptr! a-state ( sub1 ( state-ptr a-state ) ) ) ) ;; increment the byte at the data pointer ( define ( increment-byte a-state ) ( let ( [ v ( state-data a-state ) ] [ i ( state-ptr a-state ) ] ) ( vector-set! v i ( add1 ( vector-ref v i ) ) ) ) ) ;; decrement the byte at the data pointer ( define ( decrement-byte a-state ) ( let ( [ v ( state-data a-state ) ] [ i ( state-ptr a-state ) ] ) ( vector-set! v i ( sub1 ( vector-ref v i ) ) ) ) ) ;; print the byte at the data pointer ( define ( write-byte-to-stdout a-state ) ( let ( [ v ( state-data a-state ) ] [ i ( state-ptr a-state ) ] ) ( write-byte ( vector-ref v i ) ( current-output-port ) ) ) ) ;; read a byte from stdin into the data pointer ( define ( read-byte-from-stdin a-state ) ( let ( [ v ( state-data a-state ) ] [ i ( state-ptr a-state ) ] ) ( vector-set! v i ( read-byte ( current-input-port ) ) ) ) ) ;; we know how to do loops! ( define-syntax-rule ( loop a-state body ... ) ( let loop ( ) ( unless ( = ( vector-ref ( state-data a-state ) ( state-ptr a-state ) ) 0 ) body ... ( loop ) ) ) )

Ok, that doesn’t seem too bad. But of course, we should test this; let’s use the "rackunit" unit testing framework and tickle this code. Let’s add a little more to the end of "semantics.rkt" .

"semantics.rkt" ;; Simple exercises. ( let ( [ s ( new-state ) ] ) ( increment-byte s ) ( check-equal? 1 ( vector-ref ( state-data s ) 0 ) ) ( increment-byte s ) ( check-equal? 2 ( vector-ref ( state-data s ) 0 ) ) ( decrement-byte s ) ( check-equal? 1 ( vector-ref ( state-data s ) 0 ) ) ) ;; pointer movement ( let ( [ s ( new-state ) ] ) ( increment-ptr s ) ( increment-byte s ) ( check-equal? 0 ( vector-ref ( state-data s ) 0 ) ) ( check-equal? 1 ( vector-ref ( state-data s ) 1 ) ) ( decrement-ptr s ) ( increment-byte s ) ( check-equal? 1 ( vector-ref ( state-data s ) 0 ) ) ( check-equal? 1 ( vector-ref ( state-data s ) 1 ) ) ) ;; make sure standard input is doing something ( let ( [ s ( new-state ) ] ) ( parameterize ( [ current-input-port ( open-input-bytes ( bytes 3 1 4 ) ) ] ) ( read-byte-from-stdin s ) ( increment-ptr s ) ( read-byte-from-stdin s ) ( increment-ptr s ) ( read-byte-from-stdin s ) ) ( check-equal? 3 ( vector-ref ( state-data s ) 0 ) ) ( check-equal? 1 ( vector-ref ( state-data s ) 1 ) ) ( check-equal? 4 ( vector-ref ( state-data s ) 2 ) ) ) ;; make sure standard output is doing something ( let ( [ s ( new-state ) ] ) ( set-state-data! s ( vector 80 76 84 ) ) ( let ( [ simulated-stdout ( open-output-string ) ] ) ( parameterize ( [ current-output-port simulated-stdout ] ) ( write-byte-to-stdout s ) ( increment-ptr s ) ( write-byte-to-stdout s ) ( increment-ptr s ) ( write-byte-to-stdout s ) ) ( check-equal? "PLT" ( get-output-string simulated-stdout ) ) ) ) ;; Let's see that we can clear. ( let ( [ s ( new-state ) ] ) ( set-state-data! s ( vector 0 29 92 14 243 1 6 92 ) ) ( set-state-ptr! s 7 ) ;; [ [-] < ] ( loop s ( loop s ( decrement-byte s ) ) ( decrement-ptr s ) ) ( check-equal? 0 ( state-ptr s ) ) ( check-equal? ( vector 0 0 0 0 0 0 0 0 ) ( state-data s ) ) )

Good! Our tests, at the very least, let us know that our definitions are doing something reasonable, and they should all pass.

However, there are a few things that we may want to fix in the future, like the lack of error trapping if the input stream contains eof. And there’s no bounds-checking on the ptr or on the values in the data. Wow, there are quite a few things that we might want to fix. But at the very least, we now have a module that captures the semantics of brainf*ck.

5 Lisping a language

brainf*ck programs with s-expressions. Let’s take that route, and create a "semantics.rkt" . We’ll create such a module language in "language.rkt" . We might even be cheeky enough to insist that people writeprograms with s-expressions. Let’s take that route, and create a module language that uses our. We’ll create such a module language in

"language.rkt" racket ( require "semantics.rkt" ) ( provide greater-than less-than plus minus period comma brackets ( rename-out [ my-module-begin #%module-begin ] ) ) ;; The current-state is a parameter used by the ;; rest of this language. ( define current-state ( make-parameter ( new-state ) ) ) ;; Every module in this language will make sure that it ;; uses a fresh state. ( define-syntax-rule ( my-module-begin body ... ) ( #%plain-module-begin ( parameterize ( [ current-state ( new-state ) ] ) body ... ) ) ) ( define-syntax-rule ( greater-than ) ( increment-ptr ( current-state ) ) ) ( define-syntax-rule ( less-than ) ( decrement-ptr ( current-state ) ) ) ( define-syntax-rule ( plus ) ( increment-byte ( current-state ) ) ) ( define-syntax-rule ( minus ) ( decrement-byte ( current-state ) ) ) ( define-syntax-rule ( period ) ( write-byte-to-stdout ( current-state ) ) ) ( define-syntax-rule ( comma ) ( read-byte-from-stdin ( current-state ) ) ) ( define-syntax-rule ( brackets body ... ) ( loop ( current-state ) body ... ) )

This "language.rkt" presents brainf*ck as a s-expression-based language. It uses the semantics we’ve coded up, and defines rules for handling greater-than, less-than, etc... We have a parameter called current-state that holds the state of the brainf*ck machine that’s used through the language.

#%module-begin #%module-begin There’s one piece of this language that looks particularly mysterious: what’s theform, and what is it doing? In Racket, every module has an implicitthat wraps around the entirety of the module’s body. We can see this by asking Racket to show us the results of the expansion process; here’s a small example to demonstrate.

syntax->datum ' #%kernel . What we should notice is that Racket has added in that #%module-begin "hello" and "world" . So there’s the implicit wrapping that Racket is doing. Ignore, for the moment, the use ofor the funky use of. What we should notice is that Racket has added in thataround theand. So there’s the implicit wrapping that Racket is doing.

#%module-begin brainf*ck runs under a fresh state. If we had two brainf*ck programs running, say like this: It turns out thatcan be really useful! In particular, we want to guarantee that every module written inruns under a fresh state. If we had twoprograms running, say like this:

brainf*ck ed each other’s data! By defining our own #%module-begin brainf*ck module has its own fresh version of the state, and our definition of my-module-begin does this for us. then it would be a shame to have the two programs clash just because theyed each other’s data! By defining our own, we can ensure that eachmodule has its own fresh version of the state, and our definition ofdoes this for us.

Once we’ve written "language.rkt" , we can use the language like this:

s-exp planet dyoo/bf/language ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( brackets ( greater-than ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( greater-than ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( greater-than ) ( plus ) ( plus ) ( plus ) ( greater-than ) ( plus ) ( less-than ) ( less-than ) ( less-than ) ( less-than ) ( minus ) ) ( greater-than ) ( plus ) ( plus ) ( period ) ( greater-than ) ( plus ) ( period ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( period ) ( period ) ( plus ) ( plus ) ( plus ) ( period ) ( greater-than ) ( plus ) ( plus ) ( period ) ( less-than ) ( less-than ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( plus ) ( period ) ( greater-than ) ( period ) ( plus ) ( plus ) ( plus ) ( period ) ( minus ) ( minus ) ( minus ) ( minus ) ( minus ) ( minus ) ( period ) ( minus ) ( minus ) ( minus ) ( minus ) ( minus ) ( minus ) ( minus ) ( minus ) ( period ) ( greater-than ) ( plus ) ( period ) ( greater-than ) ( period )

The #lang line here is saying, essentially, that the following program is written with s-expressions, and should be treated with the module language "language.rkt" that we just wrote up. And if we run this program, we should see a familiar greeting. Hurrah!

... But wait! We can’t just declare victory here. We really do want to allow the throngs of brainfu*ck programmers to write brainf*ck in the surface syntax that they deserve. Keep "language.rkt" on hand, though. We will reuse it by having our parser transform the surface syntax into the forms we defined in "language.rkt".

Let’s get that parser working!

6 Parsing the surface syntax

The Racket toolchain includes a professional-strength lexer and parser in the parser-tools collection. For the sake of keeping this example terse, we’ll write a simple recursive-descent parser without using the parser-tools collection. (But if our surface syntax were any more complicated, we might reconsider this decision.)

The expected output of a successful parse should be some kind of abstract syntax tree. What representation should we use for the tree? Although we can use s-expressions, they’re pretty lossy: they don’t record where they came from in the original source text. For the case of brainf*ck, we might not care, but if we were to write a parser for a more professional, sophisticated language (like LOLCODE) we want source locations so we can give good error messages during parsing or run-time.

As an alternative to plain s-expressions, we’ll use a data structure built into Racket called a syntax object; syntax objects let us represent ASTs, just like s-expressions, and they also carry along auxiliary information, such as source locations. Plus, as we briefly saw in our play with expand, syntax objects are the native data structure that Racket itself uses during macro expansion, so we might as well use them ourselves.

For example,

> ( define an-example-syntax-object ( datum->syntax #f ' hello ( list "hello.rkt" 1 20 32 5 ) ) )

datum->syntax #f . Let’s look at the structure of this syntax object. The first argument that we pass intolets us tell Racket any lexical-scoping information that we know about the datum, but in this case, we don’t have any on hand, so we just give it. Let’s look at the structure of this syntax object.

syntax->datum So a syntax object is a wrapper around an s-expression, and we can get the underlying datum by using. Furthermore, this object remembers where it came from, and that it was on line 1, column 20, position 32, and was five characters long:

read-byte port-next-location source-name parameter. We’ll write the following into "parser.rkt" . Now that we have some experience playing with syntax objects, let’s write a parser. Our parser will consume an input-port , from which we can read in bytes with, or find out where we are with. We also want to store some record of where our program originated from, so our parser will also take in aparameter. We’ll write the following into

"parser.rkt" racket ;; The only visible export of this module will be parse-expr. ( provide parse-expr ) ;; While loops... ( define-syntax-rule ( while test body ... ) ( let loop ( ) ( when test body ... ( loop ) ) ) ) ;; ignorable-next-char?: input-port -> boolean ;; Produces true if the next character is something we should ignore. ( define ( ignorable-next-char? in ) ( let ( [ next-ch ( peek-char in ) ] ) ( cond [ ( eof-object? next-ch ) #f ] [ else ( not ( member next-ch ' ( #\< #\> #\+ #\- #\, #\. #\[ #\] ) ) ) ] ) ) ) ;; parse-expr: any input-port -> (U syntax eof) ;; Either produces a syntax object or the eof object. ( define ( parse-expr source-name in ) ( while ( ignorable-next-char? in ) ( read-char in ) ) ( let*-values ( [ ( line column position ) ( port-next-location in ) ] [ ( next-char ) ( read-char in ) ] ) ;; We'll use this function to generate the syntax objects by ;; default. ;; The only category this doesn't cover are brackets. ( define ( default-make-syntax type ) ( datum->syntax #f ( list type ) ( list source-name line column position 1 ) ) ) ( cond [ ( eof-object? next-char ) eof ] [ else ( case next-char [ ( #\< ) ( default-make-syntax ' less-than ) ] [ ( #\> ) ( default-make-syntax ' greater-than ) ] [ ( #\+ ) ( default-make-syntax ' plus ) ] [ ( #\- ) ( default-make-syntax ' minus ) ] [ ( #\, ) ( default-make-syntax ' comma ) ] [ ( #\. ) ( default-make-syntax ' period ) ] [ ( #\[ ) ;; The slightly messy case is bracket. We keep reading ;; a list of exprs, and then construct a wrapping bracket ;; around the whole thing. ( let*-values ( [ ( elements ) ( parse-exprs source-name in ) ] [ ( following-line following-column following-position ) ( port-next-location in ) ] ) ( datum->syntax #f ` ( brackets ,@ elements ) ( list source-name line column position ( - following-position position ) ) ) ) ] [ ( #\] ) eof ] ) ] ) ) ) ;; parse-exprs: input-port -> (listof syntax) ;; Parse a list of expressions. ( define ( parse-exprs source-name in ) ( let ( [ next-expr ( parse-expr source-name in ) ] ) ( cond [ ( eof-object? next-expr ) empty ] [ else ( cons next-expr ( parse-exprs source-name in ) ) ] ) ) )

read-syntax This parser isn’t anything too tricky, although there’s a little bit of messiness because it needs to handle brackets recursively. That part is supposed to be a little messy anyway, since it’s the capstone that builds tree structure out of a linear character stream. (If we were using a parenthesized language, we could simply use, but the whole point is to deal with the messiness of the surface syntax!)

Let’s see if this parser does anything useful:

Good! So we’re able to parse syntax objects out of an input stream.

And as we can see, we can explode the syntax object and look at its datum. We should note that the parser is generating syntax objects that use the same names as the defined names we have in our "language.rkt" module language. Yup, that’s deliberate, and we’ll see why in the next section.

We mentioned that the parser wasn’t too hard... but then again, we haven’t written good traps for error conditions. This parser is a baby parser. If we were more rigorous, we’d probably implement it with the parser-tools collection, write unit tests for the parser with rackunit, and make sure to produce good error messages when Bad Things happen (like having unbalanced brackets or parentheses.

Still, we’ve now got the language and a parser. How do we tie them together?

7 Crossing the wires

This part is fairly straightforward. We have two pieces in hand:

A parser in "parser.rkt" for the surface syntax that produces ASTs

A module language in "language.rkt" that provides the meaning for those ASTs.

#lang line of the form: To combine these two pieces together, we want to define a reader that associates the two. When Racket encounters aline of the form:

it will look for a reader module in "lang/reader.rkt" and use it to parse the file.

"lang/" subdirectory, and create "reader.rkt" in that subdirectory, with the following content: Racket provides a helper module called syntax/module-reader to handle most of the dirty work; let’s use it. Make asubdirectory, and createin that subdirectory, with the following content:

"lang/reader.rkt" s-exp syntax/module-reader ( planet dyoo/bf/language ) #:read my-read #:read-syntax my-read-syntax ( require "../parser.rkt" ) ( define ( my-read in ) ( syntax->datum ( my-read-syntax #f in ) ) ) ( define ( my-read-syntax src in ) ( parse-expr src in ) )

syntax/module-reader that any syntax objects that come out are intended to take on their semantics from our language. syntax/module-reader is predisposed to assume that programs are read using read read-syntax parse-expr function into place. The second line of the file tellsthat any syntax objects that come out are intended to take on their semantics from our language.is predisposed to assume that programs are read usingand, so we override that default and plug in ourfunction into place.

Now that we have all these pieces together, does any of this work? Let’s try it!

$ cat hello2.rkt #lang planet dyoo/bf ++++++[>++++++++++++<-]>. >++++++++++[>++++++++++<-]>+. +++++++..+++.>++++[>+++++++++++<-]>. <+++[>----<-]>.<<<<<+++[>+++++<-]>. >>.+++.------.--------.>>+. $ racket hello2.rkt Hello, World!

Sweet, sweet words.

8 Landing on PLaneT

Finally, we want to get this work onto PLaneT so that other people can share in the joy of writing brainf*ck in Racket. Let’s do it!

First, let’s go back to the parent of our work directory. Once we’re there, we’ll use the planet create command.

$ planet create bf planet create bf MzTarring ./... MzTarring ./lang... WARNING: Package has no info.rkt file. This means it will not have a description or documentation on the PLaneT web site. $ ls -l bf.plt -rw-rw-r-- 1 dyoo nogroup 3358 Jun 12 19:39 bf.plt

"info.rkt" which provides metadata about our package. Good, diligent citizens would There are a few warnings, because we haven’t defined anwhich provides metadata about our package. Good, diligent citizens would write an "info.rkt" file , so let’s write one.

"info.rkt" setup/infotab ( define name "bf: a brainf*ck compiler for Racket" ) ( define categories ' ( devtools ) ) ( define can-be-loaded-with ' all ) ( define required-core-version "5.1.1" ) ( define version "1.0" ) ( define repositories ' ( "4.x" ) ) ( define scribblings ' ( ) ) ( define primary-file "language.rkt" ) ( define blurb ' ( "Provides support for the brainf*ck language." ) ) ( define release-notes ' ( ( p "First release" ) ) )

Before we upload the package, let’s make sure the "bf.plt" package works for us locally. We’ll simulate an installation. First, let’s break the development link.

$ planet unlink dyoo bf.plt 1 0

If we try running our test program from before, it should fail on us.

$ racket hello2.rkt require: PLaneT could not find the requested package: Server had no matching package: No package matched the specified criteria

Ok, that was expected. Since we’ve dissoved the development link, and since we haven’t uploaded the package onto the PLaneT network yet, we see the error that we expect to see.

Next, let’s use planet fileinject to simulate an installation of our package from PLaneT.

$ planet fileinject dyoo bf.plt 1 0 planet fileinject dyoo bf.plt 1 0 ============= Installing bf.plt on Sun, 12 Jun 2011 19:49:50 ============= raco setup: Unpacking archive from /home/dyoo/bf.plt raco setup: unpacking README in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: unpacking hello.rkt in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: unpacking hello2.rkt in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: making directory lang in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: unpacking reader.rkt in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./lang/ raco setup: unpacking language.rkt in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: unpacking parser.rkt in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: unpacking semantics.rkt in /home/dyoo/.racket/planet/300/5.1.1/cache/dyoo/bf.plt/1/0/./ raco setup: version: 5.1.1 [3m] ...

Lots and lots of output later, the package should be installed.

If we try running our test program again...

$ racket hello2.rkt Hello, World!

Good! This simulates the situation where the package has been installed from PLaneT.

Once we’re finally satisfied with the package’s contents, we can finally upload it onto PLaneT. If you log onto planet.racket-lang.org, the user interface will allow you to upload your "bf.plt" package.

9 Acknowledgements

Thanks to Shriram Krishnamurthi for being understanding when I told him I had coded a brainf*ck compiler. Shoutouts to the PLT group at Brown University — this one is for you guys. :)