slouch
IParse
slouch | IParse | |
---|---|---|
2 | 5 | |
20 | 11 | |
- | - | |
4.6 | 3.3 | |
6 months ago | 5 months ago | |
Go | C++ | |
- | GNU General Public License v3.0 only |
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.
slouch
-
Designing a programming language to speedrun Advent of Code
> The title is clickbait. I did not design and implement a programming language for the sole or even primary purpose of leaderboarding on Advent of Code.
I did: https://github.com/lukechampine/slouch
"Find all ten-letter words that contain each of the letters A, B, and C exactly once and that have the ninth letter K"
:load wordlist wordlist.txt
-
Noulith: A new programming language currently used by the Advent of Code leader
Very cool. I also made a language specifically for AoC, with some similarities: https://github.com/lukechampine/slouch
Example of solving a (non-AoC) problem: https://youtu.be/i_zDbInYOpQ
One of my big takeaways is that the "IDE" plays a big role in how fast you can solve. Recomputing the expression on every keystroke seems a little insane, but the instant feedback you get is priceless.
IParse
-
I Wrote a String Type
Nice library with many features. But I do not always understand the focus on memory usage. I guess that the reason behind this is that less memory allocations, have a positive effect on execution times. In a parser, where you often have to compare identifiers, it is a good idea to put all strings for identifiers into a unique pointer with the help of a hash table.
In my interpreting parser [1] I use a hexa hash tree [2] for storing identifiers. It is not very memory efficient, but very fast. It turns every string (from the input buffer) into a unique pointer for that string pointing to a copy of the string. In this way comparing string (identifiers) is equivalent to comparing pointers.
The idea of the hexa hash tree is that is a tree where each node has sixteen child nodes. Which node is selected is based on a step wise evaluated hash function that first takes the lower four bytes of the string, and after reaching the end of the string, the higher four bytes of the string. The nodes often taken up more memory space than the strings themselves.
[1] https://github.com/FransFaase/IParse/
[2] https://github.com/FransFaase/IParse/blob/master/software/Id...
- Noulith: A new programming language currently used by the Advent of Code leader
-
The Tools I Use to Write Books (2018)
I wrote a tool that can process a number of MarkDown files with fragments of C code and put all those fragments in the right order to produce a file that can be compiled. It is grammar based and works with manipulating Abstract Syntax Trees, so I guess, it could be adapted for different programming languages. See: https://github.com/FransFaase/IParse#markdownc
-
C++ Compile Time Parser Generator
Interesting. I have not looked into the code, but I wonder whether it is a compiler, or just an interpreter, e.g. it converts the grammar into some internal representation that is executed by an interpreter or virtual machine. I started worked on an interpreting parser in C many years ago. And later also made Java, C++ and JavaScript version of it. For the JavaScript implementation, see: https://fransfaase.github.io/ParserWorkshop/Online_inter_par... For the C++ version, see: https://github.com/FransFaase/IParse
-
Parser generators vs. handwritten parsers: surveying major languages in 2021
I implemented an unparse function in IParse, which is not a parser generator, but a parser that interprets a grammar. See for example https://github.com/FransFaase/IParse/blob/master/software/c_... where symbols starting with a back slash are a kind of white space terminals during the unparse. For example, \inc stands for incrementing the indentation where \dec decrements it. The \s is used to indicate that at given location a space should be included.
What are some alternatives?
klongpy - High-Performance Klong array language with rich Python integration.
aoc - My Advent of Code solutions.
Crate - CrateDB is a distributed and scalable SQL database for storing and analyzing massive amounts of data in near real-time, even with complex queries. It is PostgreSQL-compatible, and based on Lucene.
Vyxal - A code-golfing language experience that has aspects of traditional programming languages - terse, elegant, readable.
ruby - The Ruby Programming Language
proton - Proton practical programming language
ctpg - Compile Time Parser Generator is a C++ single header library which takes a language description as a C++ code and turns it into a LR1 table parser with a deterministic finite automaton lexical analyzer, all in compile time.
AdventOfCode2022 - Advent of Code 2022
wefx - Basic WASM graphics package to draw to an HTML Canvas using C. In the style of the gfx library
noulith - *slaps roof of [programming language]* this bad boy can fit so much [syntax sugar] into it
pp - PP - Generic preprocessor (with pandoc in mind) - macros, literate programming, diagrams, scripts...