typeless
an interpreter for λ-calculus implemented in ruby (by gurbaaz27)
Oga
Oga is an XML/HTML parser written in Ruby. (by yorickpeterse)
Our great sponsors
| typeless | Oga | |
|---|---|---|
| 4 | 1 | |
| 17 | 1,162 | |
| - | - | |
| 10.0 | 4.0 | |
| about 1 year ago | 11 months ago | |
| Ruby | Ruby | |
| MIT License | Mozilla Public License 2.0 |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
typeless
Posts with mentions or reviews of typeless.
We have used some of these posts to build our list of alternatives
and similar projects.
Oga
Posts with mentions or reviews of Oga.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-26.
-
How to write a compiler or interpreter in rust
In terms of parsing style I suggest sticking with a hand-written recursive-descent parser. Parser generators seem appealing at first, but I always ran into annoying limitations when using them (I wrote one in Ruby myself as well, and used this for this project). Parsing combinators are useful for small inputs, but I find them difficult to use for anything but simple cases.