A C library for building parsers, by defining non-left-recursive rules in a context-free grammar and composing them with combinators, and operating on the resulting abstract syntax trees.
Spl is a lightweight C library for defining and composing parsing rules to analyze text against custom grammars and build structured trees from matches.
How It Works
You stumble upon Spl while searching for a simple way to teach your program to understand patterns in text, like custom file formats.
You copy a few simple files into your own program folder so it's ready to use.
You write easy rules saying what characters or sequences to expect, like numbers or quotes.
You mix those rules together to handle full structures, like lists or maps, feeling the power as it grows.
You give it some sample text, and it checks if it fits your rules perfectly.
It hands you a clear map of the text's parts, ready to explore and use.
Now your program effortlessly breaks down any matching text into usable pieces, saving you tons of time!
Star Growth
Repurpose is a Pro feature
Generate ready-to-use prompts for X threads, LinkedIn posts, blog posts, YouTube scripts, and more -- with full repo context baked in.
Unlock RepurposeSimilar repos coming soon.