Skip to content
/ yarrlox Public

Yet Another Really Rusty Lox

License

Unknown, MIT licenses found

Licenses found

Unknown
LICENSE-APACHE
MIT
LICENSE-MIT
Notifications You must be signed in to change notification settings

uint/yarrlox

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Yet Another Really Rusty Lox

This software is not meant to be useful. It's merely for practice and learning.

But what is this?

This is a WIP implemetation of the Lox language described in the delightful light novel Crafting Interpreters. The lecture is highly recommended - it's a delectable romantic thriller, full of ups and down, relatable characters, and touching on universal human suffering with refreshing lightness.

Yes, the "really" wasn't really needed in the name. Ye better not complain lest ye be thrown ta th' sharks.

Progress

  • tree-walk interpreter: 11/13 chapters
  • bytecode VM: not started

Running yarrlox

First of all, get Rust if you need to.

Run the REPL:

cargo run

Run a Lox program:

cargo run -- scripts/fib.lox

Install it into your PATH if you like it a lot:

cargo install --path .

Differences from the Book

  • Binary operation precedence/associativity is handled with a precedence climbing algorithm.
  • The original jlox implementation seems to cleverly exploit Java's memory management and garbage collection so that the reader doesn't have to think about those... yet. For my tree-walk interpreter, I decided to pass small values by value and put bigger ones (functions, strings) in ref-counted pointers. This probably has implications about cycles and all that jazz. It's probably not ideal without deeper thought, but it lets me get on with the book without spending too much time here.
  • In Rust, there's no built-in mechanism for making every instance of a type uniquely identifiable. That's why the parser assigns a unique ID to every variable reference. Since those IDs are contiguous, our locals data collected by the resolver doesn't need to be a hashmap. It's a Vec instead.
  • No visitor pattern in the tree-walk interpreter. I couldn't find enough justification for doing that and opted for enums and pattern-matching instead.
  • Returning from the top level is not treated as an error. I started using this in integration tests since it's stupidly convenient.

Less-than-ideal stuff

I don't want to spend time fixing these in a toy language, but I want to note these.

  • If there are multiple resolution errors in source code, only the first one gets reported.
  • It feels like some code could be more functional and rely less on outside state (struct methods mostly).
  • Declaring the same name multiple times is an error in a local scope, but not in the global one. Feels like a confusing inconsistency.

License

Dual licensed under MIT and Apache 2.0 at your option, like most Rust project.

About

Yet Another Really Rusty Lox

Resources

License

Unknown, MIT licenses found

Licenses found

Unknown
LICENSE-APACHE
MIT
LICENSE-MIT

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages